Data Structures MCQs with Answers
Practice important Data Structures MCQs with answers and explanations.
Multiple Choice Questions
Q511: In the percolateDown method, which condition ensures that the right child is considered if it is smaller than the left child?
- A: child != currentSize && array[child+1] < array[child]
- B: child < currentSize
- C: array[child] < tmp
- D: hole * 2 <= currentSize
View Answer
A
Q512: What does the getMin method return?
- A: The maximum value in the heap
- B: The minimum value in the heap without removing it
- C: The size of the heap
- D: The root element of the heap
View Answer
B
Q513: What does the buildHeap method do?
- A: It inserts elements into the heap one by one
- B: It builds a heap from an unordered array
- C: It removes elements from the heap
- D: It sorts the elements in the heap
View Answer
B
Q514: Which line in the buildHeap method initializes the currentSize variable?
- A: for(int i = 1; i <= n; i++)
- B: currentSize = n
- C: for( int i = currentSize / 2; i > 0; i-- )
- D: array[i] = anArray[i-1]
View Answer
B
Q515: What is the time complexity of the buildHeap algorithm?
- A: O(N log N)
- B: O(N)
- C: O(log N)
- D: O(N^2)
View Answer
B
Q516: Why is the percolateDown method preferred over swapping in terms of efficiency?
- A: It reduces the number of swap operations needed
- B: It increases the number of comparisons made
- C: It simplifies the code
- D: It increases the number of loop iterations
View Answer
A
Q517: In the percolateDown method, what is the purpose of the tmp variable?
- A: To store the value at the current index for comparison
- B: To store the value of the minimum child
- C: To store the value of the root element
- D: To store the index of the smallest child
View Answer
A
Q518: What does the isEmpty method check in the heap class?
- A: If the heap has reached its maximum capacity
- B: If the heap has no elements
- C: If the heap is full
- D: If the heap has space for more elements
View Answer
B
Q519: How does the increaseKey method in a heap operate?
- A: It increases the value of a key at a specified position
- B: It decreases the value of a key at a specified position
- C: It removes a key from the heap
- D: It restores the heap order after insertion
View Answer
A
Q520: What is the significance of the height of a node in a binary tree for the buildHeap process?
- A: It determines the number of levels in the heap
- B: It affects the efficiency of heap operations
- C: It defines the position of the node in the array
- D: It influences the time complexity of heap construction
View Answer
B