CMSC 341 Midterm 1 Exam
Verified Exam Questions and Answers Latest update 2026/2027
Question:
What operations are required to splay the node with key 80? (see quiz 4 #1) -
Answer:
zig-zag (right rotation - left rotation)
Question:
In a priority queue, the items leave the queue in the order that they arrived. -
Answer:
False
Question:
What is the array representation of nodes for the following heap data structure in an array
implementation? (see quiz 4 #3) -
Answer:
DKQZSY
Question:
In a unsorted list implementation of priority queue, the worst case running time of removal
operations is ... -
Answer:
O(n)
Question:
In a priority queue ADT, the smallest key always has the highest priority. -
Answer:
False
Question:
The height of a Heap data structure is ... -
Answer:
O(log n)
Question:
In the C++ STL class "std::priority_queue" the insertion operation is called ... -
Answer:
push (...)
Verified Exam Questions and Answers Latest update 2026/2027
Question:
What operations are required to splay the node with key 80? (see quiz 4 #1) -
Answer:
zig-zag (right rotation - left rotation)
Question:
In a priority queue, the items leave the queue in the order that they arrived. -
Answer:
False
Question:
What is the array representation of nodes for the following heap data structure in an array
implementation? (see quiz 4 #3) -
Answer:
DKQZSY
Question:
In a unsorted list implementation of priority queue, the worst case running time of removal
operations is ... -
Answer:
O(n)
Question:
In a priority queue ADT, the smallest key always has the highest priority. -
Answer:
False
Question:
The height of a Heap data structure is ... -
Answer:
O(log n)
Question:
In the C++ STL class "std::priority_queue" the insertion operation is called ... -
Answer:
push (...)
