ICT212 Week 7

What is a common implementation of a priority queue?

• Array
• Linked List
• Binary Heap
• Stack

What ensures that a child node does not have a value smaller than its parent node in a Binary Heap?

• Completeness Property
• Linkage Property
• Min-Heap Property
• Tree Property

What happens in the Binary Heap when you want to send the most important message?

• Insert
• ExtractMin
• DecreaseKey
• SendMessage

For any element at position i, where is its Left Child located?

• 2*i
• 2*i + 1
• i-1
• i+1

Which operation in a Binary Heap has a time complexity of O(1)?

• Inserting a Key
• Getting the Minimum
• Extracting the Minimum
• None of the above

For any element at position i in a Binary Heap, where is its Right Child located?

• i+2
• 2*i
• 2*i + 1
• 2*i + 2

How is the highest level of a Binary Heap supposed to be completed?

• Randomly
• From right to left
• From bottom to top
• From left to right

Which operation is used when a message hasn't been sent for a while and needs higher priority?

• Insert
• ExtractMin
• DecreaseKey
• SendMessage

For any given element at position i, where will its Parent Node be located?

• i/2
• (i+1)/2
• (i-1)/2
• i-2

What is the time complexity of Extracting the Minimum from a Binary Heap?

• O(1)
• O(n)
• O(log n)
• O(n^2)