MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 38 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structures and Algorithms knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
The leaves in a state-space tree represent only complete solutions. |
| A. | true |
| B. | false |
| Answer» C. | |
| 2. |
Who coined the term 'backtracking'? |
| A. | Lehmer |
| B. | Donald |
| C. | Ross |
| D. | Ford |
| Answer» B. Donald | |
| 3. |
How many fundamental solutions are there for the eight queen puzzle? |
| A. | 92 |
| B. | 10 |
| C. | 11 |
| D. | 12 |
| Answer» E. | |
| 4. |
Who published the eight queens puzzle? |
| A. | Max Bezzel |
| B. | Carl |
| C. | Gauss |
| D. | Friedrich |
| Answer» B. Carl | |
| 5. |
How many possible solutions occur for a 10-queen problem? |
| A. | 850 |
| B. | 742 |
| C. | 842 |
| D. | 724 |
| Answer» E. | |
| 6. |
Where is the n-queens problem implemented? |
| A. | carom |
| B. | chess |
| C. | ludo |
| D. | cards |
| Answer» C. ludo | |
| 7. |
Not more than 2 queens can occur in an n-queens problem. |
| A. | true |
| B. | false |
| Answer» C. | |
| 8. |
Who was the first person to find the solution of Eight Queen Puzzle using determinant? |
| A. | Max Bezzel |
| B. | Frank Nauck |
| C. | Gunther |
| D. | Friedrich |
| Answer» D. Friedrich | |
| 9. |
Who published the extended version of eight queens puzzle? |
| A. | Franz Nauck |
| B. | Max Bezzel |
| C. | Carl |
| D. | Friedrich |
| Answer» B. Max Bezzel | |
| 10. |
Who publish the bitwise operation method to solve the eight queen puzzle? |
| A. | Zongyan Qiu |
| B. | Martin Richard |
| C. | Max Bezzel |
| D. | Frank Nauck |
| Answer» B. Martin Richard | |
| 11. |
The problem of finding a subset of positive integers whose sum is equal to a given positive integer is called as? |
| A. | n- queen problem |
| B. | subset sum problem |
| C. | knapsack problem |
| D. | hamiltonian circuit problem |
| Answer» C. knapsack problem | |
| 12. |
Who proposed the depth first backtracking algorithm? |
| A. | Edsger Dijkshtra |
| B. | Max Bezzel |
| C. | Frank Nauck |
| D. | Carl Friedrich |
| Answer» B. Max Bezzel | |
| 13. |
In what manner is a state-space tree for a backtracking algorithm constructed? |
| A. | Depth-first search |
| B. | Breadth-first search |
| C. | Twice around the tree |
| D. | Nearest neighbour first |
| Answer» B. Breadth-first search | |
| 14. |
Placing n-queens so that no two queens attack each other is called? |
| A. | n-queen's problem |
| B. | 8-queen's problem |
| C. | Hamiltonian circuit problem |
| D. | subset sum problem |
| Answer» B. 8-queen's problem | |
| 15. |
How many solutions are there for 8 queens on 8*8 board? |
| A. | 12 |
| B. | 91 |
| C. | 92 |
| D. | 93 |
| Answer» D. 93 | |
| 16. |
___________ enumerates a list of promising nodes that could be computed to give the possible solutions of a given problem. |
| A. | Exhaustive search |
| B. | Brute force |
| C. | Backtracking |
| D. | Divide and conquer |
| Answer» D. Divide and conquer | |
| 17. |
A node is said to be ____________ if it has a possibility of reaching a complete solution. |
| A. | Non-promising |
| B. | Promising |
| C. | Succeeding |
| D. | Preceding |
| Answer» C. Succeeding | |
| 18. |
In how many directions do queens attack each other? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» D. 4 | |
| 19. |
Which one of the following is an application of the backtracking algorithm? |
| A. | Finding the shortest path |
| B. | Finding the efficient quantity to shop |
| C. | Ludo |
| D. | Crossword |
| Answer» E. | |
| 20. |
The problem of finding a list of integers in a given specific range that meets certain conditions is called? |
| A. | Subset sum problem |
| B. | Constraint satisfaction problem |
| C. | Hamiltonian circuit problem |
| D. | Travelling salesman problem |
| Answer» C. Hamiltonian circuit problem | |
| 21. |
What happens when the backtracking algorithm reaches a complete solution? |
| A. | It backtracks to the root |
| B. | It continues searching for other possible solutions |
| C. | It traverses from a different route |
| D. | Recursively traverses through the same route |
| Answer» C. It traverses from a different route | |
| 22. |
When was the first solution to Eight Queen Puzzle published? |
| A. | 1850 |
| B. | 1847 |
| C. | 1848 |
| D. | 1849 |
| Answer» B. 1847 | |
| 23. |
What is the domination number for 8-queen's problem? |
| A. | 8 |
| B. | 7 |
| C. | 6 |
| D. | 5 |
| Answer» E. | |
| 24. |
For how many queens was the extended version of Eight Queen Puzzle applicable for n*n squares? |
| A. | 5 |
| B. | 6 |
| C. | 8 |
| D. | n |
| Answer» E. | |
| 25. |
Which of the problems cannot be solved by backtracking method? |
| A. | n-queen problem |
| B. | subset sum problem |
| C. | hamiltonian circuit problem |
| D. | travelling salesman problem |
| Answer» E. | |
| 26. |
The problem of placing n queens in a chessboard such that no two queens attack each other is called as? |
| A. | n-queen problem |
| B. | eight queens puzzle |
| C. | four queens puzzle |
| D. | 1-queen problem |
| Answer» B. eight queens puzzle | |
| 27. |
When was the Eight Queen Puzzle published? |
| A. | 1846 |
| B. | 1847 |
| C. | 1848 |
| D. | 1849 |
| Answer» D. 1849 | |
| 28. |
Which of the following logical programming languages is not based on backtracking? |
| A. | Icon |
| B. | Prolog |
| C. | Planner |
| D. | Fortran |
| Answer» E. | |
| 29. |
Of the following given options, which one of the following is a correct option that provides an optimal solution for 4-queens problem? |
| A. | (3,1,4,2) |
| B. | (2,3,1,4) |
| C. | (4,3,2,1) |
| D. | (4,2,3,1) |
| Answer» B. (2,3,1,4) | |
| 30. |
If n=1, an imaginary solution for the problem exists. |
| A. | true |
| B. | false |
| Answer» C. | |
| 31. |
Who published the first solution of the eight queens puzzle? |
| A. | Franz Nauck |
| B. | Max Bezzel |
| C. | Carl |
| D. | Friedrich |
| Answer» B. Max Bezzel | |
| 32. |
In general, backtracking can be used to solve? |
| A. | Numerical problems |
| B. | Exhaustive search |
| C. | Combinatorial problems |
| D. | Graph coloring problems |
| Answer» D. Graph coloring problems | |
| 33. |
Which of the following methods can be used to solve n-queen's problem? |
| A. | greedy algorithm |
| B. | divide and conquer |
| C. | iterative improvement |
| D. | backtracking |
| Answer» E. | |
| 34. |
Of the following given options, which one of the following does not provides an optimal solution for 8-queens problem? |
| A. | (5,3,8,4,7,1,6,2) |
| B. | (1,6,3,8,3,2,4,7) |
| C. | (4,1,5,8,6,3,7,2) |
| D. | (6,2,7,1,4,8,5,3) |
| Answer» C. (4,1,5,8,6,3,7,2) | |
| 35. |
How many possible solutions exist for an 8-queen problem? |
| A. | 100 |
| B. | 98 |
| C. | 92 |
| D. | 88 |
| Answer» D. 88 | |
| 36. |
Backtracking algorithm is faster than the brute force technique |
| A. | true |
| B. | false |
| Answer» B. false | |
| 37. |
Backtracking algorithm is implemented by constructing a tree of choices called as? |
| A. | State-space tree |
| B. | State-chart tree |
| C. | Node tree |
| D. | Backtracking tree |
| Answer» B. State-chart tree | |
| 38. |
In n-queen problem, how many values of n does not provide an optimal solution? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» C. 3 | |