Programming in C
Programming in C
4th Edition
ISBN: 9780321776419
Author: Stephen G. Kochan
Publisher: Addison-Wesley
Question
Book Icon
Chapter 13, Problem 1E
Program Plan Intro

Program Plan:

  • Include the necessary header files into program.
  • Declare the “typedef” variable in return type of “integer”.
  • Define the function named “testFunction()” which returns “1” in return type of integer.
  • Define the main method.
    • Define the function.
    • Declare the object for “FunctionPtr”.
    • Call the “testFunction” function and store the result in “objPtr”.
    • Print the result on screen.

Expert Solution & Answer
Check Mark
Program Description Answer

The following program is demonstrates the definition of “typedef” variable which represents a pointer to a function.

Explanation of Solution

Program:

//Include required header files

#include <stdio.h>

/*Definition of typedef function*/

typedef int(*FunctionPtr)(void);

/*Function definition*/

int testFunction(void)

{

//Return statement

return 1;

}

//Main funciton

int main(void)

{

//Function definition

int testFunction(void);

//Object declaration

FunctionPtr objPtr;

//Function is called by pointer

objPtr = testFunction;

//Print statement

printf("%i\n", objPtr());

//Return statement

return 0;

}

Sample Output

1

Want to see more full solutions like this?

Subscribe now to access step-by-step solutions to millions of textbook problems written by subject matter experts!
Students have asked these similar questions
1.) Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable. ii) Let ALLDFA = {(A)| A is a DFA and L(A) = "}. Show that ALLDFA is decidable. iii) Let AECFG = {(G)| G is a CFG that generates &}. Show that AECFG is decidable. iv) Let ETM {(M)| M is a TM and L(M) = 0}. Show that ETM, the complement of Erm, is Turing-recognizable. Let X be the set {1, 2, 3, 4, 5} and Y be the set {6, 7, 8, 9, 10). We describe the functions f: XY and g: XY in the following tables. Answer each part and give a reason for each negative answer. n f(n) n g(n) 1 6 1 10 2 7 2 9 3 6 3 8 4 7 4 7 5 6 5 6 Aa. Is f one-to-one? b. Is fonto? c. Is fa correspondence? Ad. Is g one-to-one? e. Is g onto? f. Is g a correspondence? vi) Let B be the set of all infinite sequences over {0,1}. Show that B is uncountable using a proof by diagonalization.
Can you find the least amount of different numbers to pick from positive numbers (integers) that are at most 100 to confirm two numbers that add up to 101 when each number can be picked at most two times?
Can you find the formula for an that satisfies the provided recursive definition? Please show all steps and justification
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
C++ Programming: From Problem Analysis to Program...
Computer Science
ISBN:9781337102087
Author:D. S. Malik
Publisher:Cengage Learning
Text book image
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Text book image
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning