Is there any restriction in how many arguments printf or
scanf function can take?
in which file in my c++ compiler i can see the code for
implementation of these two functions??
Answer Posted / uma sankar pradhan
printf() and scanf() are variable argument list functions
They can take any number of values as their arguments
The prototypes for these functions are found in the header
file "stdio.h"
| Is This Answer Correct ? | 20 Yes | 2 No |
Post New Answer View All Answers
what is recursion in C
When is a null pointer used?
Why array is used in c?
What is the difference between functions abs() and fabs()?
What is a substring in c?
What are the disadvantages of external storage class?
Why functions are used in c?
Write a program to print all permutations of a given string.
In a switch statement, explain what will happen if a break statement is omitted?
Can we initialize extern variable in c?
What is dynamic memory allocation?
typedef struct{ char *; nodeptr next; } * nodeptr ; What does nodeptr stand for?
What are the different types of C instructions?
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.
What are compound statements?