Interested to Buy Any Domain ? << Click Here >> for more details...
2.main
{
int x,j,k;
j=k=6;x=2;
x=j*k;
printf("%d", x);
- 9 Answers
- 32533 Views
- HCL, Tech Mahindra, I also Faced
- E-Mail Answers
Answer Posted / kadamab
36
| Is This Answer Correct ? | 15 Yes | 5 No |
Post New Answer View All Answers
Explain what is the general form of a c program?
What is getch() function?
What are the different types of linkage exist in c?
How can I avoid the abort, retry, fail messages?
What is the difference between a function and a method in c?
What are the advantages and disadvantages of c language?
What is the heap?
Write a program which returns the first non repetitive character in the string?
How can you invoke another program from within a C program?
How can I manipulate individual bits?
What is character set?
Explain what are binary trees?
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.
Ow can I insert or delete a line (or record) in the middle of a file?
Write a program in "C" to calculate the root of a quadratic equation ax^2+bx+c=0, where the value of a,b & c are known.
