These are the Data Structure and File Laboratory assignments/programs for Information Technology Students. These assignments/programs are created as per Pune University. Following are the Data Structure and File Laboratory Programs created and self implements. Following Programs are implemented on Unix/Linux Operating System using C/C++ Language. Learn about these programs with source code. If you find this helpful then share with colleagues.Thank You.

- Implement stack as an abstract data type using linked list and use this ADT for conversion of infix expression to postfix , prefix and evaluation of postfix/prefix expression.

- Implement circular queue using array and perform following operations on
- Add a record
- Delete a record
- Checking Empty
- Checking Underflow
- Checking Overflow

- Implement priority queue as ADT using multiple linked lists ,one list for each priority for servicing patients in an hospital with priorities as
- Serious (top priority)
- Medium illness (medium priority)
- General (Least priority)

- Construct and expression tree from postfix/prefix expression and perform recursive and non-recursive Inorder , preorder and postorder traversals.

- Implement binary search tree as an ADT

- Construct an inorder threaded binary tree from inorder/postorder expression and traverse it in inorder and preorder.

- Represent any real world graph using adjacency list/adjacency matrix find minimum spanning tree using Prim’s or Kruskal’s algorithm.

- Represent a given graph using adjacency matrix/adjacency list and find the shortest path using Dijkstra's algorithm.

- Implementation of Hash table using array and handle collisions using Linear probing, chaining without replacement and Chaining with replacement.

- Implement Heap sort by constructing max or min heap .

- Implement an index sequential file for any Database and perform following operations on it
- Create Database
- Display Database
- Add a record
- Delete a record
- Modify a record

## 0 Comments