Exploring the world of algorithms at Oriental College of Technology, Bhopal
Department of CSE-AIML
Software Developer
Click to see GitHub Stats →
← Click to flip back
A comprehensive collection of DSA implementations with detailed explanations and examples.
Program
|
Implementation Details
|
---|---|
01 |
Array Operations - Input & Calculate• Input marks of 5 subjects and calculate total & percentage |
02 |
Array Analysis - Element Finding• Advanced implementation to find highest and lowest elements |
03 |
Matrix Operations & Manipulations• Implementation of matrix addition and advanced operations 2D Arrays Matrix Math |
04 |
Linked List Implementation• Complete implementation of Singly Linked List operations including insertion, deletion, and traversal |
05 |
Fibonacci Series Generation• Implementation of Fibonacci series using both iterative and recursive approaches |
06 |
Stack Operations• Implementation of stack operations: push, pop, peek, and display |
07 |
Queue Implementation• Queue operations including enqueue, dequeue, and display |
08 |
Circular Queue Operations• Implementation of circular queue with all basic operations |
09 |
Binary Tree Traversals• Implementation of inorder, preorder, and postorder traversals |
10 |
Binary Search Algorithm• Implementation of binary search with sorted array |
11 |
Sorting Algorithms• Implementation of bubble, selection, and insertion sort |
12 |
Graph Traversal Algorithms• Implementation of BFS and DFS traversal techniques |
git clone https://github.com/UmeshCode1/DSA_LAB_COLLEGE.git
cd DSA_LAB_COLLEGE
Code is like humor. When you have to explain it, it's bad.
First, solve the problem. Then, write the code.
Clean code always looks like it was written by someone who cares.
The best error message is the one that never shows up.
Programming is the art of telling another human what one wants the computer to do.
Every great developer you know got there by solving problems they were unqualified to solve.