MCQ1 mark
Assuming , which of the following is TRUE?
Single correct
Answer key coming soon
MCQ1 mark
The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with discs is
Single correct
Answer key coming soon
MCQ1 mark
Let and denote respectively, the worst case and average case running time of an algorithm executed on an input of size . Which of the following is ALWAYS TRUE?
Single correct
Answer key coming soon
MCQ2 marks
Let G be a weighted graph with edge weights greater than one and G′ be the graph constructed by squaring the weights of edges in G. Let T and T′ be the minimum spanning trees of G and G′, respectively, with total weights t and t′. Which of the following statements is TRUE?
Single correct
Answer key coming soon
MCQ2 marks
A list of strings, each of length , is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is
Single correct
Answer key coming soon
MCQ2 marks
Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijkstra's shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex is updated only when a strictly shorter path to is discovered.
Single correct
Answer key coming soon
Use ← → to move