# JNTUK R19 3-2 Design and Analysis of Algorithms Material PDF Download

0

Students those who are studying JNTUK R19 CSE Branch, Can Download Unit wise R19 3-2 Design and Analysis of Algorithms (DAA) Material/Notes PDFs below.

OBJECTIVES:

• To provide an introduction to formalisms to understand, analyze and denote time complexities of algorithms
• To introduce the different algorithmic approaches for problem solving through numerous example problems
• To provide some theoretical grounding in terms of finding the lower bounds of algorithms and the NP-completeness

UNIT-1

Introduction: Algorithm Definition, Algorithm Specification, performance Analysis, Performance measurement, Asymptotic notation, Randomized Algorithms. Sets & Disjoint set union: introduction, union and find operations.

Basic Traversal & Search Techniques: Techniques for Graphs, connected components and Spanning Trees, Bi-connected components and DFS.

UNIT-2

Divide and Conquer: General Method, Defective chessboard, Binary Search, finding the maximum and minimum, Merge sort, Quick sort.

The Greedy Method: The general Method, container loading, knapsack problem, Job sequencing with deadlines, minimum-cost spanning Trees.

UNIT-3

Dynamic Programming: The general method, multistage graphs, All pairs-shortest paths, singlesource shortest paths: general weights, optimal Binary search trees, 0/1 knapsack, reliability Design, The traveling salesperson problem, matrix chain multiplication.

UNIT-4

Backtracking: The General Method, The 8-Queens problem, sum of subsets, Graph coloring, Hamiltonian cycles, knapsack problem.

Branch and Bound: FIFO Branch-and-Bound, LC Branch-and-Bound, 0/1 Knapsack problem, Traveling salesperson problem.

UNIT-5

NP-Hard and NP-Complete problems: Basic concepts, Cook’s Theorem.

String Matching: Introduction, String Matching-Meaning and Application, Native String Matching Algorithm, Rabin-Karp Algorithm, Knuth-Morris-Pratt Automata, Tries, Suffix Tree.

Unit-5 Part-2 (All Units)

e-Resources:

https://nptel.ac.in

TEXT BOOKS:

1. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, “ Fundamentals of Computer Algorithms”, 2nd Edition, Universities Press.
2. Harsh Bhasin, “ Algorithms Design & Analysis”, Oxford University Press.

REFERENCE BOOKS:

1. Horowitz E. Sahani S: “Fundamentals of Computer Algorithms”, 2nd Edition, Galgotia Piblications, 2008.
2. S. Sridhar, “Design and Analysis of Algorithms”, Oxford University Press.

OUTCOMES:

• Describe asymptotic notation used for denoting performance of algorithms
• Analyze the performance of a given algorithm and denote its time complexity using the asymptotic notation for recursive and non-recursive algorithms
• List and describe various algorithmic approaches
• Solve problems using divide and conquer, greedy, dynamic programming, backtracking and branch and bound algorithmic approaches
• Apply graph search algorithms to real world problems
• Demonstrate an understanding of NP- Completeness theory and lower bound theory