COMPUTER SCIENCE AND ENGINEERING
DATA STRUCTURES
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
|
|
It makes efficient use of memory, using only as much memory as it needs
|
|
|
It will overflow if it exceeds its allocated memory
|
|
|
It allocates memory to pointers to keep track of where things are
|
|
|
The memory allocation is fixed so there is no need to check size when adding and removing data items
|
Detailed explanation-1: -A dynamic data structure has a dynamic size, that is, its size can grow and shrink based on the elements present in it at runtime. It makes efficient use of memory by using only that amount of space in memory that is required at any time.
Detailed explanation-2: -Arrays. An array is a linear data structure that holds an ordered collection of values. It’s the most efficient in storing and accessing a sequence of objects.
Detailed explanation-3: -Advantages of Dynamic Memory allocation This allocation method has no memory wastage. The memory allocation is done at run time. Memory size can be changed based on the requirements of the dynamic memory allocation. If memory is not required, it can be freed.
Detailed explanation-4: -Index-based access to elements is fast and efficient since the address of the element is known. Dynamic data structures, on the other hand, have a variable size and are allocated at run-time. This means that their memory size can be changed during program execution.
Detailed explanation-5: -A Bloom filter [1] is a space-efficient approximate data structure. It can be used if not even a well-loaded hash table fits in memory and we need constant read access.