Complete implementation of all Data Structures Lab experiments as per KTU 2024 Syllabus
- Stack & Queue Operations
- Polynomial & Matrix Operations
- Expression Handling
- Linked List Operations
- Tree Operations
- Graph Algorithms
- Sorting Algorithms
- Searching & Hashing
| # | Experiment | Source Code | Status |
|---|---|---|---|
| 1 | Stack Using Array | 📄 View Code | ✅ |
| 2 | Queue Using Array | 📄 View Code | ✅ |
| 3 | Circular Queue Using Array | 📄 View Code | ✅ |
| 4 | Double Ended Queue Using Array | 📄 View Code | ✅ |
| 10 | Stack Using Linked List | 📄 View Code | ✅ |
| 11 | Queue Using Linked List | 📄 View Code | ✅ |
| 13 | Circular Queue Using Linked List | 📄 View Code | ✅ |
| 14 | Priority Queue - Post Office Simulation | 📄 View Code | ✅ |
| 16 | Double Ended Queue Using Doubly Linked List | 📄 View Code | ✅ |
| # | Experiment | Source Code | Status |
|---|---|---|---|
| 5 | Polynomial Addition Using Array | 📄 View Code | ✅ |
| 6 | Sparse Matrix - Transpose and Addition | 📄 View Code | ✅ |
| 12 | Polynomials Using Linked List | 📄 View Code | ✅ |
| # | Experiment | Source Code | Status |
|---|---|---|---|
| 7 | Infix to Postfix Conversion | 📄 View Code | ✅ |
| 8 | Postfix Expression Evaluation | 📄 View Code | ✅ |
| 20 | Expression Tree | 📄 View Code | ✅ |
| # | Experiment | Source Code | Status |
|---|---|---|---|
| 9 | Singly Linked List and Operations | 📄 View Code | ✅ |
| 15 | Doubly Linked List and Operations | 📄 View Code | ✅ |
| 17 | Browser Navigation Simulation | 📄 View Code | ✅ |
| 18 | Basic Memory Allocator | 📄 View Code | ✅ |
| # | Experiment | Source Code | Status |
|---|---|---|---|
| 19 | Binary Search Tree - Operations & Traversal | 📄 View Code | ✅ |
| 21 | Dictionary Implementation Using BST | 📄 View Code | ✅ |
| # | Experiment | Source Code | Status |
|---|---|---|---|
| 22 | Breadth First Search (BFS) | 📄 View Code | ✅ |
| 23 | Depth First Search (DFS) | 📄 View Code | ✅ |
| 24 | Mine in Maze - Multi Source BFS | 📄 View Code | ✅ |
| 25 | Water Pouring Problem - Graph Modelling | 📄 View Code | ✅ |
| # | Experiment | Source Code | Status |
|---|---|---|---|
| 26 | Bubble, Insertion & Selection Sort | 📄 View Code | ✅ |
| 27 | Quick, Merge & Heap Sort | 📄 View Code | ✅ |
| 28 | Merge K Sorted Lists | 📄 View Code | ✅ |
| # | Experiment | Source Code | Status |
|---|---|---|---|
| 29 | Linear Search and Binary Search | 📄 View Code | ✅ |
| 30 | Hash Table - Chaining Method | 📄 View Code | ✅ |
| 31 | Hash Table - Linear Probing | 📄 View Code | ✅ |
- GCC Compiler (MinGW for Windows, GCC for Linux/Mac)
- Basic knowledge of C programming
# Compile any program
gcc filename.c -o output
# Run the compiled program
./output # Linux/Mac
output.exe # Windowsgcc StackUsingArray.c -o stack
./stackClick to expand
- ✅ Linear Data Structures: Arrays, Stacks, Queues
- ✅ Linked Structures: Singly, Doubly, Circular Linked Lists
- ✅ Tree Structures: Binary Search Trees, Expression Trees
- ✅ Graph Algorithms: BFS, DFS, Graph Modelling
- ✅ Sorting: Bubble, Insertion, Selection, Quick, Merge, Heap
- ✅ Searching: Linear, Binary Search
- ✅ Hashing: Chaining, Linear Probing
- ✅ Advanced Applications: Memory Allocator, Browser Navigation
Contributions are welcome! Feel free to:
- 🐛 Report bugs
- 💡 Suggest new features
- 🔧 Submit pull requests
ARJUN K
- GitHub: @ARJYUN
- Repository: KTU-S3-Data-Structures-lab