RAJALAKSHMI ENGINEERING COLLEGE

Thandalam, Chennai 602 105

LESSON PLAN

Faculty Name
Subject Name
Year
Degree & Branch

:
:
:
:

P.REVATHY
DATA STRUCTURES
II
B.E. CSE.

Code
Code
Semester
Section

:
:
:
:

CS11
CS 2201

III
B

Aim: To master the design and applications of linear, tree, balanced tree, hashing, set, and graph
structures.

TEXT BOOK
1. M. A. Weiss, Data Structures and Algorithm Analysis in C, Second Edition , Pearson
Education, 2005.
REFERENCES
1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms,
Pearson Education, First Edition Reprint 2003.
2. R. F. Gilberg, B. A. Forouzan, Data Structures, Second Edition, Thomson India
Edition, 2005.

Signature of Faculty

Signature of HOD
1

Sl.
NO

Date

Period

Unit

7/7/11

Bridge
Course

11/7/11
12/7/11

Pointers

14/7/11

Structures self referential structures

Topic(s)
Functions

UNIT I Linear Data Structures

Sl.
NO

Period

Unit

Topic(s)

T/R *
Boo
k

Book
No.

Page(s)

18/7/11

Abstract Data Types (ADT)

57

19/7/11

Stack ADT

78-94

21/7/11

Queue ADT

95

21/7/11

Circular queue implementation

95-99

10

25/7/11
26/7/11

Applications of stacks and queues

100

12

28/7/11

List ADT

58

13

28/7/11

Array-based implementation

59

14

1/8/11

Linked list implementation

59

15

2/8/11

Doubly-linked lists

67-68

16

4/8/11

Cursor-based linked lists

73-77

17

4/8/11

Applications of lists

68-73

Unit II - Tree Structures

18

8/8/11

II

Tree ADT

19

9/8/11

II

Left child right sibling data

structures for General trees

148

20

11/8/11

II

Binary Tree ADT

111

21

11/8/11
16/8/11

II

Binary search tree ADT

116-125

23

18/8/11

II

Tree traversals

148

24

18/8/11

II

Expression trees

113

25

22/8/11

II

Applications of trees

26

23/8/11

II

Threaded Binary Trees.

Sl.

Proposed

T/R *

Book

Period

Unit

Topic(s)

Signature of Faculty

Signature of HOD
2

Page(s)

NO

Date

Boo
k

No.

126-138

138-147

Unit III Balanced Trees

27

25/8/11

III

AVL Trees

29

29/8/11

III

Tutorial on AVL

30

30/8/11

III

Splay Trees

31

5/9/11

III

Tutorial on splay trees

32

6/9/11

III

B-Tree - heaps

149-154

33

8/9/11

III

Binary heaps

195-204

34

8/9/11

III

Applications of binary heaps

205-207

35

12/9/11

III

Tutorial on Binary Heaps

Unit IV Hashing and Set

36

13/9/11

IV

Hashing - Separate chaining

165-173

37

15/9/11

IV

Open addressing

173-180

38

15/9/11

IV

Rehashing

181-184

39

19/9/11

IV

Extendible hashing -

184-187

40

20/9/11

IV

Disjoint Set ADT

279

41

22/9/11

IV

Dynamic equivalence problem

280

42

22/9/11

IV

Smart union algorithms

285-287

43

26/9/11

IV

Path compression

287-289

44

27/9/11

IV

Applications of Set

295

Signature of Faculty

Signature of HOD
3

Sl.
NO

Proposed
Date

Perio
d

Unit

Topic(s)

T/R *

Boo
k

Boo
k

No.

Page(s)

Unit V - Graphs
45

29/9/11

Definitions

299-301

46

29/9/11

Topological sort

302-306

47

3/10/11

Breadth-first traversal - Shortestpath algorithms

306-324

48

4/10/11

Minimum Spanning Tree

329-335

49

10/10/11

Tutorial on Topological sort and

Minimum spanning tree

50

11/10/11

Prim's and Kruskal's algorithms

329-335

51

13/10/11

Tutorial on Prims and Kruskals

52

13/10/11

Depth-first traversal

335

53

17/10/11

Biconnectivity

338-342

54

18/10/11

Euler circuits

342-345

55

20/10/11

applications of graphs

417

* T Text Book / R Reference Book

Signature of Faculty

Signature of HOD
4