COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
Static and dynamic
|
|
|
Fast and slow
|
|
|
Large and small
|
|
|
Ascending and descending
|
Detailed explanation-1: -Static data structures are of fixed size and memory is allocated at the compile time by the compiler and deallocates when they go out of scope or program ends. Dynamic data structures are of dynamic size and memory is allocated at the runtime for them by the program.
Detailed explanation-2: -Static Data structure has fixed memory size whereas in Dynamic Data Structure, the size can be randomly updated during run time which may be considered efficient with respect to memory complexity of the code. Static Data Structure provides more easier access to elements with respect to dynamic data structure.
Detailed explanation-3: -Dynamic data or transactional data is information that is periodically updated, meaning it changes asynchronously over time as new information becomes available. Data that is not dynamic is considered either static (unchanging) or persistent, which is data that is infrequently accessed and not likely to be modified.