CS 2201 DATA STRUCTURES Lecture Notes for CSE - Third (3rd) semester - by R.Anirudhan

CS 2201 DATA STRUCTURES Lecture Notes for CSE - Third (3rd) semester


CS2201 Lecture Notes

Syllabus :


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



download Data Structure Lecture Notes


By Vinoth

Anna university Nov/Dec 2013 Results Jan 2014 Results

All Rights Reserved Anna University Exam Time table May/June 2014 - iAnnauniversity |
| My Google+ Profile | Find us on Google+