Q1: Implement depth first search algorithm and Breadth First Search algorithm using an undirected graph and develop a recursive algorithm for searching all the vertices of a graph or tree data structure.

Q2: Implement A star (A*) Algorithm for any game search problem.

Note: Multiple "View Code" buttons may indicate different solutions to the same question or sub-parts of the question.

Q3: Implement Alpha-Beta Tree search for any game search problem.

Q4: Implement a solution for a Constraint Satisfaction Problem using Branch and Bound and Backtracking for n-queens problem or a graph coloring problem.

Q5: Implement Greedy search algorithm for any of the following applications: Selection Sort, Minimum Spanning Tree, Single-Source Shortest Path Problem, Job Scheduling Problem, Prim's MST, Kruskal's MST, or Dijkstra's Algorithm.

Q6: Develop an elementary chatbot for any suitable customer interaction application.