First question is compulsory.
Answer any FOUR from the remaining questions.
Answer ALL parts of any question at one place.
1. (a) Suppose you are performing a breath first search of a graph with n vertices, how large
can the queue get?
(b) what is complexity of dijk stra’s shortest distance algorithm?
(c) What...