Question

Draw the complete undirected graphs on one, two, three, four and five

vertices. Prove that the number of edges in an n vertex complete graph is n(n-1)/2.

Sort the following list using Quick Sort technique, displaying each step. 20, 12, 25 6, 10, 15, 13

13

Consider the binary search tree given below.

Find the result of in-order, pre-order, and

post-order traversals.

Show the deletion of the root node

Insert 11, 22, 33, 44, 55, 66, and 77 in the tree







​

Answer 1

Answer:

answer

Explanation:

(1)Answer (C)

Connected components can be found in O(m + n) using Tarjan’s algorithm. Once we have connected components, we can count them.

(2)answer(d)

Dijkstra’s single source shortest path is not guaranteed to work for graphs with negative weight edges, but it works for the given graph