Semester: IV Year: 2009-10

Course Title: Analysis and Design of Algorithms Course Code: 08 CSC403

Total Contact Hours: 40 hrs ( + 20 hrs tutorials) Duration of SEE: 3 hrs

SEE Marks: 50 CIE Marks: 50

Lesson Plan Author: : Prof.G.H.Joshi Date: 29-12-2009

Checked By: Ms.Sujata C Date: 30-01-2009

Course Learning Objectives-CLO

At the end of the course, the student should be ale to:

1. Describe the process of algorithmic problem solving.

2. Explain Asymptotic Notations used in Algorithm Analysis.

3. Outline the process of analysis of recursive and non-recursive algorithm.

4. Explain the following algorithm design techniques: Brute force, Divide and Conquer, Decrease and
Conquer, Transform and Conquer, Greedy, Dynamic Programming, Backtracking and Branch and Bound.

5. Design an algorithm for a given problem choosing an appropriate algorithm design technique.

6. Analyse a given algorithm using appropriate method.

7. Explain the techniques of finding the lower bounds on the performance of algorithms.
 Course Code and Title: 08 CSC403 Analysis and Design of Algorithms

Chapter Number/Title: 2. Fundamentals of the Analysis of Planned Hours: 6hrs

Algorithm Efficiency

Learning Objectives

The student should be able to

1. Describe the analysis framework of an algorithm (L2)

2. Explain the order of growth (L2)
3. Differentiate the Worst-case, Best-case and Average-Case efficiencies (L4)
4. Define the asymptotic notations used in the context of analysis of algorithm (L1).
5. Compare the orders of growth(L4)
6. List the basic asymptotic classes (L1)
7. Explain the useful properties involving asymptotic notations (L2)
8. Describe the general plan for analyzing time efficiency of Non recursive Algorithms (L2)
9. Analyze the efficiency of a given non recursive algorithm (L4)
10. Describe the general plan for analyzing time efficiency of recursive Algorithms (L2)
11. Analyze the efficiency of a given recursive algorithm (L4).

Lesson Schedule

Class No. Portion covered per hour (An estimate)

1. Analysis Framework
2. Analysis Framework contd.
3. Asymptotic Notations and Basic efficiency classes
4. Asymptotic Notations and Basic efficiency classes contd..
5. Mathematical Analysis of Non recursive Algorithms: Process and an example
6. Mathematical Analysis of Recursive Algorithms: Process and an example
Exercises on analysis of recursive and non-recursive algorithms ( Tutorial)