Scribd
Upload
102 views

Data Structures

This lesson plan document provides an overview of the topics and schedule to be covered in a Data Structures course. The course is divided into 5 units covering linear structures, tree structures, balanced trees, hashing and sets, and graphs. Each unit spans multiple sessions with topics like lists, stacks, queues, trees, binary search trees, AVL trees, hashing, and graphs to be discussed. The document outlines the topics, time allocation, teaching methods and reference books for each of the 50 sessions over 13 weeks.

Uploaded by

Mohammed Jeelan
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
102 views

Data Structures

This lesson plan document provides an overview of the topics and schedule to be covered in a Data Structures course. The course is divided into 5 units covering linear structures, tree structures, balanced trees, hashing and sets, and graphs. Each unit spans multiple sessions with topics like lists, stacks, queues, trees, binary search trees, AVL trees, hashing, and graphs to be discussed. The document outlines the topics, time allocation, teaching methods and reference books for each of the 50 sessions over 13 weeks.

Uploaded by

Mohammed Jeelan
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 6

DOC/LP/01/28.02.

02

LP CS2201
LESSON PLAN

LP Rev. No : 00
Date : 21- 5-2009

Sub Code & Sub Name : CS2201 DATA STRUCTURES


Unit : I

Branch : CSE

Page 01 of 06

Semester :III

Unit Syllabus:
LINEAR STRUCTURES:

Abstract Data Types (ADT) List ADT array-based implementation linked list
implementation cursor-based linked lists doubly-linked lists applications of lists
Stack ADT Queue ADT circular queue implementation Applications of stacks and
queues
Objective:
To learn the linear structures such as List, Stack, Queue ADT and its applications.
Session
No

Topics to be covered

Abstract Data Types-Introduction


The List ADT (Array implementation)
The List ADT (Linked Lists implementation)
The List ADT (Linked Lists implementation)
The List ADT (Doubly Linked Lists)
The List ADT (Cursor implementation)
The List ADT (Applications)
The Stack ADT-Introduction
The Stack ADT (Linked list implementation)
The Stack ADT (Array implementation)
The Stack ADT (Applications)
The Queue ADT-Introduction
The Queue ADT ( Circular Queue)
The Queue ADT (Applications)

2
3
4
5
6
7
8
9
10

Time
Allocation
(min)
15
15
20
50
50
50
50
10
40
50
50
10
40
50

Books
Referred
1

Teaching
Method
BB

1
1
1
1
1,2

BB
BB
BB
BB
OHP

1
1
1,3

BB
BB
BB

OHP

DOC/LP/01/28.02.02

LP CS2201
LESSON PLAN

LP Rev. No : 00
Date : 21- 5-2009

Sub Code & Sub Name : CS2201 DATA STRUCTURES


Unit : II

Branch : CSE

Page 01 of 06

Semester :III

Unit Syllabus:
TREE STRUCTURES:

Tree ADT tree traversals left child right sibling data structures for general trees
Binary Tree ADT expression trees applications of trees binary search tree ADT
Threaded Binary Trees.
Objective:
To understand the Tree, Binary Tree, Binary Search Tree ADTs.
Session
No
11
12
13
14
15
16
17
18
19
20

Topics to be covered
Tree ADT
Tree Traversal
Left child right sibling data structures for
general trees
Binary Tree ADT
Binary Tree ADT
Expression trees
Applications of trees
Binary search tree ADT
Binary search tree ADT
Threaded Binary Trees
Threaded Binary Trees
CAT-I

Time
Allocation
(min)
10
40
50

Books
Referred

2,3

BB

50
50
50
50
50
50
50
50

1
1
1
2,3
1
1
2,3
2,3

BB
BB
OHP
BB
BB
BB
BB
OHP

Teaching
Method
BB

DOC/LP/01/28.02.02

LP CS2201
LESSON PLAN

LP Rev. No : 00

Sub Code & Sub Name : CS2201 DATA STRUCTURES


Unit : III

Branch : CSE

Semester :III

Date : 21- 5-2009


Page 01 of 06

Unit Syllabus:
BALANCED TREES:

AVL Trees Splay Trees B-Tree - heaps binary heaps applications of binary heaps
Objective:
To learn about AVL, Splay, B-Tree, Heaps
Session
No
21
22
23
24
25
26
27
28
29
30

Topics to be covered
AVL Trees-Introduction, single and double
rotation
AVL Trees-Implementation
Splay Trees
Splay Trees
B-Trees
B-Trees
Heaps
Binary Heaps
Binary Heaps
Applications of Binary Heaps

Time
Allocation
(Min)
50

Books
Referred

Teaching
Method

BB

50
50
50
50
50
50
50
50
50

1
1,2
1,2
1
1
1
1
1
1,3

BB
OHP
OHP
BB
BB
BB
BB
BB
BB

DOC/LP/01/28.02.02

LP CS2201
LESSON PLAN

LP Rev. No : 00

Sub Code & Sub Name : CS2201 DATA STRUCTURES


Unit : IV

Branch : CSE

Semester :III

Date : 21- 5-2009


Page 01 of 06

Unit Syllabus:
HASHING AND SET:

Hashing Separate chaining open addressing rehashing extendible hashing Disjoint Set ADT dynamic equivalence problem smart union algorithms path
compression applications of Set
Objective:
To study about hashing techniques and about set.
Session
No
31
32
33
34
35
36
37
38
39
40

Topics to be covered
Hashing
Separate Chaining
Open Addressing
Rehashing
Extendible hashing
Disjoint Set ADT
Dynamic equivalence problem
Smart union algorithms
Path compression
Applications of Set
CAT-II

Time
Allocation
(Min)
50
50
50
50
50
50
50
50
50
50

Books
Referred

Teaching
Method

1
1,2
1
1
1
1,3
1
1
1
1

BB
BB
OHP
BB
BB
BB
OHP
OHP
BB
BB

DOC/LP/01/28.02.02

LP CS2201
LESSON PLAN

LP Rev. No : 00

Sub Code & Sub Name : CS2201 DATA STRUCTURES


Unit : V

Branch : CSE

Semester :III

Date : 21- 5-2009


Page 01 of 06

Unit Syllabus:
GRAPHS:

Definitions Topological sort breadth-first traversal - shortest-path algorithms


minimum spanning tree Prim's and Kruskal's algorithms Depth-first traversal
biconnectivity Euler circuits applications of graphs
Objective:
To learn about the graph data structure, shortest path algorithms and its traversals
Session
No

Topics to be covered

41

Definitions
Topological sort
Breadth-first traversal
Shortest path algorithms-Unweighted shortest
paths
Shortest path algorithms-Dijkstras algorithm
Minimum spanning tree-Prims algorithm
Minimum spanning tree-Prims algorithm
Minimum spanning tree- Kruskal's algorithm
Applications of Depth first search-Introduction
Applications of Depth first search-Undirected
graphs
Biconnectivity, Euler Circuits
Applications of graphs
CAT-III

42
43
44
45
46
47
48
49
50

Time
Allocation
(min)
10
40
50
50

Books
Referred

Teaching
Method

BB

1
1

BB
BB

50
50
50
50
50

1
1
1
1
1

BB
OHP
OHP
BB
BB

50
50

1
1

BB
BB

DOC/LP/01/28.02.02

LP CS2201
LESSON PLAN

LP Rev. No : 00

Sub Code & Sub Name : CS2201 DATA STRUCTURES


Branch : CSE

Semester :III

Date : 21- 5-2009


Page 01 of 06

Course Delivery Plan:


Week

10

11

12

13

I II I II I II I II I II I II I II I II I II I II I II

I II

I II

Units

TEXT BOOK
1.

M. A. Weiss, Data Structures and Algorithm Analysis in C, Second Edition ,


Pearson Education, 2005.
REFERENCES

2.
3.

A. V. Aho, J. E. Hopcroft, and J. D. Ullman, Data Structures and Algorithms,


Pearson Education, First Edition Reprint 2003.
R. F. Gilberg, B. A. Forouzan, Data Structures, Second Edition, Thomson India
Edition, 2005.
Prepared by

Approved by

Signature
Name

Ms. R. Vanaja
Ms. S. Rajalakshmi

Dr.Susan Elias

Designation
Date

Lecturer, CSE
21-05-2009

HOD, Department of CSE


29-06-2009

You might also like