DAA (IT)

   

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) 

by 

PATHAN AHMED KHAN

 

Lecture Notes Unit Wise

DESIGN AND ANALYSIS OF ALGORITHMS (DAA) Notes Unit Wise
Unit I	Introduction
Unit II	Divide- and Conquer
	Greedy Method
Unit III	Dynamic Programming
	Backtracking
	Branch and Bounds
Unit IV	Graph Algorithms & Graph Traversal Technique
	Tries
Unit V	Computational Complexity NP-Hard and NP-Completeness

IMPORTANT QUESTIONS FOR IT :    Click Here 

LAB PROGRAMS: Click Here

DAA (IT) SYLLABUS : Click Here

DAA LAB PROGRAMS FOR IT 

Course Objective Course Outcomes Student will able to

 Develop and implement various searching and sorting techniques and estimate the complexities of searching and sorting algorithms.

 Solve knapsack problem using greedy method and dynamic programming.

 Develop and implement shortest path algorithms using Travelling salesman problem and All pair shortest path problem.

 Apply backtracking technique to solve N-queen problem.

 Construct graph traversals using breath first search and depth first search.

List of Experiments:

1. Implement Recursive Binary search and determine the time taken to search an element

2. Implement Linear search and determine the time taken to search an element.

3. Sort a given set of elements using Merge sort method and determine the time taken to sort the elements.

4. Sort a given set of elements using Quick sort method and determine the time taken to sort the elements.

5. Implement Knapsack problem using greedy method.

6. Implement 0/1 Knapsack problem using dynamic programming.

7. Implement any scheme to find the optimal solution for the Traveling Sales Person problem

8. Print all the nodes reachable from a given starting node in a digraph using BFS method.

9. Check whether a given graph is connected or not using DFS method

10. Develop a program to implement All pair shortest path.

11. Find Minimum Cost Spanning Tree of a given undirected graph using Kruskal's algorithm-

12. Find Minimum Cost Spanning Tree of a given undirected graph using Prim's algorithm-

13. Implement N Queen's problem using Back Tracking.