1).To identify articulation points in a graph _________ is useful.

[ c ]

a)Game tree b)in order traversal c) dfs d) none

2.)The solid edges of the depth first spanning tree of the gragh are called _____ edges.[ ]

a)heavy b)light c)dark d) tree

3.)Two biconnected components can have at least _________ in common.[ d ]

a) one vertex b) two vertices c) no vertex d)one edge

4.)In backtracking _______ constraints are the rules that determine the tuples of solution space.[ a ]

a)explicit b)implicit c)bounding function d) permutation tree

5.)The name backtrack was first coined by _____________[ a ]

a)lehmer b)Ullman c)Thompson d)bellman

6.)If we represent solution space in the form of a __________tree.[ c ]

a)BFS b)DFS c)State space d)min cost spanning tree

7.)A node is generated but its children not generated called ____ node.[ a ]

a)live b)dead c)expaned d) x

8.)If n = 4 the possible leaf nodes in the tree organization are _____[ d ]

a)4 b)8 c)20 d)16

9.)Branch and bound technique is applicable for ________ problem[ a ].

 a) Minimization b) maximization c) reliability d)BFS
10).A graph cannot be drawn on a plane without cross over between its edges called ______[ b ].
a)Planar b) non planar c) euler d) directed
11)The name backtrack was first coined by[ a]
a)D.H Lehmar b)J.D. Ullman c)K.Thompson d)R.E. Bellman
12).If M=15, n=4, =(10,10,12,18) and =(2,4,6,9) of 0/1 knapsack problem then the maximum profit is[ d ]

a)32 b)34 c)36 d)38

13.)In branch-and-bound method, for nodes representing infeasible solutions, C(x) =[ a]
a)Infinite b)0 c)1 d)2
14.)__________ Functions find a live node with least cost function in LC search[ c]
a)minimum () b) Maximum() c) Least() d) Search()
15.)We start at a particular node in the graph, visiting all nodes exactly once and come back to initial
node with minimum cost is known as[ d ]
a) 0/1 knapsack problem b) Optimal storage on tapes c)Minimum cost spanning tree d)Travelling
sales person problem
16.)For infinite state space trees with no answer nodes[ a ]
a)LC search will terminate b)LC search will not terminate c)LC search can not be conducted
d)Termination of LC search depends on cost function

17).The FIFO search coupled with bounding functions is called as[ a ]

a) FIFOBB b) Least count search c) Cumulative reduction function
d)Column reduction
18.)NP complete stands for [d ]
a)Natural polynomial time complete b)Non polynomial time complete
c)N-power time complete d)Non deterministic polynomial time complete
19).Only _________ can be NP complete[ c ]
a) Linear problems b) Non linear problems c) Decision problems
d)Hard problems
30 .____ problem no two adjacent vertices have same color.[ a ]

a) graph coloring b) lc search c) np problem d)p -problem