Logic and Search Algorithms Quiz

Which of the following statements is a tautology in propositional logic?

• P∧¬P

• P∨¬P

• P→P

• P∧(P∨Q)

Which of the following statements is the correct symbolic representation for "All humans are mortal"?

• ∃x(Human(x)→Mortal(x))

• ∀x(Human(x)∧Mortal(x))

• ∀x(Human(x)→Mortal(x))

• ∃x(Human(x)∧Mortal(x))

Which of the following correctly applies the rule of Modus Ponens?

• Q→PQ

• ¬Q

• Q

• P∨QP

In refutation resolution, what does it mean to derive an empty clause □?

• The set of statements is satisfiable.

• The goal statement is true.

• There is a contradiction in the set of statements.

• All statements are universally true.

Which of the following search algorithms guarantees finding the shortest path in an unweighted graph?

• Depth-First Search (DFS)

• Breadth-First Search (BFS)

• A* Algorithm

• Greedy Best-First Search

In a Depth-First Search, nodes are expanded by:

• Lowest heuristic value

• Level order

• Last added node

• First added node

What data structure is commonly used to implement Breadth-First Search (BFS)?

• Stack

• Queue

• Priority Queue

• Hash Map

Which of the following algorithms is most likely to find the optimal path if the heuristic is admissible?

• Breadth-First Search

• Depth-First Search

• A* Algorithm

• Hill Climbing

The A * algorithm combines which two metrics for pathfinding?

• Distance and speed

• Heuristic and path cost

• Heuristic and time complexity

• Depth and heuristic

Which of the following algorithms uses a stack data structure?

• Breadth-First Search

• Depth-First Search

• A* Algorithm

• Dijkstra's Algorithm