141301 DATA STRUCTURES

Unit I 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

Unit II 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.

Unit III Balanced Trees

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

Unit IV 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

Unit V 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

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.

## 0 comments:

Post a Comment