ITY211

DESIGN AND ANALYSIS OF

ALGORITHMS

Prerequisites:
Objectives:

LTPC 3 0 0 3

To introduce fundamental techniques for designing and analyzing

algorithms, including asymptotic analysis; divide-and-conquer
algorithms and recurrences; greedy algorithms; data structures;
dynamic programming; and algorithm design methods.
Expected Outcome:
On completion of the course the students will be able to design
and analyze the algorithms using mathematical and algorithmic
techniques.
UNIT I
BASIC CONCEPTS OF ALGORITHMS
No of Hrs :6
Introduction Notion of Algorithm Fundamentals of Algorithmic Solving
Fundamentals of the Analysis Framework Asymptotic Notations
UNIT II
MATHEMATICAL ASPECTS AND
No of Hrs :8
ANALYSIS OF ALGORITHMS
Mathematical Analysis of Non-recursive Algorithm Mathematical Analysis of Recursive
Algorithm Example: Fibonacci Numbers Empirical Analysis of Algorithms
Algorithm Visualization.
UNIT III
ANALYSIS OF SORTING AND
No of Hrs :8
SEARCHING ALGORITHMS
Brute Force Selection Sort and Bubble Sort Sequential Search Divide and conquer
Merge sort Quick Sort Binary Search Binary tree- Decrease and Conquer
Insertion Sort Depth first Search and Breadth First Search.
UNIT IV
ALGORITHMIC TECHNIQUES
No of Hrs :8
Transform and conquer Presorting Balanced Search trees Heaps and Heap sort
Dynamic Programming Warshalls and Floyds Algorithm Optimal Binary Search trees
Greedy Techniques Prims Algorithm Kruskals Algorithm Dijkstras Algorithm
UNIT V
ALGORITHM DESIGN METHODS
No of Hrs :8
Backtracking n-Queens Problem Subset-Sum problem Branch and bound
Assignment problem Knapsack problem Traveling salesman problem
Text Book:
1. Anany Levitin, Introduction to the Design and Analysis of Algorithm, Pearson
Education Asia, 2003.
References:
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to
Algorithms,Second Edition, PHI Pvt. Ltd., 2001
2. Sara Baase and Allen Van Gelder, Computer Algorithms - Introduction to Design and
Analysis, Pearson Education Asia, 2003.
3. A.V.Aho, J.E. Hopcroft and J.D.Ullman, The Design and Analysis Of Computer
Algorithms, Pearson Education Asia, 2003.
Assignments/Quizzes/Seminars/CAT/Term-end
Mode of Evaluation
Recommended by the 01/04/2011
Board of Studies on
22nd Academic Council held on 08/04/2011
Date of Approval by
the Academic Council