(A) True
(B) False
(C) NA
(D) NA
Tag: Fundamentals of Algorithms
est and worst case times of an algorithm may be same?
(A) True
(B) False
(C) NA
(D) NA
If, in a DFS forest of digraph G = (V, E), f[u] = f[v] for an edge (u, v) ? E then the edge is called?
(A) Back edge
(B) Forward edge
(C) Cross Edge
(D) Tree Edge
Edge (u, v) is a forward edge if?
(A) u is a proper descendant of v in the tree
(B) v is a proper descendant of u in the tree
(C) Both of these
(D) None of these
In order to move a tower of 6 rings from one peg to another, how many moves are required?
(A) 7
(B) 15
(C) 32
(D) 63
The recurrence relation of Tower of Hanoi is given below?
(A) ? 1 if n =1
(B) T n =?
(C) -133( )
(D) 2 (T n- +1) 1if n>1
Suppose we have two problems A and B .Problem A is polynomial-time reducible and problem B is NP-complete. If we reduce problem A into B then problem A becomes Npcomplete?
(A) True
(B) False
(C) NA
(D) NA
Which of the shortest path algorithms would be most appropriate for finding paths in the graph with negative edge weights and cycles? I.Dijkstra’s Algorithm II. Bellman-Ford Algorithm III. Floyd Warshall Algorithm?
(A) Only I
(B) Only II
(C) Only III
(D) Both II & III