CS2201-DATA STRUCTURES-ANNA UNIVERSITY SYLLABUS for CSE

**C**

**S 2201 DATA STRUCTURES L T P C**

**3 1 0 4**

**A**

**I**

**M**

**:**

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

**UN**

**I**

**T 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 –

Stack ADT – Queue ADT – circular queue implementation – Applications
of stacks
and
queues

**UN**

**I**

**T II TREE STRUCTURES 9**

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.

**UN**

**I**

**T III BALANCED TREES 9**

AVL Trees – Splay Trees – B-Tree - heaps – binary heaps – applications of binary heaps

**UN**

**I**

**T IV HASHING AND SET 9**

Hashing – Separate chaining – open addressing – rehashing – extendible hashing -
Disjoint Set ADT – dynamic equivalence problem – smart union algorithms – path compression – applications of Set

**UN**

**I**

**T V GRAPHS 9**

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

**T**

**EX**

**T BOOK:**

**T**

**O**

**T**

**A**

**L: 45 PERIODS**

1. M.
A. Weiss,
“Data Structures
and
Algorithm Analysis
in C”,
Second Edition
,
Pearson Education, 2005.

**R**

**E**

**FERENCES:**

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.

## 0 comments:

## Post a Comment