Can a pointer be volatile in c?
- 1 Answers
- 1081 Views
- I also Faced
- E-Mail Answers
Answer / Prateek Kumar Chahal
Yes, a pointer can be declared as volatile in C. The volatile keyword tells the compiler that the value of the variable may change outside the program and should not optimize its access.
| Is This Answer Correct ? | 0 Yes | 0 No |
why the execution starts from main function
How do you view the path?
What is a memory leak in structures? How can we rectify that?
what does exit() do?
What is null character in c?
dennis ritchie invented C language in AT&T bell laboratory what is the extension of AT&T?
What is the size of a union variable?
What is the use of bit field?
When should a type cast not be used?
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 is queue in c?
In the following control structure which is faster? 1.Switch 2.If-else and which consumes more memory?
C 
