FT/GN/68/01/23.01.16
SRI VENKATESWARA COLLEGE OF ENGINEERING
COURSE DELIVERY PLAN - THEORY
Page 1 of 6
LP: CS6402
Department of Computer Science and Engineering
B.E/B.Tech/M.E/M.Tech : CS/IT
Rev. No: 00
Regulation:2013
Date: 02/01/2017
Sub. Code / Sub. Name : CS6402 DESIGN AND ANALYSIS OF ALGORITHMS
Unit
:I
Unit Syllabus:INTRODUCTION
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types –
Fundamentals of the Analysis of Algorithm Efficiency – Analysis Framework – Asymptotic Notations and its
properties – Mathematical analysis for Recursive and Non-recursive algorithms.
Objective:To know about different types of computing problem algorithms and learn how to analyze its
efficiency.
Session
No *
Topics to be covered
Ref
Teaching
Aids
1
Introduction, Algorithm, Notion of algorithm
1-ch1.1;pg 1-7
2-ch 1.1;pg5-11
PPT
2
Fundamentals of Algorithmic Problem Solving-steps in designing and
analyzing an algorithm
1-ch1.2;pg9-16
2-ch 2.3;pg30-39
PPT
3
Important Problem Types- Sorting.searching, string processing,
graph, geometric, numeric and combinatorial problems
1-ch1.3;pg18-23
PPT
4
Fundamentals of the Analysis of Algorithm Efficiency, Analysis
Framework, measuring input size, units for measuring
running time,
5
Analysis Framework, Orders of growth, worst, best and average case
analysis, recapitulation of Analysis Framework.
1-ch2.1;pg45-50
2-ch2.2;pg23-29
6
Asymptotic Notations and its properties- Informal, Big-oh, Bigomega, Big-theta notation
7
Mathematical analysis for Non-recursive algorithms –General plan
for analyzing time efficiency
1-ch2.2;pg52-58
2-ch3.1;pg43-53
4-ch 2.1;pg31-57
1-ch2.3;pg61-67
8
Mathematical analysis for Recursive algorithms –General plan for
analyzing time efficiency
9
Fundamental Data structures,Sample problems
Content beyond syllabus covered (if any): Fundamental Data structures
* Session duration: 50 minutes
1-ch2.1;pg41-45
1-ch2.4;pg70-76
2-ch4.1pg65-74
1-ch1.4;pg8,16-18
PPT
PPT
PPT
PPT
PPT
PPT
FT/GN/68/01/23.01.16
SRI VENKATESWARA COLLEGE OF ENGINEERING
COURSE DELIVERY PLAN - THEORY
Page 2 of 6
Sub. Code / Sub. Name: CS6402 DESIGN AND ANALYSIS OF ALGORITHM
Unit : II
Unit Syllabus : BRUTE FORCE AND DIVIDE-AND-CONQUER
Brute Force - Closest-Pair and Convex-Hull Problems-Exhaustive Search - Traveling Salesman Problem Knapsack Problem - Assignment problem. Divide and conquer methodology – Merge sort – Quick sort – Binary
search – Multiplication of Large Integers – Strassen’s Matrix Multiplication-Closest-Pair and Convex-Hull
Problems.
Objective:
To make the students understand how computing problems are solved using brute force and divide and conquer
methods.
Session
No *
Topics to be covered
Ref
1-ch3.1;pg 97-101
Teaching
Aids
10
Brute Force- selection,bubble sort,
11
Brute Force -sequential search,brute force string manipulation
1-ch3.2;pg104-106
PPT
12
Closest-Pair and Convex-Hull Problems,state space search
1-ch3.3;pg108-113
PPT
13
Traveling Salesman Problem - Knapsack Problem
1-ch3.4;pg115-119
3(401-405)
PPT
14
Assignment problem
1-ch3.4;pg119-121
4-ch15.6;pg498-501
PPT
15
Divide and conquer methodology master theorem
Tower of Hanoi,fractals
1-ch4;pg169-172
2-ch4.5;pg93-97
PPT
1-ch 4.1;pg172-181
2-ch 7.1;pg170-182
4-ch4.9;pg120-129
PPT
Merge sort,Quick sort
16
17
Binary search-Binary tree traversal and properties.
18
Multiplication of Large Integers – Strassen’s Matrix Multiplication
19
Closest-Pair and Convex-Hull Problems.
By divide and conquer rule
1-ch4.3;pg181-185
4(132-139)
1-ch 4.5;pg186-191
2-ch 4.2;pg75-82
4-ch4.10;pg135-137
1-ch4.6;pg192-197
Continuous Assessment Test-I
Content beyond syllabus covered (if any): State-space search,Tower of Hanoi,fractals

Session duration: 50 mins
PPT
PPT
PPT
PPT
FT/GN/68/01/23.01.16
SRI VENKATESWARA COLLEGE OF ENGINEERING
COURSE DELIVERY PLAN - THEORY
Page 3 of 6
Sub. Code / Sub. Name: CS6402 DESIGN AND ANALYSIS OF ALGORITHM
Unit : III
Unit Syllabus :DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE
Computing a Binomial Coefficient – Warshall’s and Floyd’ algorithm – Optimal Binary Search Trees –
Knapsack Problem and Memory functions. Greedy Technique– Prim’s algorithm- Kruskal's AlgorithmDijkstra's Algorithm-Huffman Trees.
Objective: To know about problems solved using dynamic programming and greedy techniques.
Session
No *
Topics to be covered
Ref
Teaching
Aids
20
Dynamic programming-three basic examples –coin row
problem,Change-making problem
1-ch8;pg 283-287
PPT
21
Coin-collecting problem,Longest common subsequence
Computing binomial coefficient
1-ch8.1;pg287-290
Internet
PPT
22
Warshall’s algorithm
1-ch8.2;pg 217-225
PPT
23
Floyd’ algorithm
1-ch8.2;pg 226-237
4-ch6.3;pg210-212
PPT
24
Optimal Binary Search Trees
1-ch8.3;pg 241-255
2-ch 15.5;pg397-403
PPT
25
Knapsack Problem and Memory functions.
26
Greedy Technique– Activity-Selection Problem
Prim’s algorithm
27
Kruskal's Algorithm
1-ch9.2;pg325-331
2-ch23.2;pg 631-633
PPT
28
Dijkstra's Algorithm
1-ch9.3;pg333-337
2-ch17.4;pg658-662
PPT
29
Huffman Trees.
1-ch9.4;pg338-343
PPT
1-ch8.4;pg249-257
2-ch16.3;pg425-427
4-ch13.10;pg427-431
1-ch9.1;pg315-322
2-ch17.4;pg634-636
Internet
Content beyond syllabus covered (if any):Longest common subsequence ,Activity-Selection Problem
* Session duration: 50 mins
PPT
PPT
FT/GN/68/01/23.01.16
SRI VENKATESWARA COLLEGE OF ENGINEERING
COURSE DELIVERY PLAN - THEORY
Page 4 of 6
Sub. Code / Sub. Name: CS6402 DESIGN AND ANALYSIS OF ALGORITHM
Unit : IV
Unit Syllabus :ITERATIVE IMPROVEMENT
The Simplex Method-The Maximum-Flow Problem – Maximum Matching in Bipartite Graphs- The Stable
marriage Problem.
Objective: To make the students learn about iterative improvement method for problem solving
Session
No *
Topics to be covered
30
Geometric interpretation of linear programming,The Simplex
Method
1-ch 10.1;pg 345-351
2-ch 29.1;pg846-850
BB/PPT
31
Outline of simplex method
1-ch 10.1;pg351-359
2-ch 29.3;pg864-878
BB/PPT
32
The Maximum-Flow Problem
1-ch 10.2;pg361-369
2-ch 26.1;pg708-714
PPT
33
Max flow-min cut Theorem
1-ch 10.2;pg369-371
4-ch7.5;pg258-262
PPT
34
Maximum Matching in Bipartite Graphs
35
Maximum Matching in Bipartite Graphs- theorem and proof
36
The Stable marriage Problem. Root Finding algorithm
Continuous Assessment Test-II
Content beyond syllabus covered (if any):Root Finding algorithm

Session duration: 50 mins
Ref
1-ch 10.3;pg372-375
2-ch 26.3;pg732-735
1-ch 10.3;pg375-378
4-ch 6.5;pg217-222
1-ch 10.4;pg380-381
Internet
Teaching
Aids
PPT
PPT
PPT
FT/GN/68/01/23.01.16
SRI VENKATESWARA COLLEGE OF ENGINEERING
COURSE DELIVERY PLAN - THEORY
Page 5 of 6
Sub. Code / Sub. Name: CS6402 DESIGN AND ANALYSIS OF ALGORITHM
Unit : V
Unit Syllabus : COPING WITH THE LIMITATIONS OF ALGORITHM POWER
Limitations of Algorithm Power-Lower-Bound Arguments-Decision Trees-P, NP and NP-Complete Problems-Coping with the Limitations - Backtracking – n-Queens problem – Hamiltonian Circuit Problem – Subset Sum
Problem-Branch and Bound – Assignment problem – Knapsack Problem – Traveling Salesman ProblemApproximation Algorithms for NP – Hard Problems – Traveling Salesman problem – Knapsack problem.
Objective:
To make students understand the limitations of algorithms and learn about backtracking
.branch and bound techniques.
Session
No *
Topics to be covered
Ref
Teaching
Aids
39
Limitations of Algorithm Power- Lower-Bound ArgumentsMethods for establishing lower bounds
Decision Trees- Decision Trees for sorting and
searching in sorted arrays.
40
P, NP and NP-Complete Problems
1-ch11.3;pg401-409
41
Coping with the Limitations of algorithm power-backtrackingVerbal arithmetic
1-ch12;pg423-425
4-ch7.1;pg231-238
Internet
42
n-Queens problem – Hamiltonian Circuit ProblemSubset sum problem
1-ch12.1;pg426-430
PPT
43
Branch and Bound – Assignment problem,Cutting stock problem
1-ch12.2;pg432-436
Internet
PPT
Knapsack Problem – Traveling Salesman Problem
1-ch12.2;pg436-440
4-ch13.10;pg427-430
4-ch16.4;pg533-537
PPT
Approximation Algorithms for NP – Hard Problems – Traveling
Salesman problem – Knapsack problem.
1-ch12.3;pg778-788
2-ch34.1;pg1048-1053
PPT
38
44
45
1-ch11.1;pg 387-392
PPT
1-ch11.2;pg 394-397
PPT
PPT
Continuous Assessment Test-III
Content beyond syllabus covered (if any):Verbal arithmetic ,Cutting stock problem
* Session duration: 50 mins
PPT
FT/GN/68/01/23.01.16
SRI VENKATESWARA COLLEGE OF ENGINEERING
COURSE DELIVERY PLAN - THEORY
Page 6 of 6
Sub Code / Sub Name: CS6402 Design and Analysis of Algorithms
Course Outcome 1: To identify the types of problem, formulate , analyze and compare the efficiency of
algorithms.
Course Outcome 2: To identify and formulate brute force, divide and conquer solutions to a problem.
Course Outcome 3: To design solutions for problems based on dynamic programming and greedy approach.
Course outcome 4: To construct solution to problems based on iterative improvement method.
Course Outcome 5: To categorize the problem as P,NP and NP complete problems , assess the complexity and
design solutions using backtracking or branch and bound approach.
TEXT BOOK:
1. Anany Levitin, “Introduction to the Design and Analysis of Algorithms”, Third Edition, Pearson
Education, 2012.
REFERENCES:
1. Thomas H.Cormen, Charles E.Leiserson, Ronald L. Rivest and Clifford Stein, “Introduction to
Algorithms”, Third Edition, PHI Learning Private Limited, 2012.
2. Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman, “Data Structures and Algorithms”, Pearson
Education, Reprint 2006.
3. Donald E. Knuth, “The Art of Computer Programming”, Volumes 1& 3 Pearson Education, 2009.
Steven S. Skiena, “The Algorithm Design Manual”, Second Edition, Springer, 2008. 4.
http://nptel.ac.in/
Prepared by
Approved by
Ms..N.Rajeswari
Dr.C.Jayakumar
Assistant Professor
Professor and HOD/CS
02/01/2017
02/01/2017
Signature
Name
Designation
Date
Remarks *:
Same Lesson plan is followed for the even semester, 2016-2017.
Remarks *: