# Answer to Question #45603 in Other Programming & Computer Science for Naf

Question #45603

i) Describe in detail (using pseudocode) the implementation of a priority queue based on a sorted

array. Show that your implementation achieves O(1) for operations min and removeMin, and O(n)

for insertions.

ii) Explain in a high-level way as well as in pseudo code how the removeMin operation works in

a min-heap.

iii). Explain in a high-level way and also using pseudo-code how to insert a key into a hash

table that uses linear probing for collisions. Assume the hash table is implemented using an array.

array. Show that your implementation achieves O(1) for operations min and removeMin, and O(n)

for insertions.

ii) Explain in a high-level way as well as in pseudo code how the removeMin operation works in

a min-heap.

iii). Explain in a high-level way and also using pseudo-code how to insert a key into a hash

table that uses linear probing for collisions. Assume the hash table is implemented using an array.

Expert's answer

## Comments

## Leave a comment