Data Structures MCQs with Answers
Practice important Data Structures MCQs with answers and explanations.
Chapter: 2
Q21:
In an array-based list implementation, what is the worst-case scenario for the add() method?
A. Adding at the end
B. Adding at the beginning
C. Adding in the middle
D. Adding after removal
Correct Answer:
B
Chapter: 2
Q22:
What does the length() method return in a list implementation?
A. Number of elements in the list
B. Size of the array
C. Index of the current element
D. Memory used by the list
Correct Answer:
A
Chapter: 2
Q23:
What does the back() method do in an array-based list implementation?
A. Moves current backward one step
B. Moves current to the first element
C. Moves current to the last element
D. Moves current forward one step
Correct Answer:
A
Chapter: 2
Q24:
Which function is used to traverse and search for an element in a list?
A. search()
B. traverse()
C. find()
D. scan()
Correct Answer:
C
Chapter: 2
Q25:
What is the function of the update(x) method in a list?
A. Adds element x to the end
B. Removes current element
C. Changes value at current position
D. Finds element x
Correct Answer:
C
Chapter: 2
Q26:
In a linked list, what does the next field of the last node point to?
A. Head of the list
B. The first node
C. NULL
D. Current node
Correct Answer:
C
Chapter: 2
Q27:
How is a linked list stored in memory?
A. Contiguously
B. In non-contiguous memory blocks
C. Sequentially
D. Randomly
Correct Answer:
B
Chapter: 2
Q28:
What does the head pointer in a linked list indicate?
A. The last node
B. The first node
C. The current node
D. The previous node
Correct Answer:
B
Chapter: 2
Q29:
In an array-based list, what is the complexity of removing the first element?
A. O(1)
B. O(log n)
C. O(n)
D. O(n^2)
Correct Answer:
C
Chapter: 2
Q30:
What happens when you try to move the current pointer backward from the first element in an array-based list?
A. It stays at the first element
B. It wraps around to the last element
C. It throws an error
D. It removes the first element
Correct Answer:
C
Chapter: 2
Q31:
How does the get() method in an array-based list function?
A. Removes the current element
B. Adds a new element
C. Returns the current element
D. Updates the current element
Correct Answer:
C
Chapter: 2
Q32:
What does the start() method set the current position to in an array-based list?
A. Index 0
B. Index 1
C. The last element
D. The middle element
Correct Answer:
B
Chapter: 2
Q33:
What does the end() method set the current position to in an array-based list?
A. Index 0
B. Index 1
C. The last element
D. The middle element
Correct Answer:
C
Chapter: 2
Q34:
In a linked list, what does each node contain?
A. Only the element
B. Element and index
C. Element and next node address
D. Element and previous node address
Correct Answer:
C
Chapter: 2
Q35:
What is the average case for the find() method in an array-based list?
A. Search half of the list
B. Search the entire list
C. Search the first element only
D. Search for the next element
Correct Answer:
A
Chapter: 2
Q36:
What does the current pointer refer to in a linked list implementation?
A. The first node
B. The last node
C. The current node
D. The previous node
Correct Answer:
C
Chapter: 3
Q37:
What is the limitation of using an array for constructing a list data structure?
A. Dynamic size
B. Fixed size
C. Flexible memory allocation
D. Variable length
Correct Answer:
B
Chapter: 3
Q38:
What data structure was introduced to overcome the limitation of arrays?
A. Stack
B. Queue
C. Linked List
D. Binary Tree
Correct Answer:
C
Chapter: 3
Q39:
In a linked list, what does the head pointer contain?
A. Value of the first node
B. Memory address of the first node
C. Memory address of the last node
D. Value of the last node
Correct Answer:
B
Chapter: 3
Q40:
What does the 'next' part of a linked list node contain?
A. Data
B. Head pointer
C. Memory address of the next node
D. NULL
Correct Answer:
C