Interested to Buy Any Domain ? << Click Here >> for more details...
what is the advantage of function pointer
- 16 Answers
- 74551 Views
- CMC, CS, Freshdesk, L&T, LG Soft, Matrix, TCS, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / yogesh
It is useful when you want to send function as argument to
another function.
| Is This Answer Correct ? | 139 Yes | 13 No |
Answer / mahend
Function pointers are very important while implementing
Callback in C, for instance if Software has layered
archiecture, Function pointer are used bye upper layer to
register with below layer on certain conditions (i.e. some
event or interrupt)
| Is This Answer Correct ? | 72 Yes | 7 No |
Answer / vels
Function pointers are used to call functions at runt time
instead of compile time .
| Is This Answer Correct ? | 55 Yes | 7 No |
Answer / prakash
Function pointers are very useful to send the function as a
parameter to the another function.so,execution time will be
saved.code complexity will be redused
| Is This Answer Correct ? | 42 Yes | 7 No |
Answer / satty
Functional pointer are more readable and executed run time
| Is This Answer Correct ? | 43 Yes | 13 No |
function of pointer is more useful for use of large
function argument.it creats less complecty in function
argument.
| Is This Answer Correct ? | 29 Yes | 10 No |
Answer / vastram naik
Answer:
Pointers to functions are interesting when you pass them to
other functions. A function that takes function
pointers says, in effect, “Part of what I do can be
customized. Give me a pointer to a function, and I’ll call
it when that part of the job needs to be done. That function
can do its part for me.” This is known as a
“callback.” It’s used a lot in graphical user interface
libraries, in which the style of a display is built into the
library but the contents of the display are part of the
application.
As a simpler example, say you have an array of character
pointers (char*s), and you want to sort it by the value
of the strings the character pointers point to. The standard
qsort() function uses function pointers to
perform that task. (For more on sorting, see Chapter III,
“Sorting and Searching Data.”) qsort() takes four
arguments,
u a pointer to the beginning of the array,
u the number of elements in the array,
u the size of each array element, and
u a comparison function,
and returns an int.
The comparison function takes two arguments, each a pointer
to an element. The function returns 0 if the
pointed-to elements compare equal, some negative value if
the first element is less than the second, and some
positive value if the first element is greater than the
second. A comparison function for integers might look
like this:
int icmp( const int *p1, const int *p2 )
{
return *p1 - *p2;
}
C Programming: 146 Just the FAQs
The sorting algorithm is part of qsort(). So is the exchange
algorithm; it just copies bytes, possibly by calling
memcpy() or memmove(). qsort() doesn’t know what it’s
sorting, so it can’t know how to compare them. That
part is provided by the function pointer.
You can’t use strcmp() as the comparison function for this
example, for two reasons. The first reason is that
strcmp()’s type is wrong; more on that a little later. The
second reason is that it won’t work. strcmp() takes
two pointers to char and treats them as the first characters
of two strings. The example deals with an array
of character pointers (char*s), so the comparison function
must take two pointers to character pointers
(char*s). In this case, the following code might be an
example of a good comparison function:
int strpcmp( const void *p1, const void *p2 )
{
char * const *sp1 = (char * const *) p1;
char * const *sp2 = (char * const *) p2;
return strcmp( *sp1, *sp2 );
}
The call to qsort() might look something like this:
qsort( array, numElements, sizeof( char * ), pf2 );
qsort() will call strpcmp() every time it needs to compare
two character pointers (char*s).
Why can’t strcmp() be passed to qsort(), and why were the
arguments of strpcmp() what they were?
A function pointer’s type depends on the return type of the
pointed-to function, as well as the number and
types of all its arguments. qsort() expects a function that
takes two constant void pointers:
void qsort( void *base,
size_t numElements,
size_t sizeOfElement,
int (*compFunct)( const void *, const void *) );
Because qsort() doesn’t really know what it’s sorting, it
uses a void pointer in its argument (base) and in
the arguments to the comparison function. qsort()’s void*
argument is easy; any pointer can be converted
to a void* without even needing a cast. The function pointer
is harder.
For an array of character arrays, strcmp() would have the
right algorithm but the wrong argument types. The
simplest, safest way to handle this situation is to pass a
function that takes the right argument types for
qsort() and then casts them to the right argument types.
That’s what strpcmp() does.
If you have a function that takes a char*, and you know that
a char* and a void* are the same in every
environment your program might ever work in, you might cast
the function pointer, rather than the pointedto
function’s arguments, in this way:
char table[ NUM_ELEMENTS ][ ELEMENT_SIZE ];
/* ... */
/* passing strcmp() to qsort for array of array of char */
qsort( table, NUM_ELEMENTS, ELEMENT_SIZE,
( int (*)( const void *, const void * ) ) strcmp );
Casting the arguments and casting the function pointer both
can be error prone. In practice, casting the
function pointer is more dangerous.
The basic problem here is using void* when you have a
pointer to an unknown type. C++ programs sometime
solve this problem with templates.
| Is This Answer Correct ? | 21 Yes | 9 No |
Answer / nupur
It is used to return more than one value to at a time to
the main program thus overcome the limitation of returnalso
it is used to change the value of the actual argument in
the called function which is otherwise not possible.
| Is This Answer Correct ? | 13 Yes | 5 No |
Answer / vidhya
It is more efficient. So it mostly used in real type
application.
The use of pointer is to store address location of a
variable or a function.as similar we are storing a variable
address in a pointer variable and refering it ,we can store
the address of a function in pointer variable.
| Is This Answer Correct ? | 12 Yes | 6 No |
what is ur strangth & weekness
0 Answers Cognizant, LG Soft, NetEnrich,
Explain the difference between getch() and getche() in c?
please can some one guide me, to the answer Write a C program to enter 15 numbers as an input from the keyboard and program will find and print odd numbers and their average. i have studied while and do while loop for loop if and else if switch
What are the preprocessor categories?
what is pointer ?
10 Answers Kernex Micro Systems,
Write a c program to build a heap method using Pointer to function and pointer to structure ?
What is difference between structure and union in c programming?
Which is an example of a structural homology?
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.
Define circular linked list.
what are threads ? why they are called light weight processes ? what is the relation between process and threads ?
show how link list can be used to repersent the following polynomial i) 5x+2
C 
