Question 11 : How many solutions are there for 8 queens on 8*8 board?
1. 12
2. 91
3. 92
4. 93
View Answer   Discuss with Members

Question 12 : The problem of finding a subset of positive integers whose sum is equal to a given positive integer is called as?
1. n- queen problem
2. subset sum problem
3. knapsack problem
4. hamiltonian circuit problem
View Answer   Discuss with Members

Question 13 : A node is said to be ____________ if it has a possibility of reaching a complete solution.
1. Non-promising
2. Promising
3. Succeeding
4. Preceding
View Answer   Discuss with Members

Question 14 : In what manner is a state-space tree for a backtracking algorithm constructed?
1. Depth-first search
2. Breadth-first search
3. Twice around the tree
4. Nearest neighbour first
View Answer   Discuss with Members

Question 15 : Who publish the bitwise operation method to solve the eight queen puzzle?
1. Zongyan Qiu
2. Martin Richard
3. Max Bezzel
4. Frank Nauck
View Answer   Discuss with Members

Question 16 : ___________ enumerates a list of promising nodes that could be computed to give the possible solutions of a given problem.
1. Exhaustive search
2. Brute force
3. Backtracking
4. Divide and conquer
View Answer   Discuss with Members

Question 17 : 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 18 : Who proposed the depth first backtracking algorithm?
1. Edsger Dijkshtra
2. Max Bezzel
3. Frank Nauck
4. Carl Friedrich
View Answer   Discuss with Members

Question 19 : 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 20 : Placing n-queens so that no two queens attack each other is called?
1. n-queen's problem
2. 8-queen's problem
3. Hamiltonian circuit problem
4. subset sum problem
View Answer   Discuss with Members