🧮 DSA Lab Programs

This repository contains all Data Structures and Algorithms (DSA) practical programs for Second Year Laboratory Work.
Each practical includes:

• 📄 Source Code (.cpp file)
• 🧾 Output PDF (Program output and results)
• 🗓️ Date of execution and record reference

##📘 List of Practicals

1️⃣ Hash Table – Telephone Book
Implement a hash table for a telephone directory using a collision handling technique.

2️⃣ ADT using Hashing
Implement basic functions of Abstract Data Type using hashing technique.

3️⃣ Construct Tree and Print Nodes
Create a binary tree and print its nodes using traversal methods.

4️⃣ Expression Tree (Prefix Expression)
Construct an expression tree from the given prefix expression (e.g., abc/def).

5️⃣ Dictionary using BST
Store keywords and their meanings using Binary Search Tree operations.

6️⃣ Graph Representation
Represent graph using adjacency matrix/list and perform BFS and DFS traversals.

7️⃣ Shortest Path Algorithm
Implement shortest path finding in a graph (e.g., Dijkstra’s algorithm).

8️⃣ Optimal Binary Search Tree (OBST)
Construct an OBST for a given sequence of sorted keys and probabilities.

9️⃣ Dictionary using AVL Tree
Store and perform operations on dictionary data using AVL tree balancing.

🔟 Priority Queue – Patient Service
Implement a priority queue to provide services to patients based on priority.

11️⃣ Sequential File Handling (Student Data)
Perform file operations on student data using sequential file organization.

12️⃣ Indexed Sequential File (Employee Data)
Implement employee data operations using index sequential file organization.

📂 Repository Structure

DSA-Lab-Programs/ │ ├── 01_Hash_Table_Telephone_Book/ │ ├── DSA1.cpp │ └── DSA1.pdf │ ├── 02_ADT_Functions_Using_Hashing/ │ ├── DSA2.cpp │ └── DSA2.pdf │ ├── 03_Construct_Tree_Print_Nodes/ │ ├── DSA3.cpp │ └── DSA3.pdf │ ├── 04_Expression_Tree_From_Prefix/ │ ├── DSA4.cpp │ └── DSA4.pdf │ ├── 05_Dictionary_Using_BST/ │ ├── DSA5.cpp │ └── DSA5.pdf │ ├── 06_Graph_Adjacency_Matrix_List_BFS_DFS/ │ ├── DSA6.cpp │ └── DSA6.pdf │ ├── 07_Shortest_Path_Graph/ │ ├── DSA7.cpp │ └── DSA7.pdf │ ├── 08_OBST_Optimal_BST/ │ ├── DSA8.cpp │ └── DSA8.pdf │ ├── 09_Dictionary_Using_AVL_Tree/ │ ├── DSA9.cpp │ └── DSA9.pdf │ ├── 10_Priority_Queue_Patient_Service/ │ ├── DSA10.cpp │ └── DSA10.pdf │ ├── 11_Sequential_File_Student_Data/ │ ├── DSA11.cpp │ └── DSA11.pdf │ └── 12_Index_Sequential_File_Employee_Data/ ├── DSA12.cpp └── DSA12.pdf

🧠 Technologies Used

• Language: C++ (Dev-C++, GCC, Code::Blocks)
• Concepts: Data Structures & Algorithms
• Topics Covered: Hashing, Trees, Graphs, Queues, BST, AVL, OBST
• File Handling: Sequential & Indexed File Organization

📅 Academic Information

Subject: Data Structures and Algorithms (DSA)
Semester: Second Year – Semester IV
Department: Computer Science

✍️ Author

Name: Shivshankar Dhareppa Mali
Year: Second Year
Course: B.E. / B.Tech (CSE )
GitHub: @shiv123-coder