8/13/2019 AOA_HDD

1/2

ER/CORP/CRS/SE15/001 Version No: 2.0

Analysis of Algorithms

Course Description

Course number SE15

Author(s) Ramkumar R, Sivasubramanyam Y.

CourseName

Analysis of Algorithms

Pre-requisites for attending course

Knowledge of Programming Fundamentals

Stream(Eg. Project

Mgmnt/Customer

Interface/Consulti

ng etc.)

Proje

ct

Mana

geme

nt

TargetRole1

(Eg.

SE/PA/P

M etc.)

SE,

PACompet

encies2

(TK, P,

T, D, A,

PS)

TK,

PType(E-

Essential,

D-

Desirable)

E Category3(Eg.PL/O

S/DB/NM

/SE/TO)

SE

Estimated course

duration

3 days, 9 hours of lecture

1PM Stream (Choose one)-SE: Software Engineer, PA: Programmer Analyst, PM: Project Manager2Competencies (Choose appropriate ones)-TK: Technical Knowledge, P: Programming, T: Testing, D:

Design, A: Analysis, PS: Pre-sales.3Category (Choose one)-PL: Programming or Programming Language, OS: Operating Systems, DB: Database, NM:Networks and Middleware, SE: Software Engg, TO: Technical Overview

Course ObjectivesSl# Objective Demonstrable knowledge/skills

1. To introduce the principles and tools foranalysis of algorithms

Ability to do apriori analysis by doing an

instruction count on the input size. Knowledge

of worst and average case complexities

2. To analyze several popular algorithms Ability to perform worst-case analysis forreasonably complex algorithms; ability to

perform average-case analysis for simple

algorithms

3. To introduce code tuning techniques Ability to write improved code4. To introduce intractable problems Knowledge of intractability; awareness of the

need to identify intractability in a givenproblem, and of its implication in algorithm

design

Course Design

Sl# Unit name Unit objectives and keywords Lecture

Duration

(Hrs.)

1. Introduction To explain, with an example, the meaning

and flavors of efficiency and tradeoffs. To

introduce applicable mathematics

1h

2. Code Tuning Techniques Provide practical tips on writing efficient

code

1h

3. Analyzing Algorithms To explain, with simple code fragments,

the concept of apriori analysis, worst and

average case complexities

2h

4. Analysis of well known

Algorithms

To motivate the participants to perform the

worst-case and average-case analysis of key

algorithms like Searching and Sorting

which are based on well known algorithm

design methodologies

4h

8/13/2019 AOA_HDD

2/2

ER/CORP/CRS/SE15/001 Version No: 2.0

5. Intractable Problems To give the participants a flavor of

intractability using the TSP and suggest

tactics to handle intractability

1h

Sources

1. Thomas H Cormen, Charles Leiserson, Ronald Rivest,Introduction to Algorithms, Mc Grawhill,2001

2. Anany Levitin,Introduction to The Design & Analysis of Algorithms, Pearson Education, 20033. Alfred V Aho, John E Hopcroft, Jeffrey D Ullman,Design & Analysis of Computer Algorithms,

Addison Wesley Publishing Company, 1974

4. McConnell, S., Code Complete,Microsoft Press, 19935. Weiss M. W.,Data Structures and Algorithm Analysis in C,Benjamin Cummings, 19936. J Bentley, Programming Pearl, Addison Wesley, 1999