LECTURE PLAN
Course Code & Name
: EE2204 Data Structures and Algorithms
Faculty :
Class & Semester
: II Year B.E (EEE)
– III Semester
|
Sl. No.
|
PROPOSED
|
TOPIC
|
||
|
DATE
|
PERIOD |
|||
|
1.
|
02.7.12
|
7
|
MODULE I Abstract
data types(ADT)
|
|
|
2.
|
03.7.12
|
4
|
List ADT, Array based implementation
|
|
|
3.
|
03.7.12
|
4
|
Linked list implementation
|
|
|
4.
|
05.7.12
|
1
|
Cursor based linked lists
|
|
|
5.
|
09.7.12
|
7
|
Doubly linked lists
|
|
|
6.
|
10.7.12
|
4
|
Application of lists
|
|
|
7.
|
10.7.12
|
7
|
Stack ADT ,Queue ADT
|
|
|
8.
|
12.7.12
|
1
|
Circular Queue Implementation
|
|
|
9.
|
14.7.12
|
2
|
Circular Queue Implementation
|
|
|
10.
|
16.7.12
|
7
|
Applications of stack and queue
|
|
|
11.
|
17.7.12
|
4
|
Review I
|
|
|
12.
|
17.7.12
|
7
|
MODULE -II Need for non-linear structure
|
|
|
CYCLE TEST I (19.7.12-21.7.12)
|
||||
|
13.
|
23.7.12
|
7
|
Tree ADT
|
|
|
14.
|
24.7.12
|
4
|
Tree ADT
|
|
|
15.
|
24.7.12
|
7
|
Tree Traversal
|
|
|
16.
|
26.7.12
|
1
|
Left child right sibling data structures for general trees
|
|
|
17.
|
28.7.12
|
2
|
Binary tree ADT
|
|
|
18.
|
30.7.12
|
7
|
Binary tree ADT
|
|
|
19.
|
31.7.12
|
4
|
Expression trees
|
|
|
20.
|
31.7.12
|
7
|
Applications of trees
|
|
|
21.
|
02.8.12
|
1
|
Binary search tree ADT
|
|
|
22.
|
04.8.12
|
2
|
Review II
|
|
|
23.
|
06.8.12
|
7
|
MODULE –III AVL Trees
|
|
|
24.
|
07.8.12
|
4
|
AVL Trees
|
|
|
25.
|
07.8.12
|
7
|
Binary heaps
|
|
|
26.
|
13.8.12
|
7
|
Binary heaps
|
|
|
27.
|
14.8.12
|
4
|
B-Tree
|
|
|
28.
|
14.8.12
|
7
|
Hashing
|
|
|
29.
|
16.8.12
|
1
|
Separate chaining
|
|
|
30.
|
18.8.12
|
2
|
Open Addressing
|
|
|
31.
|
20.8.12
|
7
|
Open Addressing
|
|
|
32.
|
21.8.12
|
4
|
Linear Probing
|
|
|
33.
|
21.8.12
|
7
|
Linear Probing
|
|
|
CYCLE TEST II (23.8.12-25.8.12)
|
||||
|
34.
|
27.8.12
|
7
|
Review - III
|
|
|
35.
|
28.8.12
|
4
|
MODULE –IV Definitions
|
|
|
36.
|
28.8.12
|
7
|
Topological sort
|
|
|
37.
|
30.8.12
|
1
|
Breadth –first traversal
|
|
|
38.
|
01.9.12
|
2
|
Shortest path algorithms
|
|
|
39.
|
03.9.12
|
7
|
Minimum spanning tree
|
|
|
40.
|
04.9.12
|
4
|
Prim’s and Kruskal’s algorithms
Decision making
|
|
|
41.
|
04.9.12
|
7
|
Prim’s and Kruskal’s algorithms
Decision making
|
|
|
42.
|
06.9.12
|
1
|
biconnectivity
|
|
|
43.
|
10.9.12
|
7
|
Euler’s circuits
|
|
|
44.
|
11.9.12
|
4
|
Applications of graphs
|
|
|
45.
|
11.9.12
|
7
|
MODULE –V Greedy algorithms
|
|
|
46.
|
13.9.12
|
1
|
Dynamic programming
|
|
|
47.
|
15.9.12
|
2
|
Backtracking
|
|
|
48.
|
17.9.12
|
7
|
Branch and bound
|
|
|
49.
|
18.9.12
|
4
|
Randomized algorithms
|
|
|
50.
|
18.9.12
|
7
|
Algorithm analysis
|
|
|
51.
|
20.9.12
|
1
|
Asymptotic notations
|
|
|
52.
|
22.9.12
|
2
|
recurrences
|
|
|
53.
|
24.9.12
|
7
|
NP-complete problems
|
|
|
54.
|
25.9.12
|
4
|
Review V
|
|
|
CYCLE TEST III (10.10.12-12.10.12)
|
||||
Faculty in- charge HOD/CSE
PRINCIPAL
No comments:
Post a Comment