COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Data Search
|
|
|
Processor Speed
|
|
|
Multiple Request
|
|
|
All of the Above
|
Detailed explanation-1: -As applications are becoming data-rich and complex, you can find 3 typical issues that apps deal with at present. These are Data Search, Processor speed, and Multiple requests.
Detailed explanation-2: -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-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: -Arrays, linked lists, stacks, queues, hash tables, trees, heaps, and graphs are the basic data structures.
Detailed explanation-5: -Some examples of complex types include struct(row), array/list, map and union. Complex types are supported by most programming languages including Python, C++ and Java. They are also supported by databases like PostgreSQL which introduced composite (struct) type in 8.0.