Question 8 Consider the following Adjacency matrix corresonding to some weighted Graph ‘G’. What is the weight of the minimum spanning tree for the graph ‘G’? […]

Question 11 Which of the following algorithms is fastest to find shortest path from a source node to a destination node in an un-weighted connected graph? […]

Question 15 What is the total number of spanning trees of a complete graph of 4 vertices (K4)? A 16 B 8 C 4 D 15 […]

Question 16 Six files F1, F2, F3, F4, F5 and F6 have 100, 200, 50, 80, 120, 150 records respectively. In what order should they be […]