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
The process of forwarding the packets of information is called
a) Routing
b) Switching
c) Communication
d) None of the above
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 in complete?
a) True
b) False
c) NA
d) N/A
