You have an adjacency list for G, what is the time complexity to compute Graph transpose GɅT?
a) (V+E)
b) (VE)
c) (V)
d) (V^2)
The relationship between number of back edges and number of cycles in DFS is?
a) Both are equal
b) Back edges are half of cycles
c) Back edges are one quarter of cycles
d) There is no relationship between no. of edges and cycles
What is the time complexity to extract a vertex from the priority queue in Prim's algorithm?
a) log (V)
b) V.V
c) E.E
d) log €
Analysis of Selection algorithm ends up with?
a) T(n)
b) T(1 / 1 + n)
c) T(n/2)
d) T((n/2) + n)
Sorting is one of the few problems where provable........bonds exits on how fast we can sort.
a) lower
b) upper
c) average
d) log n
Divide-and-conquer as breaking the problem into a small number of?
a) smaller sub problems
b) pivot
c) Sieve
d) Selection
