LESSON PLAN
ACADEMIC YEAR: STAFF NAME:
DEPARTMENT: CSE YEAR: II
2019 -2020
SUBJECT:DATA L T P C
SUB CODE: CS8391 CREDIT:
STRUCTURES 3 0 0 3
MODE OF
DELIVERY
CHA LINK
HOU PAG PO &
TOPIC BOOK LK FOR
R E NO. VIDE PP CO
& NOTES
O T
TAL
K
UNIT 1 LINEAR DATA STRUCTURES LIST
√ CO1,
Abstract Data [Link]
PO1,
1 Types(ADT)s – T1 57 √ [Link]/3h
PO2,
List ADT 0aVrM
PO3
√ √ [Link] CO1,
Array based
1 T1 59 [Link]/3h PO1,
Implementation
0aVrM PO2, PO3
√ √ [Link] CO1,
Linked List
1 T1 59 [Link]/3h PO1,
Implementation
0aVrM PO2, PO3
√ √ √ [Link] CO1,
1 Singly Linked List T2 62 [Link]/3h PO1,
0aVrM PO2, PO3
√ √ √ [Link] CO1,
Circularly Linked
1 T1 68 [Link]/3h PO1,
List
0aVrM PO2, PO3
Doubly Linked √ √ √ [Link] CO1,
1 Lists-Applications T1 67&68 [Link]/3h PO1,
of List 0aVrM PO2, PO3
√ √ [Link] CO1,
Polynomial
1 T1 69 [Link]/3h PO1,
Manipulation
0aVrM PO2, PO3
All √ √ [Link] CO1,
1 Operations(Insertio T2 73 [Link]/3h PO1,
n, Deletion) 0aVrM PO2, PO3
√ √ [Link] CO1,
All Operations
1 T2 76 [Link]/3h PO1,
(Merge, Traversal)
0aVrM PO2, PO3
UNIT 2
√ √ C02,
[Link]
PO1,
1 Stack ADT T1 78 [Link]/3h
PO2,
0aVrM
PO3
√ √ [Link] C02, PO1,
Operations-
1 T1 87 [Link]/3h PO2, PO3
Applications
0aVrM
Evaluating √ √ [Link] C02, PO1,
1 Arithmetic T1 89 [Link]/3h PO2, PO3
Expressions 0aVrM
Conversion of √ √ √ [Link] C02, PO1,
1 InfixtoPostfix T1 92 [Link]/3h PO2, PO3
Expression 0aVrM
√ √ [Link] C02, PO1,
Queue ADT-
1 T1 95 [Link]/3h PO2, PO3
Operations
0aVrM
√ √ [Link] C02, PO1,
1 Circular Queue T1 97 [Link]/3h PO2, PO3
0aVrM
√ √ [Link] C02, PO1,
1 Priority Queue 101 [Link]/3h PO2, PO3
0aVrM
√ √ [Link] C02, PO1,
1 Dequeue 105 [Link]/3h PO2, PO3
0aVrM
√ √ [Link] C02, PO1,
Applications Of
1 T1 100 [Link]/3h PO2, PO3
Queues
0aVrM
UNIT 3
√ √ CO3,
[Link]
Tree ADT-Tree PO1,
1 T1 116 [Link]/3h
Traversals PO2,
0aVrM
PO3
√ √ [Link] CO3,
Binary Tree ADT
1 T1 111 [Link]/3h PO1,
0aVrM PO2, PO3
Expression Trees- √ √ √ [Link] CO3,
Applications of T1 113 [Link]/3h PO1,
1
Trees 0aVrM PO2, PO3
√ √ [Link] CO3,
Binary Search Tree
1 T1 116 [Link]/3h PO1,
ADT
0aVrM PO2, PO3
√ √ [Link] CO3,
Threaded Binary
1 T1 124 [Link]/3h PO1,
Trees
0aVrM PO2, PO3
√ √ √ [Link] CO3,
1 AVL Trees T1 128 [Link]/3h PO1,
0aVrM PO2, PO3
√ √ [Link] CO3,
1 B-Tree T1 149 [Link]/3h PO1,
0aVrM PO2, PO3
1 B+Tree T1 152 √ √ [Link] CO3,
[Link]/3h PO1,
0aVrM PO2, PO3
√ √ [Link] CO3,
Heap-Applications
1 T1 198 [Link]/3h PO1,
of heap
0aVrM PO2, PO3
UNIT 4
√ √ CO4,
Definition- [Link] PO1,
1 Representation of T1 299 [Link]/3h PO2,
Graph 0aVrM PO3,
PO4
√ √ CO4,
[Link] PO1,
1 Types of Graph T1 300 [Link]/3h PO2,
0aVrM PO3,
PO4
√ √ √ CO4,
[Link] PO1,
Breadth-first
1 T1 405 [Link]/3h PO2,
Traversal
0aVrM PO3,
PO4
√ √ √ CO4,
[Link]
PO1,
1 Depth-first traversal T1 410 [Link]/3h
PO2,
0aVrM
PO3, PO4
√ √ CO4,
[Link]
PO1,
1 Topological Sort T1 302 [Link]/3h
PO2,
0aVrM
PO3, PO4
√ √ CO4,
[Link]
PO1,
1 Bi-Connectivity 311 [Link]/3h
PO2,
0aVrM
PO3, PO4
√ √ CO4,
[Link]
PO1,
1 Cut Vertex T1 328 [Link]/3h
PO2,
0aVrM
PO3, PO4
√ √ CO4,
[Link]
PO1,
1 Euler Circuits T1 342 [Link]/3h
PO2,
0aVrM
PO3, PO4
√ CO4,
[Link]
Applications of PO1,
1 T1 301 [Link]/3h
Graphs PO2,
0aVrM
PO3, PO4
UNIT 5
√ √ CO5,
[Link]
Searching-Linear PO1,PO2
1 T1 248 [Link]/3h
Search ,PO3,PO
0aVrM
4
1 Binary Serach T1 256 √ √ [Link] CO5,
[Link]/3h PO1,
0aVrM PO2,
PO3, PO4
√ √ √ CO5,
[Link]
Sorting-Bubble 236&2 PO1,
1 T1 [Link]/3h
Sort-Selection Sort 37 PO2,
0aVrM
PO3, PO4
√ √ √ CO5,
[Link]
Insertion Sort-Shell 244&2 PO1,
1 T1 [Link]/3h
Sort-Radix Sort 48 PO2,
0aVrM
PO3, PO4
√ √ CO5,
[Link]
Hashing-Hash 168&1 PO1,
1 T1 [Link]/3h
Functions 66 PO2,
0aVrM
PO3, PO4
√ √ CO5,
[Link]
PO1,
1 Separate Chaining T1 168 [Link]/3h
PO2,
0aVrM
PO3, PO4
√ CO5,
[Link]
PO1,
1 Open Addressing T1 173 √
VrM PO2,
PO3,PO4
√ CO5,
[Link]
PO1,
1 Rehashing T1 181 √
VrM PO2,
PO3, PO4
√ CO5,
[Link]
PO1,
1 Extendible Hashing T1 184 √
VrM PO2,
PO3, PO4
TEXT BOOKS:
[Link]. NAME OF THE BOOK AUTHOR
Mark Allen Weiss, “Data Structures and Algorithm Analysis in C”, 2nd
T1 Edition, Pearson Education,1997. Mark Allen Weiss
Reema Thareja, “Data Structures Using C”, Second Edition , Oxford
T2 University Press, 2011 Reema Thareja
REFERENCE BOOKS:
[Link]. NAME OF THE BOOK AUTHOR
Thomas H. Cormen, Charles E. Leiserson, Ronald [Link], Clifford
Thomas H. Cormen, Charles E.
Stein, “Introduction to Algorithms", Second Edition, Mcgraw Hill,
R1 Leiserson, Ronald [Link], Clifford
2002.
Stein
R2 Aho, Hopcroft and Ullman, “Data Structures and Algorithms”, Pearson Aho, Hopcroft and Ullman
Education,1983.
Stephen G. Kochan, “Programming in C”, 3rd edition, Pearson
Education. 4. Ellis Horowitz, Sartaj Sahni, Susan Anderson-Freed,
R3 Stephen G. Kochan
“Fundamentals of Data Structures in C”, Second Edition, University
Press, 2008.