| Question | Answer | % Correct |
|---|---|---|
| Halting Problem | No | 100%
|
| Minimum Spanning Tree | No | 100%
|
| Boolean Satisfiability Problem (SAT) | Yes | 100%
|
| Clique Problem | Yes | 100%
|
| Hamiltonian cycle problem | Yes | 100%
|
| Towers of Hanoi | No | 67%
|
| 2-SAT (Boolean Satisfiability Problem ×2) | No | 67%
|
| Solving Rubik’s Cube | No | 67%
|
| Knapsack Problem | Yes | 67%
|
| Vertex Cover Problem | Yes | 67%
|
| Traveling Salesman Problem (TSP) | Yes | 67%
|