Here you can download the free lecture Notes of Design and Analysis of Algorithms Notes pdf – DAA notes Pdf materials with multiple file links to download. The Design and Analysis of Algorithms pdf notes – DAA pdf notes book starts with the topics covering Algorithm,Psuedo code for expressing algorithms, Disjoint Sets- disjoint set operations, applications-Binary search, applications-Job sequencing with dead lines, applications-Matrix chain multiplication, applications-n-queen problem, applications – Travelling sales person problem, non deterministic algorithms, Etc.

## Design and Analysis of Algorithms Pdf Notes – DAA notes pdf

**Latest Material Links**

**Complete Notes**

**Link – Complete Notes**

**Unit 1**

**Link – Unit 1 Notes**

**Unit 2**

**Link – Unit 2 Notes**

**Unit 3**

**Link – Unit 3 Notes**

**Unit 4**

**Link – Unit 4 Notes**

**Unit 5**

**Link – Unit 5 Notes**

**Unit 6**

**Link – Unit 6 Notes**

**Unit 7**

**Link – Unit 7 Notes**

**Unit 8**

**Link – Unit 8 Notes**

**Old Material Links**

**Complete Notes**

**Link:Complete Notes**

**Unit 1**

**Link : Chapter 1 Notes**

**Unit 2**

**Link : Chapter 2 Notes**

**Unit 3**

**Link : Chapter 3 Notes**

**Unit 4**

**Link : Chapter 4 Notes**

**Unit 5**

**Link : Chapter 5 Notes**

**Unit 6**

**Link:Chapter 6 Notes**

**Unit 7**

**Link:Chapter 7 Notes**

**Unit 8**

**Link:Chapter 8 Notes**

**Unit 9**

**Link:Chapter 9 Notes**

**Unit 10**

**Link:Chapter 10 Notes**

**Note :-** These notes are according to the R09 Syllabus book of JNTU. In R13 and R15, 8-units of R09 syllabus are combined into 5-units in R13 and R15 syllabus. If you have any doubts please refer to the JNTU Syllabus Book.

**UNIT I**

Introduction: Algorithm,Psuedo code for expressing algorithms,Performance Analysis-Space complexity, Time complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta notation and Little oh notation,Probabilistic analysis, Amortized analysis.

**UNIT II**

Disjoint Sets- disjoint set operations, union and find algorithms, spanning trees, connected components and biconnected components.

**UNIT III**

Divide and conquer: General method , applications-Binary search, Quick sort, Merge sort, Strassen’s matrix multiplication.

**UNIT IV**

Greedy method: General method, applications-Job sequencing with dead lines, 0/1 knapsack problem, Minimum cost spanning trees, Single source shortest path problem.

### Design and Analysis of Algorithms Notes Pdf – DAA Pdf notes

**UNIT V**

Dynamic Programming: General method, applications-Matrix chain multiplication, Optimal binary search trees, 0/1 knapsack problem, All pairs shortest path problem,Travelling sales person problem, Reliability design.

**UNIT VI**

Backtracking: General method, applications-n-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles.

**UNIT VII**

Branch and Bound: General method, applications – Travelling sales person problem,0/1 knapsack problem- LC Branch and Bound solution, FIFO Branch and Bound solution.

**UNIT VIII**

NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP – Hard and NP Complete classes, Cook’s theorem.

**Reference:**

1. Introduction to Algorithms, secondedition,T.H.Cormen,C.E.Leiserson, R.L.Rivest,and C.Stein,PHI Pvt. Ltd./ Pearson Education

2. Introduction to Design and Analysis of Algorithms A strategic approach, R.C.T.Lee, S.S.Tseng, R.C.Chang and T.Tsai, Mc Graw Hill.

3. Data structures and Algorithm Analysis in C++, Allen Weiss, Second edition, Pearson education.

4. Design and Analysis of algorithms, Aho, Ullman and Hopcroft,Pearson education.

5. Algorithms – Richard Johnson baugh and Marcus Schaefer, Pearson Education

**Text books:**

1. Fundamentals of Computer Algorithms, Ellis Horowitz,Satraj Sahni and Rajasekharam,Galgotia publications pvt. Ltd.

2. Algorithm Design: Foundations, Analysis and Internet examples, M.T.Goodrich and R.Tomassia,John wiley and sons.

**Follow us on Facebook and Support us with your Like**

**Frequently Asked Questions**

**Q1: What are algorithms?**

A1: Instructions with finite sequences are called algorithms. Each instructions has a definite meaning which can be performed within limited time with appropriate effort. Whatever the input values may be, an algorithm terminates once it executes the complete instructions. Necessary criteria for every algorithm is input, output, definiteness, finiteness, effectiveness.

**Q2: What is data space?**

A2: The space required to store all values including constant and variable value is called data space. It has two components. Space required by the variables in a program and space required by dynamically allocated objects for example, arrays and class instances

**Q4: What are the factors on which running time of a program depends on?**

A4: Factors on which running time of a program depends on are

- Program input
- Quality of the code used to create the object program which is generated by the compiler
- Speed and nature of the instructions on the machine which is used to execute the program
- Algorithm’s time Complexity underlying the program

**Q5: What are heap and priority queue in data structure?**

A5: A data structure that permits anyone to insert an element into a set is called Heap. It also helps to find the largest element efficiently. A min Heap is binary tree in which the value of each node is less than or equal to those in its children. A max heap is a complete binary tree in which the value of each node is greater than or equal to those in its children,

Where as priority queue is a data structure which provides these two operations.

**Q3: What are the design goals of algorithm?**

A3: Design goals of algorithm mainly focuses on trying to save

- time
- space
- face