Interested to Buy Any Domain ? << Click Here >> for more details...
What is volatile in c language?
- 2 Answers
- 6160 Views
- HCL, TCS, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / venkata mahesh
compiler should not make any assumption about the variable
which declared as volatile.
| Is This Answer Correct ? | 8 Yes | 0 No |
What is the stack in c?
#define MAX(x,y) (x) >(y)?(x):(y) main() { inti=10,j=5,k=0; k= MAX(i++,++j); printf("%d..%d..%d",i,j,k); }
WRITE A PROGRAM TO MERGE TWO SORTED ARRAY USING MERGE SORT TECHNIQUE..
Explain which function in c can be used to append a string to another string?
What does *p++ do?
Explain the red-black trees?
Why #include is used in c language?
Identify the operators that is not used with pointer a. && b. # c. * d. >>
main() { int a[10]; printf("%d",*a+1-*a+3); }
Explain the use of #pragma exit?
Explain how does flowchart help in writing a program?
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.
C 
