COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Data Search
|
|
|
Processor Speed
|
|
|
Multiple Request
|
|
|
None of the above
|
Detailed explanation-1: -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-2: -If you are a programmer and want to choose a data structure for your program, consider these factors: The size of the data. The data dynamics, such as changing or editing the data. The speed of data use.
Detailed explanation-3: -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-4: -There are three cases which are usually used to compare various data structure’s execution time in a relative manner.