📘 KTU S3 Data Structures and Algorithms (DSA) Lab

This repository contains the DSA Lab experiments implemented as part of the curriculum.
Each experiment demonstrates important concepts of arrays, stacks, queues, linked lists, trees, graphs, searching, sorting, and hashing.

📂 Repository Structure

Each experiment is placed in a separate folder with proper source code, test cases, and documentation.

KTU-S3-Data-Structures-and-Algorithms-DSA-Lab/
├── experiment_01/
│   ├── exp1.c
│   └── README.md
├── experiment_02/
│   ├── exp2.c
│   └── README.md
├── experiment_03/
│   ├── exp3.c
│   └── README.md
├── ...
├── experiment_20/
│   ├── exp18.c
│   └── README.md
└── README.md

🧪 List of Experiments

Exp. No.	Experiment
1	Find the sum of two sparse polynomials using arrays
2	Find the transpose of a sparse matrix and sum of two sparse matrices
3	Convert infix expression to postfix/prefix and evaluate using stack
4	Implement Queue arrays
5	Implement Circular Queue using arrays
6	Implement back and forward navigation of visited web pages using doubly linked list
7	Implement addition of polynomials using singly linked lists
8	Implement multiplication of polynomials using singly linked lists
9	Create a binary tree for an arithmetic expression and find prefix/postfix equivalent
10	Implement a dictionary of word-meaning pairs using binary search trees
11	Given an array of sorted items, implement an efficient algorithm to search for specific item in the array(binary search) / Implement efficient search for an item in a sorted array
12	Implement Bubble Sort, Insertion Sort, Radix Sort, Quick Sort, and Merge Sort, then compare steps
13	Implement a spell checker using a hash table to store a dictionary of words for fast lookup. Implement functions to check if a word is valid and to suggest corrections for misspelled words / Implement a spell checker using a hash table with fast lookup & suggestions
14	Simulation of a basic memory allocator and garbage collector using doubly linked list
15	Water jug problem (10L, 7L, 4L containers) modeled as a graph
16	Implement find-and-replace feature in a text editor
17	Implement efficient search for an item in a sorted array
18	Customer queue prioritization (Differently abled > Senior citizen > Defense > Ordinary)
19	Maximize activity points by participating in at most k events
20	Merge k sorted lists into a single sorted list using a min-heap

⚙️ Setup Instructions

1. Clone the repository

   https://github.com/mithun2003/KTU-S3-Data-Structures-and-Algorithms-DSA-Lab
   cd KTU-S3-Data-Structures-and-Algorithms-DSA-Lab

2. Navigate to a specific experiment folder

   cd experiment_01
   

3. Compile and run

   gcc file_name.c
   ./a.out
   

✨ Features

Covers core DSA concepts through practical problems

Well-structured and modular code

Each experiment is self-contained and documented

Useful for lab submissions and interview preparation

👨‍💻 About the Author

Hi, I'm Mithun Thomas 👋

• 🎓 B.Tech CSE (2024–2028) @ College of Engineering, Kottarakkara
• 💻 Passionate about problem-solving, DSA, and software development
• 🌱 Currently exploring Machine Learning, AI, and System Design
• 📫 Reach me at: mithun2003

---

⭐ If you like this repository, don't forget to star it on GitHub!