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. |
The concatenation of two lists can be performed in O(1) time. Which of the following variation of the linked list can be used? |
| A. | Singly linked list |
| B. | Doubly linked list |
| C. | Circular doubly linked list |
| D. | Array implementation of list |
| Answer» D. Array implementation of list | |
| 2. |
What would be the asymptotic time complexity to insert an element at the front of the linked list (head is known)? |
| A. | O(1) |
| B. | O(n) |
| C. | O(n<sup>2</sup>) |
| D. | O(n<sup>3</sup>) |
| Answer» B. O(n) | |
| 3. |
In linked list each node contains a minimum of two fields. One field is data field to store the data second field is? |
| A. | Pointer to character |
| B. | Pointer to integer |
| C. | Pointer to node |
| D. | Node |
| Answer» D. Node | |