1

Analysis of Algorithms
2
Copyright 2004, Infosys
Technologies Ltd
2
ER/CORP/CRS/SE15/003
Version No: 2.0
Course Objective
To introduce the principles and tools for analysis of algorithms
To analyze several popular algorithms
To introduce code tuning techniques
To introduce intractable problems
In this course:
You will learn to do an apriori analysis by doing an instruction count on the input
size
You will study the design principles of several popular algorithms and also perform
worst case analysis for these algorithms
You will learn to write efficient code
You will learn about special class of problems called intractable problems
3
Copyright 2004, Infosys
Technologies Ltd
3
ER/CORP/CRS/SE15/003
Version No: 2.0
References
Thomas H Cormen, Charles Leiserson, Ronald Rivest, Introduction to
Algorithms, Mc Grawhill, 2001
Anany Levitin, Introduction to The Design & Analysis of Algorithms, Pearson
Education, 2003
Alfred V Aho, John E Hopcroft, Jeffrey D Ullman, Design & Analysis of
Computer Algorithms, Addison Wesley Publishing Company, 1974
McConnell, S., Code Complete, Microsoft Press, 1993
Weiss M. W., Data Structures and Algorithm Analysis in C, Benjamin
Cummings, 1993
J Bentley, Programming Pearl, Addison Wesley, 1999
4
Copyright 2004, Infosys
Technologies Ltd
4
ER/CORP/CRS/SE15/003
Version No: 2.0
Session Plan
Day 1
Efficiency Measures
Basic Mathematical Principles
Code Tuning Techniques
Day 2
Framework for Analysis and Order notations
Analysis of well known algorithms
Day 1
Efficiency Measures
To introduce the concept of performance of a solution and to understand
the Space Time Tradeoffs
Basic Mathematical Principles
To introduce applicable mathematics as required for analyzing algorithms
Code Tuning Techniques
To explain the various Code Tuning Techniques that aid in writing better
code
Day 2
Framework for Analysis and Order notations
To introduce the concept of apriori analysis and to explain the concepts of
worst case and average case complexities
Analysis of well known algorithms
To understand the design principles of few familiar algorithms and to
analyze these algorithms
5
Copyright 2004, Infosys
Technologies Ltd
5
ER/CORP/CRS/SE15/003
Version No: 2.0
Session Plan
Day 3
Analysis of well known algorithms (Contd..)
Intractable Problems
Day 3
Intractable Problems
To introduce, with examples, the problem of intractability and to suggest
some techniques to solve intractable problems
To introduce the class of P and NP problems and study their relationship
To introduce the class of NP Complete and NP Hard problems
6
Copyright 2004, Infosys
Technologies Ltd
6
ER/CORP/CRS/SE15/003
Version No: 2.0
Thank You!