2) Problem Solving and Search Algorithms

Propositional Logic Propositional logic represents statements as propositions (or statements) that can either be true or false. It uses logical operators such as AND, OR, and NOT to combine propositions and make inferences. First-Order Logic First-order logic extends propositional logic by introducing variables, quantifiers (such as ∀ for “for all” and ∃ for “there exists”), […]

Route Planning Search algorithms are widely used in route planning applications such as GPS navigation systems, where the goal is to find the shortest path between two locations in a road network. Scheduling and Planning Search algorithms are used in scheduling and planning problems, such as job scheduling, task allocation, and resource management, to find

A* Search Algorithm A* search is an informed search algorithm that uses a heuristic function to estimate the cost of reaching the goal from a given state. It combines the cost of reaching the current state and the estimated cost to reach the goal, guiding the search towards the most promising paths. Greedy Best-First Search

Breadth-First Search (BFS) BFS explores all neighbor nodes of the current state before moving on to the next level of nodes. It guarantees finding the shallowest solution, but it may require substantial memory to store all explored nodes. Depth-First Search (DFS) DFS explores as far as possible along each branch before backtracking. It uses less

Understanding Problems Problem formulation is the process of defining and understanding the problem that needs to be solved. This involves identifying the initial state, goal state, actions available, and constraints within the problem domain. Problem Representation Once a problem is understood, it needs to be represented in a formal way that can be manipulated by