Scribd
Upload
42 views1 page

Text Books

This document outlines the units of study for a course on Design and Analysis of Algorithms. The 5 units cover: 1) Algorithm specification and analysis techniques like divide-and-conquer, greedy methods, and dynamic programming; 2) Basic graph traversal and search techniques like depth-first search; 3) Backtracking techniques and branch-and-bound methods; 4) Lower bound theory and comparison trees; 5) NP-hard and NP-complete problems and Cook's theorem on reductions. The course aims to teach general techniques for algorithm design and analysis.

Uploaded by

myjstoruser
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
42 views1 page

Text Books

This document outlines the units of study for a course on Design and Analysis of Algorithms. The 5 units cover: 1) Algorithm specification and analysis techniques like divide-and-conquer, greedy methods, and dynamic programming; 2) Basic graph traversal and search techniques like depth-first search; 3) Backtracking techniques and branch-and-bound methods; 4) Lower bound theory and comparison trees; 5) NP-hard and NP-complete problems and Cook's theorem on reductions. The course aims to teach general techniques for algorithm design and analysis.

Uploaded by

myjstoruser
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY ANANTAPUR

B.Tech. II - II Sem (CSE)

T
Tu
3
1
(13A05406) DESIGN AND ANALYSIS OF ALGORITHMS

C
3

UNIT I
Introduction: What is an Algorithm, Algorithm specification, Performance
analysis.
Divide and Conquer: General method, Binary Search, Finding the
maximum and minimum,
Merge sort, Quick Sort, Selection sort, Stressens matrix multiplication.
UNIT II
Greedy Method: General method, Knapsack problem, Job Scheduling with
Deadlines, Minimum cost Spanning Trees, Optimal storage on tapes, Singlesource shortest paths.
Dynamic programming: General Method, Multistage graphs, All-pairs
shortest paths, Optimal binary search trees, 0/1 knapsack, The traveling
sales person problem.
UNIT III
Basic Traversal and Search Techniques: Techniques for binary trees,
Techniques for Graphs, Connected components and Spanning trees, Biconnected components and DFS
Back tracking: General Method, 8 queens problem, Sum of subsets
problem, Graph coloring and Hamiltonian cycles, Knapsack Problem.
II Year Draft syllabus
UNIT IV
Branch and Bound: The method, Travelling salesperson, 0/1 Knapsack
problem, Efficiency
considerations.
Lower Bound Theory: Comparison trees, Lower bounds through reductions
Multiplying
triangular matrices, Inverting a lower triangular matrix, Computing the
transitive closure.
UNIT V
NP Hard and NP Complete Problems: NP Hardness, NP
Completeness, Consequences of being in P, Cooks Theorem, Reduction
Source Problems, Reductions: Reductions for some
known problems
Text Books:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, S. Satraj Sahani
andRajasekhran, 2nd edition, 2012, University Press.
2. Design and Analysis of Algorithms, Parag Himanshu Dave, Himanshu
Bhalchandra Dave, Second Edition, 2009, Pearson Education.

You might also like