One of the three common problems that applications face now-a-days. Consider an inventory of 1 million(106) items of a store. If the application is to search an item, it has to search an item in 1 million(106) items every time slowing down the search. As data grows, search will become slower.

DATA STRUCTURES

Please wait while the activity loads.
If this activity does not load, try refreshing your browser. Also, this page requires javascript. Please visit using a browser with javascript enabled.

If loading fails, click here to try again

Question [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]

A	Data Search
B	Processor Speed
C	Multiple Request
D	None of the above

Explanation:

Detailed explanation-1: -Correctness − Data structure implementation should implement its interface correctly. Time Complexity − Running time or the execution time of operations of data structure must be as small as possible. Space Complexity − Memory usage of a data structure operation should be as little as possible.

Detailed explanation-2: -Which data structure is most efficient to find the top 10 largest items out of 1 million items stored in file? Explanation: Min heap of size 10 is sufficient to find the top 10 largest items.

Detailed explanation-3: -As data grows, search will become slower. One of the three common problems that applications face now-a-days. Processor speed although being very high, falls limited if the data grows to billion records.

Detailed explanation-4: -Which among the following data structures is best suited for storing very large numbers (numbers that cannot be stored in long long int). Following are the operations needed for these large numbers. Explanation: The only two choices that make sense are Array and Linked List.

There is 1 question to complete.

MCQ IN COMPUTER SCIENCE & ENGINEERING

COMPUTER SCIENCE AND ENGINEERING

DATA STRUCTURES