Skip to main content

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.

Comments

Post a Comment

Popular posts from this blog

Web Application Development (WAD)

Web Application Development (WAD) WEB APPLICATION AND DEVELOPMENT ( WAD) Notes Unit Wise Unit I INTRODUCTION   HTML   CSS   WEB APPLICATION FUNDAMENTALS   Unit II XML   Unit III JQuery   JSON Java Script Unit IV AngularJS   Unit V MEAN Stack   SMACK Stack LAB PROGRAMS:  Click Here Important Question for MID I :  Click here WAD Previous Question : Click Here TEXT BOOK:  Click Hear Course Code Course Title Core/Elective PC 601 IT WEB APPLICATION DEVELOPMENT Core Prerequisite Contact hours per week CIE SEE Credits L T D P - 3 1 - - 30 70 3 Course Objective:     Ø    To develop dynamic web applications using the concepts of HTML 5.0 and   CSS     Ø    To understand the document structure and schemas and represent data in  t...
23 comments
Read more

DESIGN AND ANALYSIS OF ALGORITHMS – QUESTION BANK (CSE)

  ISL ENGINEERING COLLEGE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK                                         BE III Year II Semester (A & B Sections) –PC 603 CS     Academic Year: 2020-21 SHORT ANSWER QUESTIONS   UNIT-I 1.       Why is an algorithm analysis required? 2.       State about UNION & FIND operations. 3.       List out the UNION algorithm using weighting rule. 4.       Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 5.       List and define operations performed on sets? 6.       What do you mean by performance analysis of an algorithm? Explain. 7. ...
1 comment
Read more

DESIGN AND ANALYSIS OF ALGORITHMS – QUESTION BANK (IT)

  ISL ENGINEERING COLLEGE DEPARTMENT OF INFORMATION TECHNOLOGY DESIGN AND ANALYSIS OF ALGORITHMS QUESTION BANK BE III Year II Semester – PC 602 IT Academic Year: 2020-21 SHORT ANSWER QUESTIONS   UNIT-I 1.       Explain linear probing in Hashing with an example. 2.       Define Heap. 3.       List out the collision resolution techniques in hashing. 4.       Why is an algorithm analysis required? 5.       State about UNION & FIND operations. 6.       List out the UNION algorithm using weighting rule. 7.       Given f(n)=10n 2 +4n+3, then prove that f(n)=O(n 2 ). 8.       List and define operations performed on sets? 9.       What do you mean by performance analysi...
2 comments
Read more