Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


Why ca not I do something like this?


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More C Interview Questions

In a switch statement, explain what will happen if a break statement is omitted?

0 Answers  


what is the output for this question: main() { int i=1; printf("%d%d%d",i,i++,++i); }

9 Answers  


What is malloc calloc and realloc in c?

0 Answers  


what is difference between array and structure?

44 Answers   College School Exams Tests, CTS, Google, HCL, IBM, Motorola, TCS,


Do variables need to be initialized?

0 Answers  


What is a function simple definition?

0 Answers  


which header file contains main() function in c?

17 Answers   Google, HCL, TCS,


cavium networks written test pattern ..

0 Answers   Cavium Networks,


At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E &#133;&#133;.. 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,&#133;&#133;&#133;&#133;.]. Each Car will load the packet with the same alphabet. So, for example, car &#145;A&#146; will load all the packets with name &#145;A&#146;. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car &#145;B&#146; will come and take all the packets with name &#145;B&#146; from the shelf, then car &#145;C&#146; will come. No matter how deep in the shelf any packet &#145;B&#146; is, all of the &#145;B&#146; packets will be displaced before the &#145;C&#146; 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.

0 Answers   Infosys,


C program to read the integer and calculate sum and average using single dimensional array

0 Answers  


can any one provide me the notes of data structure for ignou cs-62 paper

0 Answers   Ignou,


Can you write a programmer for FACTORIAL using recursion?

0 Answers   ADP,


Categories