Backtracking Algorithms

**1.**What is the type of the algorithm used in solving the 8 Queens problem?

**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

**3.**Find the odd one out from the following categories of algorithms.

**4.**Name the node which has been generated but none of its children nodes have been generated in state space tree of backtracking method.

**5.**What is the type of the algorithm used in solving the 4 Queens problem?

**6.**

Which design strategy stops the execution when it find the solution otherwise starts the problem from top

**7.**

what is the space complexity of 4-Queen problem

**8.**Time complexity of 4-queen problem

**9.**The method which stops the execution ,if it find the solution. Otherwise it start from the top

**10.**Which is not return optimal solution from the following methods