Data Structures (Anna University)

Brand: Technical
Product Code: DS3
Availability: 50
Price: ₹350.00 ₹340.00

By: A. A. Puntambekar
ISBN: 9789350990841
Edition: V
Pages: 520

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.

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.

Balanced Trees
AVL trees - Splay trees - B-tree - Heaps - Binary heaps - Applications of binary heaps.

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

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.

Write a review


Your Name:


Your Review: Note: HTML is not translated!

Rating: Bad           Good

Enter the code in the box below: