MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 3 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. |
What does stack overflow refer to? |
| A. | accessing item from an undefined stack |
| B. | adding items to a full stack |
| C. | removing items from an empty stack |
| D. | index out of bounds exception |
| Answer» C. removing items from an empty stack | |
| 2. |
Which of the following statements are not correct with respect to Singly Linked List(SLL) and Doubly Linked List(DLL)? |
| A. | Complexity of Insertion and Deletion at known position is O(n) in SLL and O(1) in DLL |
| B. | SLL uses lesser memory per node than DLL |
| C. | DLL has more searching power than SLL |
| D. | Number of node fields in SLL is more than DLL |
| Answer» E. | |
| 3. |
What is the best case time complexity of deleting a node in a Singly Linked list? |
| A. | O (n) |
| B. | O (n<sup>2</sup>) |
| C. | O (nlogn) |
| D. | O (1) |
| Answer» E. | |