MIT- ADT University, Pune

MIT School of Engineering

B.Tech (CSE) SEMESTER VI

Course Code Course Title Category

Design and Analysis of Algorithms

Contact Hours per Week

CA FE Credits
L T D/P

4 1 0 40 60 100

Prerequisite:
 Basic knowledge of programming and mathematics.
 Fundamentals of Data Structure

COURSE CONTENT

Unit I Fundamentals of Algorithms 12

Problem solving principles: Classification of problem, problem solving strategies: Brute force
Approach, classification of time complexities (linear, logarithmic etc), asymptotic notations,
lower bound and upper bound: Best case, worst case, average case analysis, amortized analysis.
Recurrences: Formulation and solving recurrence equations using Master Theorem.

Unit II Brute Force and Divide and Conquer Strategy 12

Brute Force: Brute force string matching algorithms –NAÏVE string matching algorithms, Rabin
Karp algorithm; Divide and Conquer Methodology, Binary Search, Merge sort and its analysis,
Quick sort and its analysis, Strassen’s matrix multiplication

Unit III Greedy Techniques and Dynamic Programming 12

Greedy strategy: Principle, knapsack problem, scheduling algorithms- activity selection

problem; Dynamic Programming: Principle, applications-Matrix chain multiplication, Optimal
binary search trees, 0/1 knapsack problem, Transitive closure - Warshall’s and Floyds
algorithm, Travelling sales person problem, Flow network
Unit IV Backtracking and Branch –n-Bound 12
Backtracking: Principle, n-queen problem, sum of subsets problem. Branch-n-Bound:
Principle, strategies : FIFO, LIFO and LC approaches, TSP, knapsack problem.

Unit V Coping with the limitations of algorithm power 12

Lower Bound Arguments , P, NP NP- Complete and NP Hard Problems. Backtracking , n-

Queen problem , Hamiltonian Circuit Problem , Subset Sum Problem. Branch and Bound,
Knapsack Problem , Travelling Salesman Problem , Approximation Algorithms for NP-Hard
Problems: Travelling Salesman problem, Knapsack problem.

TEXT BOOKS
1. Horowitz and Sahani, "Fundamentals of Computer Algorithms", 2ND Edition. University
Press, ISBN: 978 81 7371 6126, 81 7371 61262.
2. Gilles Brassard and Paul Bartley, "Fundamental of Algorithms", PHI, New Delhi.
3. Thomas H Cormen and Charles E.L Leiserson, "Introduction to Algorithm" PHI

Reference Books:
1. Fayez Gebali, Algorithms and Parallel Computing, Willy, ISBN 978-0-470-90210-3(Indian
Paperback Edition)
2 .Anany Levitin, "Introduction to the Design and Analysis of Algorithms" Pearson Education
3 .Jon Kleinberg, EvasTardos, “Algorithm Design”, Pearson Education
4. Algorithms, Kenneth Berman and Jerome Paul, Cenage Learning ISBN-13 978-81-315-
0521-2R