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. View Code 1
Q4: Implement a solution for a Constraint Satisfaction Problem using Branch and Bound and Backtracking for n-queens problem or a graph coloring problem. View Code 1
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. View Code 1