Interested to Buy Any Domain ? << Click Here >> for more details...
Answer Posted / vishnu
There is no non volatile key word in C.
we have volatile const
we have const
we have volatile key words.
| Is This Answer Correct ? | 4 Yes | 0 No |
Post New Answer View All Answers
What does a function declared as pascal do differently?
how to find anagram without using string functions using only loops in c programming
Write a function that will take in a phone number and output all possible alphabetical combinations
What is the maximum no. of arguments that can be given in a command line in C.?
Does free set pointer to null?
write a program using linked list in which each node consists of following information. Name[30] Branch Rollno Telephone no i) Write the program to add information of students in linked list
what is the difference between class and unio?
What is a null pointer assignment error? What are bus errors, memory faults, and core dumps?
What functions are used for dynamic memory allocation in c language?
Why does everyone say not to use gets?
In which language linux is written?
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.
Tell me can the size of an array be declared at runtime?
Can we assign string to char pointer?
How do you list files in a directory?
