CS 2201 DATA STRUCTURES L T P C 3 1 0 4

AIM:
To master the design and applications of linear, tree, balanced tree, hashing, set, and graph structures.
UNIT I LINEAR STRUCTURES 9
Abstract Data Types (ADT) List ADT array-based implementation linked list implementation cursor-
based linked lists doubly-linked lists applications of lists tack ADT !ueue ADT circular "ueue
implementation Applications of stacks and "ueues
UNIT II TREE STRUCTURES 9
Tree ADT tree tra#ersals left child right sibling data structures for general trees $inary Tree ADT
e%pression trees applications of trees binary search tree ADT Threaded $inary Trees.
UNIT III BALANCED TREES 9
A&L Trees play Trees $-Tree - heaps binary heaps applications of binary heaps
UNIT IV HASHING AND SET 9
'ashing eparate chaining open addressing rehashing e%tendible hashing - Dis(oint et ADT
dynamic e"ui#alence problem smart union algorithms path compression applications of et
UNIT V GRAPHS 9
Definitions Topological sort breadth-first tra#ersal - shortest-path algorithms minimum spanning tree
)rim*s and +ruskal*s algorithms Depth-first tra#ersal biconnecti#ity ,uler circuits applications of
graphs
TOTAL: 45 PERIODS
TEXT BOOK:
-. .. A. /eiss, 0Data tructures and Algorithm Analysis in 12, econd ,dition , )earson ,ducation,
3445.
REFERENCES:
-. A. &. Aho, 6. ,. 'opcroft, and 6. D. 7llman, 0Data tructures and Algorithms2, )earson ,ducation, 8irst
,dition 9eprint 344:.
3. 9. 8. ;ilberg, $. A. 8orou<an, 0Data tructures2, econd ,dition, Thomson =ndia ,dition, 3445.