Interested to Buy Any Domain ? << Click Here >> for more details...
what is data structure.in linear and non linear data
structures which one is better?Explain
- 3 Answers
- 8805 Views
- Wipro, I also Faced
- E-Mail Answers
Answer Posted / some guy
++linear and non-linear data structures have their own
significance ......which is better then the other is depend
on the application of data structure ...
for eg.
linear search vs. BST(binary search tree)
| Is This Answer Correct ? | 4 Yes | 1 No |
Post New Answer View All Answers
what are the advantages of a macro over a function?
Explain what are its uses in c programming?
Are there constructors in c?
What is the difference between ++a and a++?
What does s c mean in text?
Write a c program to build a heap method using Pointer to function and pointer to structure ?
Is c still relevant?
Can we declare function inside main?
What is difference between array and pointer in c?
What is the purpose of the preprocessor directive error?
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.
Can you define which header file to include at compile time?
Is c compiled or interpreted?
Explain what is the most efficient way to store flag values?
What is the purpose of main( ) in c language?
