Quiz 6

............. can compute the shortest path on an unweighted graph. (Topological Sort Breadth First Search Depth First Search)

Breadth First Search

Which of the following is not true about Dijkstra's algorithm?

It is a divide and conquer algorithm

Which of the following is a minimum spanning tree

Kruskal's Algorithm

Which of the following cannot be solved using Depth First Search (DFS) algorithm? (Finding all articulation points in a connected graph Searching a node in a graph Detecting Euler Circuit in a directed graph Detecting whether a graph is strongly connected or not)

None of above

Inserting an element into a max-heap takes .....

O(1) in best case and O(logn) in worst case

The running time of Prim's algorithm when priority queues (binary heap) are used is

O(|E|log|V|)

Running time of Breadth First Search is ............. as long as adjacency lists are used.

O(|V|+|E|)

Which of the following graph representation method is more space efficient?

adjacency list

A connected and weighted graph G always has exactly one minimum spanning tree.

false

A directed acyclic graph has ...................

no cycles

Which of the following is not a part of a graph? (edges, vertices, root)

root

If the graph G is connected, its minimum spanning tree T contains ........ edges.

|V| - 1