JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

U Year B.Tech. CSE-II Sem L T/P/D C

4 -/-/- 4
(A40508) DESIGN AND ANALYSIS OF ALGORITHMS

Objectives:
To analyze performance of algorithms.
To choose the appropriate data structure and algorithm design method for a specified
application.
To understand h ow the choice of data structures and algorithm design methods impacts the
performance of programs.
To solve problems using algorithm design methods such as the greedy method, divide and
conquer, dynamic programming, backtrackings and branch and bound.
Prerequisites (Subjects) Data structure s, Mathematical foundations of computer science.
UNIT- I
Introduction: Algorithm, Pseudo code for expressing algorithms, Performance Analysis-Space
complexity, Time complexity, Asymptotic Notation- Big oh notation, Omega notation, The ta
notation and Little oh notation, Probabilistic analysis, Amortized complexity. Divide and
conquer: General method, applications-Binary search, Quick sort, Merge sort, Strassen's Matrix
Multiplication.
UNIT- II
Searching and Traversal Techniques: Efficient non-recursive binary tree traversal algorithms,
Disjoint se t operations, union and find algorithms, Spanning trees, Graph traversals- Breadth
first search and Depth first search, AND/OR graphs, game trees, Connected Components, Bi-
connected components.
UNIT- III
Greedy method: General method, applications-Job sequencing with deadlines, 0/1 knapsack
problem, Minimum cost spanning tree s, Single source shortest path problem. Dyna mic
Programming: General method, applications-Multistage graphs, Optimal binary search trees,0/1
knapsack problem, All pairs shortest path problem, Traveling sales person problem, Reliability
de sign.
UNIT- IV
Backtracking: General method, application s-n-queen problem, sum of subsets problem, graph
coloring, Hamiltonian cycles. Branch and Bound: General method, applications -
TraV~iOr,FIFO Branch problem,0/1 knapsack problem-LC Branch and Bound solu and Bound
solution.
UNIT- V
or-deterministic NP-Hard and NP-Complete problems: Basic concepts, Nroblems, Cook's
algorithms, NP - Hard and NP- Complete classes, NP-Hard P theorem.
TEXT BOOKS:
1. Fundamentals of Computer Algorithms, 2nd EdltlOl1~2008.
2. FSoaturanjdaStaiohnnsi oafnAdl S.Rajasekharan, Universities Pres d K.Naimipour gorithms,
4th edition, A.Neapolitanan '2. . I Jones and Bartlett Learning. [i9ve, Pearson I
EDdeusicgantioann,d2A00n8a.lysis of Algorithms, P.H.Dave,H.8. I 1) I
REFERENCEBOOKS:
'S5l ' 3rd Editio n,
1. ComputerAlgorithms, Introductionto DesignandA~Aiy Sara Baase, Allen, Van, Gelder,
Pearson Education.et examples, I 2. Algorithm Design: Foundations, Analysis and Intern
2) M.T.Goodrich and A.Tomassia, John Wiley and sons. fjerman and 3. Fundamentalsof
Sequentialand ParallelAlgorithms,K.A. J.LPaul, Cengage Learning. , (I'1s,A Levitin,-I
4. Introduction to ~he Design and Analysis of Algonth 3a) Pearson Education. ~.Leiserson, b)
Introduction to Algorithms,3rd Edition, T.H.Cormen, C. R.L.Rivest, and C.Stein, PHI Pvt.Ltd.
(Oft,Pearson Design and Analysls of algorithms, Aho, Ullman and HopeEducation,2004.
Outcomes: " of algorithms. . Be able to analyze algorithms and improve the efficiency
algorithms to Apply different designing methods for development of B~~detc. realistic problems,
such as divide and conquer, greedYalgorithm. . Ability to understand and estimate the
performance of Big