Backtracking Algorithms
1. What is the type of the algorithm used in solving the 8 Queens problem?
A.  Backtracking B.  Dynamic C.  Branch and Bound D.  D and C
2. Let G be a graph with ‘n’ nodes and let ‘m’ be the chromatic number of the graph. Then the time taken by the backtracking algorithm to color it is
A.  O(nm) B.  O(n+m) C.  O(mnm) D.  O(nmn).
3. Find the odd one out from the following categories of algorithms.
A.  TVSP B.  N-Queens C.  15-Puzzle D.  Bin-Packing.
4. Name the node which has been generated but none of its children nodes have been generated in state space tree of backtracking method.
A.  Dead node B.  Live node C.  E-Node D.  State Node
5. What is the type of the algorithm used in solving the 4 Queens problem?
A.  Greedy B.  Dynamic C.  Branch and Bound D.  Backtracking.
6.

Which design strategy stops the execution when it find the solution otherwise starts the problem from top
A.  Back tracking B.  Divide and conquer C.  Branch and Bound D.  Dynamic programming
7.

what is the space complexity of 4-Queen problem
A.  O(|V|) B.  O(|E|) C.  O(|V|+|E|) D.  O(|V2|)
8. Time complexity of 4-queen problem
A.  O(|V|) B.  O(|E|) C.  O(|V|+|E|) D.  O(|V2|)
9. The method which stops the execution ,if it find the solution. Otherwise it start from the top
A.  Branch and bound B.  Dynamic programming C.  Back tracking D.  Divide and conquer
10. Which is not return optimal solution from the following methods
A.  Dynamic programming B.  Backtracking C.  Branch and bound D.  Greedy method