Answer Posted / soumava bose

suppose B1,B2,& B3 care the baskets.Now we will first open
B1.suppose it contains Oranges.Then its level would be
either Appale or Combination.Now suppose The lebel is
combination.Now the basket with lebel orange is
interchanged with it.As initially all baskets had wrong
lebels.so the basket with lebel appale must have either
orange or combination.so now we interchange the two lebels
of the remaining baskets & get the proper answer.

What is the purpose of the following code? Is there any problem with the code? void send(int count, short *to, short *from) { /* count > 0 assumed */ register n = (count + 7) / 8; switch (count % 8) { case 0: do { *to = *from++; case 7: *to = *from++; case 6: *to = *from++; case 5: *to = *from++; case 4: *to = *from++; case 3: *to = *from++; case 2: *to = *from++; case 1: *to = *from++; } while (--n > 0); } }

2502

---

What is the right type to use for boolean values in c? Is there a standard type?

1016

---

Explain what is the purpose of "extern" keyword in a function declaration?

1073

---

Differentiate between new and malloc(), delete and free() ?

1184

---

When do you not use the keyword 'return' when defining a function a) Always b) Never c) When the function returns void d) dfd

1060

---

Explain how are portions of a program disabled in demo versions?

1122

---

What is the general form of #line preprocessor?

997

---

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.

2187

---

What is realloc in c?

1113

---

Is there sort function in c?

1018

---

Is main is a keyword in c?

1129

---

how do you write a function that takes a variable number of arguments? What is the prototype of printf () function?

1938

---

Why do we use null pointer?

1067

---

What is unary operator?

1108

---

how to make a scientific calculater ?

2072

---