This repository contains C implementations of fundamental Data Structures and Algorithms (DSA), completed as part of the 3rd semester B.Tech CSE curriculum at KIIT. These programs cover both basic and intermediate concepts essential for understanding how data is organized and manipulated efficiently.
- Arrays and Matrix operations
- Linked Lists (Singly, Doubly, Circular)
- Stacks and Queues (including Circular and Priority Queues)
- Trees (Binary Trees, BSTs)
- Graphs (Adjacency Matrix/List, BFS, DFS)
- Searching and Sorting Algorithms
- Recursion and Backtracking
- Hashing (basic implementations)