Divide & Conquer
Divide & Conquer
Lab Assignment:
Write a program to implement Binary Search
Home Assignment:
Write a program to Implement Quick Sort
------------------------------------------------------------------------------------------------------
Day 2: Divide & Conquer
Lab Assignment:
Write a program to implement Merge Sort
Home Assignment:
Write a program to Find Maximum and Minimum element from a
array of integer
------------------------------------------------------------------------------------------------------
Day 3 : Graph Traversal Algorithm
Lab Assignment:
Write a program to Implement Breadth First Search (BFS)
Home Assignment:
Write a program to Implement Depth First Search (DFS)
------------------------------------------------------------------------------------------------------
Day 4 : Greedy Method
Lab Assignment:
Write a program to Implement Knapsack Problem (fractional)
Home Assignment:
Write a program to Implement Job sequencing with deadlines
------------------------------------------------------------------------------------------------------
Day 5 : Greedy Method
Lab Assignment:
Write a program to Implement Minimum Cost Spanning Tree by
Prim's Algorithm
Home Assignment:
i) Write a program to Implement Minimum Cost Spanning Tree by
Kruskal's Algorithm
ii) Write a program to Implement Single Source shortest Path for a graph
by Dijkstra Algorithm
------------------------------------------------------------------------------------------------------
Day 6: Dynamic Programming
Lab Assignment:
Write a program to find the minimum number of scalar multiplication
needed for chain of matrix
------------------------------------------------------------------------------------------------------
Heritage Institute of Technology
DESIGN & ANALYSIS OF ALGORITHMS Lab Assignment
Subject Code : INFO2253 Dept: IT Semester: 4th
Lab Assignment:
Write a program to Implement all pair of Shortest path for a graph by
Floyed- Warshall Algorithm
Home assignment:
Write a program to Implement Travelling Salesman Problem
------------------------------------------------------------------------------------------------------
Day 8 : Dynamic Programming
Lab Assignment:
Write a program to Implement Single Source shortest Path for a graph
by Bellman Ford Algorithm
-------------------------------------------------------------------------------------------------------
Day 9 : Backtracking
Lab Assignment:
Write a program to Implement n Queens Problem
------------------------------------------------------------------------------------------------------
Day 10 : Backtracking
Lab Assignment:
Write a program to Implement Graph Coloring Problem
------------------------------------------------------------------------------------------------------
Day 11 : Branch and Bound
Lab Assignment:
Write a program to Implement 15 Puzzle Problem