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: -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: -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-3: -Important problems such as sorting, searching, string processing, graph problems, Combinational problems, numerical problems are basic motivations for designing algorithm.
Detailed explanation-4: -Characteristics of a Data Structure Time Complexity-The running time or execution time of data structure operations must be as short as feasible. Space Complexity-A data structure operation should use as little memory as feasible.