INSTITUTE OF TECHNOLOGY AND MARINE ENGINEERING

LESSON PLAN
SEMESTER: V
SUBJECT: Design & Analysis of Algorithm
PAPER CODE : CS 503
SL MODULE TOTAL TO BE
NO LECTURE COVERED IN
HRS WEEK NO
1 Models of computation: RAM,TM.Time and Space complexity. 1st Week of
4L August
nd
2 Asymptotic Notation : Big-O, omega, theta etc.; Time complexity of 2 Week of
well known algorithms ( heap sort, search) 3L August
3 Algorithm Design technique: Recursion- Definition, Use, 3rd Week of
Limitations, Hanoi problem. Tail Recursion 2L August
th
4 Divide and Conquer :Basic method, use, Examples: Merge sort, 4 Week of
Quick Sort, Binary Search 3L August
5 Dynamic Programming: Basic method, use, Examples: matrix-chain 1st Week of
multiplication, All pair shortest paths, single-source shortest path, 4L September
Traveling Salesman problem.
6 Branch and Bound :Basic method, use, Examples: The 15-puzzle 2nd Week of
problem 2L September,
7 Backtracking :Basic method, use, Examples: Eight queens 2nd Week of
problem, Graph coloring problem, Hamiltonian problem 3L September
8 Greedy Method: Basic method, use, Examples: Knapsack problem, 4L
1st Week of
Job sequencing with deadlines, minimum spanning tree(Prim's and
October
Kruskal's algorithms
9 Lower Bound Theory : Bounds on sorting and sorting techniques 2L 2nd Week of
using partial and total orders. October
10 Disjoint Set Manipulation: 2L
2nd Week of
Set manipulation algorithm like UNION-FIND, union by rank, Path
October
compression
11 Properties of graphs and graph traversal algorithms : BFS and DFS 3L 3rd Week of
October
12 Matrix manipulation algorithms : Different types of algorithms and 5L
4th Week of
solution of simultaneous equations, DFT & FFT algorithm; integer
October
multiplication schemes
13 Notion of NP-completeness : 5L
1st Week of
P class, NP-hard class, NP-complete class, Circuit Satisfiability
November
problem, Clique Decision Problem.
14 Approximation algorithms : Necessity of approximation scheme, 3L
2nd Week of
performance guarantee, Polynomial time approximation schemes: 0/1
November
knapsack problem

FACULTY NAME: Kh. Jinnatul Islam SIGNATURE/DATE ____________________

HOD DEPT: Prof. Pinak Pani Chakraborty SIGNATURE/DATE____________________

FORM NO: FRM16 QSP : QSP/08 REVISION NO: 00 PAGE :1 OF 1