Question 21 : For how many queens was the extended version of Eight Queen Puzzle applicable for n*n squares?
1. 5
2. 6
3. 8
4. n
View Answer   Discuss with Members

Question 22 : The problem of finding a list of integers in a given specific range that meets certain conditions is called?
1. Subset sum problem
2. Constraint satisfaction problem
3. Hamiltonian circuit problem
4. Travelling salesman problem
View Answer   Discuss with Members

Question 23 : Which one of the following is an application of the backtracking algorithm?
1. Finding the shortest path
2. Finding the efficient quantity to shop
3. Ludo
4. Crossword
View Answer   Discuss with Members

Question 24 : When was the Eight Queen Puzzle published?
1. 1846
2. 1847
3. 1848
4. 1849
View Answer   Discuss with Members

Question 25 : Which of the problems cannot be solved by backtracking method?
1. n-queen problem
2. subset sum problem
3. hamiltonian circuit problem
4. travelling salesman problem
View Answer   Discuss with Members

Question 26 : In how many directions do queens attack each other?
1. 1
2. 2
3. 3
4. 4
View Answer   Discuss with Members

Question 27 : What happens when the backtracking algorithm reaches a complete solution?
1. It backtracks to the root
2. It continues searching for other possible solutions
3. It traverses from a different route
4. Recursively traverses through the same route
View Answer   Discuss with Members

Question 28 : What is the domination number for 8-queen's problem?
1. 8
2. 7
3. 6
4. 5
View Answer   Discuss with Members

Question 29 : When was the first solution to Eight Queen Puzzle published?
1. 1850
2. 1847
3. 1848
4. 1849
View Answer   Discuss with Members

Question 30 : The problem of placing n queens in a chessboard such that no two queens attack each other is called as?
1. n-queen problem
2. eight queens puzzle
3. four queens puzzle
4. 1-queen problem
View Answer   Discuss with Members