Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / rina
pointer contains memory adresses as teir values since tese
memory addresses are the locations in the computer memory
are stored.
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
#include main() { char s[] = "Bouquets and Brickbats"; printf(" %c, ",*(&s[2])); printf("%s, ",s+5); printf(" %s",s); printf(" %c",*(s+2)); }
Is null valid for pointers to functions?
Which is the memory area not included in C program? give the reason
Differentiate between calloc and malloc.
about c language
Explain what are run-time errors?
Explain why c is faster than c++?
Why n++ execute faster than n+1 ?
Write a program to reverse a given number in c language?
How do you define a string?
what value is returned to operating system after program execution?
a character or group of characters that defines a register,or a part of storage a) memory b) byte c) address d) linear list
Define recursion in c.
What is a ternary operator in c?
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.
