Semester 3: The Foundation > This repository documents my early journey into computer science fundamentals. It serves as a personal archive of the logic and memory management concepts I mastered during my third semester.
I organized these modules to track my progress from basic data handling to complex dynamic memory structures. Each folder represents a milestone in my understanding of algorithmic efficiency.
| Milestone | Architectural Concept | Key Focus | Source Code |
|---|---|---|---|
| 00 | Introduction | Memory Allocation & ADTs | View Folder |
| 01 | Arrays | Static & Dynamic Manipulation | View Folder |
| 02 | Stack | LIFO Logic & Pointer usage | View Folder |
| 03 | Recursion | Functional Depth & Stack Frames | View Folder |
| 04 | Queue | FIFO, Circular & Priority | View Folder |
| 05 | Sorting | Algorithm Analysis & Sorting | View Folder |
| 06 | Linked List | Dynamic Memory Management | View Folder |
- Language: C++
- Concepts: Dynamic Memory Management, Pointers, Algorithm Analysis (Big O).
- Tools: VS Code, G++ Compiler.
Each folder contains source code and a dedicated README.md or notes.md explaining implementation details and my personal learning notes.
To compile and run any file:
g++ filename.cpp -o output
./output