Data Structures and Files

Unit I : File organization

C Files and command line argument, Primitive operations and implementation in C, Concept of sequential, simple Index file and direct access file , Hashing, Hashing function and it’s characteristics, Concept of collision resolution, linear probing, chaining with & without replacement, rehashing, Processing of sequential, Index-sequential and direct files. Sequential file organisation, direct file organisation, index sequential file organisation and their implementation.

Unit II : Stack

Concept of stack as ADT, Implementation of stacks using linked and sequential organization. Concept of multistacks, Importance of stack in recurssion, Importance of implict and explict stack Application of stacks.

Stack Operations

The two operations that form the majority of the functionality of the stack are theoperation of adding to the stack, and the operation of removing items from the stack.

Click here

to View a Simple Animation on Stack & Stack Operation

Unit III : Queues

Concept of queues as ADT, Implementation of linear and circular queue using linked and sequential organization. Concept of multiqueues, dequeue and priority queue. Application of queues.

Unit IV : Tree

Difference in linear and non-linear data structure, Trees and binary trees-concept and terminology.binary tree as an ADT. Algorithm for tree traversals (recursive and non recursive). Conversion of general tree to binary tree. Binary search trees, Concept of threaded binary tree.Threaded binary tree as an ADT. Preorder, Inorder traversals of inorder threaded binary search tree.

Unit V : Graphs

Graph as an ADT, Representation of graphs using adjacentcy matrix, adjacentcy list, Depth First Search and Breadth First Search. Algorithms for minimal spanning tree (Prim’s and Kruskal’s )and shortest path- Dijkstra’s algorithm Application of these algorithms.

Unit VI : Symbol Tables and Dynamic Trees

Notion of Symbol Table, AVL Trees, OBST, Heap data strucutre its application in heap sort, Huffman's algorithm, 25 Hash Tables: Basic concepts, hash function, hashing methods, collision resolution, bucket hashing.

Text Books

1. R. Gilberg, B. Forouzan, “Data Structures: A pseudo code approach with C”, Cengage Learning, ISBN 9788131503140.

2. A. Michael Berman, “Data structures via C++”, Oxford University Press, 2002, ISBN-0- 19-510843-4.

Reference Books

1. E. Horowitz, S. Sahni, D. Mehta “Fundamentals of Data Structures in C++”, Galgotia Book Source, New Delhi, 1995, ISBN 16782928.

2. Y. Langsam, M. Augenstin and A. Tannenbaum, “Data Structures using C and C++”, 2nd Edition, Prentice Hall of India, 2002, ISBN-81-203-1177-9.

3. R. Gilberg, B. Forouzan, “Data Structures: A pseudo code approach with C++”, Cengage Learning, ISBN 9788131504925.

4. A. Tharp ,”File organisation and processing”,2008 ,Willey India edition ,9788126518685

5. A. Drozdek, “Data Structures in C++”, 2nd Edition, Thomson Brookes /COLE Books, 2002, ISBN 981 – 240 – 079 – 6.

6. J. Tremblay, P. Soresan, “An introduction to data structures with Applications”, 2nd edition, Tata McGraw-Hill International Editions, 1984, ISBN-0-07-462471-7.

7. M. Folk, B. Zoellick, G. Riccardi, “File Structure An Object oriented approach with C++”, Pearson Education, 2002, ISBN 81 – 7808 – 131 – 8.

8. M. Weiss, “Data Structures and Algorithm Analysis in C++”, 2nd edition, Pearson Education, 2002, ISBN-81-7808-670-0

Download Ebooks for Data Structures and Algorithms:

Data Structures through C - Yashwant Kanetkar