LESSON PLAN
Course
Code & Name : CS9212 / Data Structures and Algorithm
Faculty
/ Designation : Mr. S. P.
Santhoshkumar / Assistant Professor
Class
& Semester : IST
Year M.E (CSE) – IST Semester
|
S.No.
|
PROPOSED
|
TOPIC
|
|
|
DATE
|
PERIOD
|
||
|
1.
|
11.09.2012
|
1
|
UNIT
– I: COMPLEXITY ANALYSIS & ELEMENTARY DATA STRUCTURES
|
|
2.
|
12.09.2012
|
4
|
Asymptotic notations
|
|
3.
|
14.09.2012
|
5
|
Properties of
big oh notation
|
|
4.
|
15.09.2012
|
6
|
asymptotic notation
with several parameters
|
|
5.
|
17.09.2012
|
6
|
conditional asymptotic notation
|
|
6.
|
18.09.2012
|
1
|
amortized analysis
|
|
7.
|
21.09.2012
|
5
|
NP-completeness
|
|
8.
|
22.09.2012
|
6
|
NP- hard
|
|
9.
|
|
|
recurrence equations
|
|
10.
|
25.09.2012
|
1
|
solving recurrence
equations
|
|
11.
|
26.09.2012
|
4
|
arrays
|
|
12.
|
28.09.2012
|
5
|
linked lists
|
|
13.
|
29.09.2012
|
6
|
trees
|
|
14.
|
01.102012
|
6
|
Review - 1
|
|
15.
|
03.10.2012
|
4
|
Seminar -1
|
|
16.
|
05.10.2012
|
5
|
Seminar - 2
|
|
17.
|
06.10.2012
|
6
|
UNIT - II: HEAP STRUCTURES
|
|
18.
|
08.10.2012
|
6
|
Min-max heaps
|
|
19.
|
09.10.2012
|
1
|
Deaps
|
|
CYCLE TEST – I (10.10.2012 – 12.10.2012)
|
|||
|
20.
|
15.10.2012
|
6
|
Leftist heaps
|
|
21.
|
16.10.2012
|
1
|
Binomial heaps
|
|
22.
|
17.10.2012
|
4
|
Fibonacci heaps
|
|
23.
|
19.10.2012
|
5
|
Skew heaps - Lazy
|
|
24.
|
20.10.2012
|
6
|
binomial heaps
|
|
25.
|
30.10.2012
|
1
|
Review
- 2
|
|
26.
|
31.10.2012
|
4
|
Seminar
-3
|
|
27.
|
02.11.2012
|
5
|
UNIT
III SEARCH STRUCTURES
|
|
28.
|
03.11.2012
|
6
|
Binary search trees
|
|
29.
|
05.11.2012
|
6
|
AVL trees
|
|
30.
|
06.11.2012
|
1
|
2-3 trees
|
|
31.
|
07.11.2012
|
4
|
2-3-4 trees
|
|
32.
|
09.11.2012
|
5
|
Red-black trees
|
|
33.
|
11.11.2012
|
6
|
B-trees
|
|
34.
|
12.11.2012
|
1
|
splay trees
|
|
35.
|
13.11.2012
|
4
|
Tries
|
|
36.
|
15.11.2012
|
5
|
Review
- 3
|
|
37.
|
16.11.2012
|
6
|
Seminar
-4
|
|
38.
|
18.11.2012
|
6
|
UNIT
IV GREEDY & DIVIDE AND CONQUER
|
|
CYCLE TEST - II (19.11.2012 –
21.11.2012)
|
|||
|
39.
|
23.11.2012
|
5
|
Quicksort
|
|
40.
|
24.11.2012
|
6
|
Strassen’s matrix
multiplication
|
|
41.
|
26.11.2012
|
6
|
Convex hull
|
|
42.
|
27.11.2012
|
1
|
Tree-vertex splitting
|
|
43.
|
28.11.2012
|
4
|
Review - 4
|
|
44.
|
30.11.2012
|
5
|
Seminar -5
|
|
45.
|
01.12.2012
|
6
|
UNIT – V: DYNAMIC
PROGRAMMING AND BACKTRACKING
|
|
46.
|
04.12.2012
|
1
|
Multistage graphs
|
|
47.
|
05.12.2012
|
4
|
0/1 knapsack using
dynamic programming
|
|
48.
|
07.12.2012
|
5
|
Flow shop scheduling
|
|
49.
|
08.12.2012
|
6
|
8- queens problem
|
|
50.
|
10.12.2012
|
6
|
graph coloring
|
|
51.
|
11.12.2012
|
1
|
knapsack using backtracking
|
|
52.
|
12.12.2012
|
4
|
Review - 5
|
|
53.
|
14.12.2012
|
5
|
Seminar -6
|
|
54.
|
15.12.2012
|
6
|
Seminar -7
|
|
CYCLE TEST – III (17.12.2012 – 19.12.2012)
|
|||
|
Faculty
in- charge
|
HOD / CSE
|
PRINCIPAL
|
|
Mr.
S. P. Santhoshkumar.
|
|
|
No comments:
Post a Comment