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 Teaching
Topics to be covered Ref
No * Aids
1-ch1.1;pg 1-7
1 Introduction, Algorithm, Notion of algorithm PPT
2-ch 1.1;pg5-11
Fundamentals of Algorithmic Problem Solving-steps in designing and 1-ch1.2;pg9-16
2 PPT
analyzing an algorithm 2-ch 2.3;pg30-39

Important Problem Types- Sorting.searching, string processing,

3 1-ch1.3;pg18-23 PPT
graph, geometric, numeric and combinatorial problems

Fundamentals of the Analysis of Algorithm Efficiency, Analysis

1-ch2.1;pg41-45
4 Framework, measuring input size, units for measuring PPT
running time,

Analysis Framework, Orders of growth, worst, best and average case 1-ch2.1;pg45-50
5 PPT
analysis, recapitulation of Analysis Framework. 2-ch2.2;pg23-29

Asymptotic Notations and its properties- Informal, Big-oh, Big- 1-ch2.2;pg52-58

6 2-ch3.1;pg43-53 PPT
omega, Big-theta notation
4-ch 2.1;pg31-57
7 Mathematical analysis for Non-recursive algorithms –General plan 1-ch2.3;pg61-67
PPT
for analyzing time efficiency
Mathematical analysis for Recursive algorithms –General plan for 1-ch2.4;pg70-76
8 PPT
analyzing time efficiency 2-ch4.1pg65-74
1-ch1.4;pg8,16-18
9 Fundamental Data structures,Sample problems PPT

Content beyond syllabus covered (if any): Fundamental Data structures

* Session duration: 50 minutes

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 Teaching
Topics to be covered Ref
No * Aids
1-ch3.1;pg 97-101
10 Brute Force- selection,bubble sort, PPT

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

1-ch3.4;pg115-119
13 Traveling Salesman Problem - Knapsack Problem PPT
3(401-405)

1-ch3.4;pg119-121
14 Assignment problem PPT
4-ch15.6;pg498-501

Divide and conquer methodology master theorem 1-ch4;pg169-172

15 PPT
Tower of Hanoi,fractals 2-ch4.5;pg93-97
1-ch 4.1;pg172-181
Merge sort,Quick sort
16 2-ch 7.1;pg170-182 PPT
4-ch4.9;pg120-129
1-ch4.3;pg181-185
17 Binary search-Binary tree traversal and properties. PPT
4(132-139)
1-ch 4.5;pg186-191
18 Multiplication of Large Integers – Strassen’s Matrix Multiplication 2-ch 4.2;pg75-82 PPT
4-ch4.10;pg135-137
Closest-Pair and Convex-Hull Problems.
19 1-ch4.6;pg192-197 PPT
By divide and conquer rule

Continuous Assessment Test-I

Content beyond syllabus covered (if any): State-space search,Tower of Hanoi,fractals

 Session duration: 50 mins

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 Algorithm-
Dijkstra's Algorithm-Huffman Trees.

Objective: To know about problems solved using dynamic programming and greedy techniques.

Session Teaching
Topics to be covered Ref
No * Aids
Dynamic programming-three basic examples –coin row
20 1-ch8;pg 283-287 PPT
problem,Change-making problem
Coin-collecting problem,Longest common subsequence 1-ch8.1;pg287-290
21 PPT
Computing binomial coefficient Internet

22 Warshall’s algorithm 1-ch8.2;pg 217-225 PPT

1-ch8.2;pg 226-237
23 Floyd’ algorithm PPT
4-ch6.3;pg210-212
1-ch8.3;pg 241-255
24 Optimal Binary Search Trees PPT
2-ch 15.5;pg397-403
1-ch8.4;pg249-257
25 Knapsack Problem and Memory functions. 2-ch16.3;pg425-427 PPT
4-ch13.10;pg427-431
1-ch9.1;pg315-322
Greedy Technique– Activity-Selection Problem
26 2-ch17.4;pg634-636 PPT
Prim’s algorithm
Internet
1-ch9.2;pg325-331
27 Kruskal's Algorithm PPT
2-ch23.2;pg 631-633
1-ch9.3;pg333-337
28 Dijkstra's Algorithm PPT
2-ch17.4;pg658-662
 29 Huffman Trees. 1-ch9.4;pg338-343 PPT

Content beyond syllabus covered (if any):Longest common subsequence ,Activity-Selection Problem

* Session duration: 50 mins

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 Teaching
Topics to be covered Ref
No * Aids

Geometric interpretation of linear programming,The Simplex 1-ch 10.1;pg 345-351

30 BB/PPT
Method 2-ch 29.1;pg846-850

1-ch 10.1;pg351-359
31 Outline of simplex method BB/PPT
2-ch 29.3;pg864-878
1-ch 10.2;pg361-369
32 The Maximum-Flow Problem PPT
2-ch 26.1;pg708-714
1-ch 10.2;pg369-371
33 Max flow-min cut Theorem PPT
4-ch7.5;pg258-262
1-ch 10.3;pg372-375
34 Maximum Matching in Bipartite Graphs PPT
2-ch 26.3;pg732-735
1-ch 10.3;pg375-378
35 Maximum Matching in Bipartite Graphs- theorem and proof 4-ch 6.5;pg217-222 PPT

1-ch 10.4;pg380-381
36 The Stable marriage Problem. Root Finding algorithm PPT
Internet

Continuous Assessment Test-II

Content beyond syllabus covered (if any):Root Finding algorithm

 Session duration: 50 mins

 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 Problem-
Approximation 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 Teaching
Topics to be covered Ref
No * Aids
Limitations of Algorithm Power- Lower-Bound Arguments-
38 1-ch11.1;pg 387-392 PPT
Methods for establishing lower bounds
Decision Trees- Decision Trees for sorting and
39 searching in sorted arrays. 1-ch11.2;pg 394-397 PPT

40 P, NP and NP-Complete Problems 1-ch11.3;pg401-409 PPT

1-ch12;pg423-425
Coping with the Limitations of algorithm power-backtracking-
4-ch7.1;pg231-238
41 Verbal arithmetic PPT
Internet

n-Queens problem – Hamiltonian Circuit Problem-

42 1-ch12.1;pg426-430 PPT
Subset sum problem
1-ch12.2;pg432-436
43 Branch and Bound – Assignment problem,Cutting stock problem PPT
Internet
1-ch12.2;pg436-440
Knapsack Problem – Traveling Salesman Problem
44 4-ch13.10;pg427-430 PPT
4-ch16.4;pg533-537

Approximation Algorithms for NP – Hard Problems – Traveling 1-ch12.3;pg778-788

45 PPT
Salesman problem – Knapsack problem. 2-ch34.1;pg1048-1053

Continuous Assessment Test-III

Content beyond syllabus covered (if any):Verbal arithmetic ,Cutting stock problem

* Session duration: 50 mins

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/