Q1:The hash table requires much less space than a Direct Addressing Table.. Single choice.

True

False

Q2:The Total running time for Breadth-First Search is. Single choice.

O(|V| )

O(lg( |V|) * |E|)

O(|V| + |E|)

None of the answers is correct

Q3:In B-TREE: search, insert a mapping, delete an existing mapping in O(lg n) time

False

True

Q4:The memory requirement of adjacency list representation of a graph is..................?. Single choice.

Big theta of (|V| )

Big theta of (|V| + |E|)

Big theta of (|V| / |E|)

Big theta of (|V| * |E|)

Q5:The Time complexity of the Kruskal Algorithm is......................?. Single choice.

O(E lg E)

None of the answers is correct

O(E lg V)

O(V lg V)