1.what is backtracking ?explain the implicit and explicit constraints.
2.define the following
1.state space tree
2. Problem state
3.solution state
4.answer state
5. live node
6.E.node
7.DEAD NODE
8.chromatic number of graph
3.describe 4-queens problem .draw and explain the portion of the tree for 4-queen problem that is generated.
4.explain the control abstraction of backtracking using recursive formulation.
5 explain the control abstraction of backtracking using Iterative formulation .
6.what is N-queens problem .write algorithm for N-queens problem.
7.explain graph coloring problem with an example. draw the portion of state space for a 4 node graph with 3-colorings.
8.write the algorithm to find all m-colorings of a graph.
9.write an algorithm for all m-coloring of graph.
9.what is Hamiltonian Cycle ?
Give an examples.
10.write an algorithm to find all the Hamiltonian cycles of a graph.
2.define the following
1.state space tree
2. Problem state
3.solution state
4.answer state
5. live node
6.E.node
7.DEAD NODE
8.chromatic number of graph
3.describe 4-queens problem .draw and explain the portion of the tree for 4-queen problem that is generated.
4.explain the control abstraction of backtracking using recursive formulation.
5 explain the control abstraction of backtracking using Iterative formulation .
6.what is N-queens problem .write algorithm for N-queens problem.
7.explain graph coloring problem with an example. draw the portion of state space for a 4 node graph with 3-colorings.
8.write the algorithm to find all m-colorings of a graph.
9.write an algorithm for all m-coloring of graph.
9.what is Hamiltonian Cycle ?
Give an examples.
10.write an algorithm to find all the Hamiltonian cycles of a graph.
0 comments: