Algorithms Answers

1.    Create a class to implement a queue using a circular array[20 marks]<o:p></o:p>

 a.     The class should contain functions to

                                    i.         Insert a new value, [5 marks]

                                  ii.         Delete a value. [5 marks]

a.      Describe the concept of a Binary heap and the heap order property. [10 marks]

b.     Explain the use of the binary heap as an effective implementation for a priority queue [10 MARKS]

a.       Use Prim’s algorithm starting at node A to compute the Minimum Spanning Tree (MST) of the following graph. In particular, write down the edges of the MST in the order in which Prim’s algorithm adds them to the MST. Use the format (node1; node2) to denote an edge.[8 marks]

a. Describe the concept of a Binary heap and the heap order property. [10 marks]

b. Explain the use of the binary heap as an effective implementation for a priority queue [10 MARKS]

a. Describe the concept of a Binary heap and the heap order property. [10 marks]

b. Explain the use of the binary heap as an effective implementation for a priority queue [10 MARKS]