what is the difference between definition and declaration?
give me some examples.
Answer Posted / mohammed anas
declaration:
for example,int i;
definition:
declaration as well as initialisation is known as definition
for example int i=25;
Is This Answer Correct ? | 7 Yes | 0 No |
Post New Answer View All Answers
Can a pointer be static?
How can you increase the allowable number of simultaneously open files?
What is the symbol indicated the c-preprocessor?
Why do we need volatile in c?
simple program of graphics and their output display
using for loop sum 2 number of any 4 digit number in c language
What is function prototype in c language?
What are logical errors and how does it differ from syntax errors?
Differentiate between new and malloc(), delete and free() ?
Explain can the sizeof operator be used to tell the size of an array passed to a function?
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.
Is that possible to add pointers to each other?
What is the right type to use for boolean values in c?
what are the advantages of a macro over a function?
What is nested structure with example?