MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 9 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Which of the following arrays are used in the implementation of list data type in python? |
| A. | Bit array |
| B. | Dynamic arrays |
| C. | Sparse arrays |
| D. | Parallel arrays |
| Answer» C. Sparse arrays | |
| 2. |
In special case, the time complexity of inserting/deleting elements at the end of dynamic array is __________ |
| A. | O (n) |
| B. | O (n<sup>1/2</sup>) |
| C. | O (log n) |
| D. | O (1) |
| Answer» B. O (n<sup>1/2</sup>) | |
| 3. |
The growth factor of ArrayList in Java is _______ |
| A. | 1 |
| B. | 1.5 |
| C. | 2 |
| D. | 0 |
| Answer» C. 2 | |
| 4. |
In which of the following cases dynamic arrays are not preferred? |
| A. | If the size of the array is unknown |
| B. | If the size of the array changes after few iterations |
| C. | If the memory reallocation takes more time i.e. expensive |
| D. | If the array holds less number of elements |
| Answer» E. | |
| 5. |
Both Dynamic array and Dynamically memory allocated array are same. |
| A. | True |
| B. | False |
| Answer» C. | |
| 6. |
The size of the dynamic array is deallocated if the array size is less than _________% of the backend physical size. |
| A. | 30 |
| B. | 40 |
| C. | 10 |
| D. | 20 |
| Answer» B. 40 | |
| 7. |
Dynamic arrays overcome the limit of static arrays. |
| A. | True |
| B. | False |
| Answer» B. False | |
| 8. |
Which of the following is a disadvantage of dynamic arrays? |
| A. | Locality of reference |
| B. | Data cache utilization |
| C. | Random access |
| D. | Memory leak |
| Answer» E. | |
| 9. |
Array is divided into two parts in ____________ |
| A. | Hashed Array Tree |
| B. | Geometric Array |
| C. | Bounded-size dynamic array |
| D. | Sparse Array |
| Answer» D. Sparse Array | |