LECTURE PLAN
Course Code & Name
: CS 2201 Data Structures
Faculty :
Class & Semester
: II Year B.E (CSE)
– III Semester
Sl. No.
|
PROPOSED
|
TOPIC
|
|||
DATE
|
PERIOD |
||||
1.
|
02.7.12
|
6
|
MODULE I Abstract
data types(ADT)
|
||
2.
|
05.7.12
|
6
|
List ADT, Array based implementation
|
||
3.
|
05.7.12
|
7
|
Linked list implementation
|
||
4.
|
06.7.12
|
5
|
Cursor based linked lists
|
||
5.
|
14.7.12
|
7
|
Doubly linked lists
|
||
6.
|
14.7.12
|
8
|
Application of lists
|
||
7.
|
17.7.12
|
1
|
Stack ADT ,Queue ADT
|
||
8.
|
18.7.12
|
4
|
Circular Queue Implementation
|
||
9.
|
18.7.12
|
7
|
Circular Queue Implementation
|
||
10.
|
18.7.12
|
8
|
Applications of stack and queue
|
||
CYCLE TEST I (19.7.12-21.7.12)
|
|||||
11.
|
23.7.12
|
6
|
Review I
|
||
12.
|
24.7.12
|
1
|
MODULE -II TREE
STRUCTURES
|
||
13.
|
25.7.12
|
1
|
Tree ADT
|
||
14.
|
25.7.12
|
8
|
Tree ADT
|
||
15.
|
26.7.12
|
2
|
Tree Traversal
|
||
16.
|
30.7.12
|
6
|
Left child right sibling data structures for general trees
|
||
17.
|
31.7.12
|
2
|
Binary tree ADT
|
||
18.
|
01.8.12
|
1
|
Binary tree ADT
|
||
19.
|
01.8.12
|
8
|
Expression trees
|
||
20.
|
02.8.12
|
2
|
Applications of trees
|
||
21.
|
06.8.12
|
6
|
Binary search tree ADT
|
||
22.
|
07.8.12
|
2
|
Threaded binary trees
|
||
23.
|
08.8.12
|
1
|
Review II
|
||
24.
|
08.8.12
|
8
|
MODULE –III AVL Trees
|
||
25.
|
13.8.12
|
6
|
AVL Trees
|
||
26.
|
14.8.12
|
2
|
Splay trees
|
||
27.
|
16.8.12
|
2
|
Splay trees
|
||
28.
|
20.8.12
|
6
|
B-Tree
|
||
29.
|
21.8.12
|
2
|
B-Tree
|
||
30.
|
22.8.12
|
1
|
heaps
|
||
31.
|
22.8.12
|
8
|
heaps
|
||
CYCLE TEST II (23.8.12-25.8.12)
|
|||||
32.
|
27.8.12
|
6
|
binary heaps
|
||
33.
|
28.7.12
|
2
|
Applications of binary
heaps
|
||
34.
|
29.8.12
|
1
|
Review-III
|
||
35.
|
29.8.12
|
8
|
MODULE III HASHING
AND SET
|
||
36.
|
30.8.12
|
2
|
Hashing
|
||
37.
|
03.9.12
|
6
|
Separate chaining
|
||
38.
|
04.9.12
|
2
|
open addressing
|
||
39.
|
05.9.12
|
1
|
rehashing
|
||
40.
|
05.9.12
|
8
|
extendible hashing, Disjoint Set ADT
|
||
41.
|
06.9.12
|
2
|
dynamic equivalence problem
|
||
42.
|
10.9.12
|
6
|
smart union
algorithms
|
||
43.
|
11.9.12
|
2
|
Path compression
|
||
44.
|
12.9.12
|
1
|
applications of Set
|
||
45.
|
12.9.12
|
8
|
Review-IV
|
||
46.
|
13.9.12
|
2
|
MODULE V GRAPHS
|
||
47.
|
17.9.12
|
6
|
Definitions – Topological sort
|
||
48.
|
18.9.12
|
2
|
breadth-first traversal -,shortest-path algorithms
|
||
49.
|
20.9.12
|
2
|
minimum spanning tree
|
||
50.
|
24.9.12
|
6
|
Prim's and Kruskal's algorithms
|
||
51.
|
25.9.12
|
2
|
Depth-first traversal
|
||
52.
|
26.9.12
|
1
|
biconnectivity
|
||
53.
|
26.9.12
|
8
|
Euler circuits
|
||
54.
|
27.9.12
|
2
|
applications of graphs
|
||
55.
|
01.10.12
|
6
|
Review-V
|
||
CYCLE TEST III (10.10.12-12.10.12)
|
|||||
Faculty in- charge HOD/CSE
PRINCIPAL
No comments:
Post a Comment