Question 1 : Of the following given options, which one of the following does not provides an optimal solution for 8-queens problem?
1. (5,3,8,4,7,1,6,2)
2. (1,6,3,8,3,2,4,7)
3. (4,1,5,8,6,3,7,2)
4. (6,2,7,1,4,8,5,3)
View Answer   Discuss with Members

Question 2 : If n=1, an imaginary solution for the problem exists.
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 3 : Of the following given options, which one of the following is a correct option that provides an optimal solution for 4-queens problem?
1. (3,1,4,2)
2. (2,3,1,4)
3. (4,3,2,1)
4. (4,2,3,1)
View Answer   Discuss with Members

Question 4 : In n-queen problem, how many values of n does not provide an optimal solution?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 5 : In general, backtracking can be used to solve?
1. Numerical problems
2. Exhaustive search
3. Combinatorial problems
4. Graph coloring problems
View Answer   Discuss with Members

Question 6 : How many possible solutions exist for an 8-queen problem?
1. 100
2. 98
3. 92
4. 88
View Answer   Discuss with Members

Question 7 : Who published the first solution of the eight queens puzzle?
1. Franz Nauck
2. Max Bezzel
3. Carl
4. Friedrich
View Answer   Discuss with Members

Question 8 : Backtracking algorithm is faster than the brute force technique
1. true
2. false
3.
4.
View Answer   Discuss with Members

Question 9 : Backtracking algorithm is implemented by constructing a tree of choices called as?
1. State-space tree
2. State-chart tree
3. Node tree
4. Backtracking tree
View Answer   Discuss with Members

Question 10 : Which of the following methods can be used to solve n-queen's problem?
1. greedy algorithm
2. divide and conquer
3. iterative improvement
4. backtracking
View Answer   Discuss with Members