Welcome to my central academic directory. This repository acts as a curated index of my journey through Computer Science and Engineering, showcasing core theoretical foundations alongside rigorous laboratory implementations, algorithmic problem-solving, and software engineering paradigms.
| Module | Core Domain | Focus & Key Concepts | Repository Link |
|---|---|---|---|
| CSE 101 | Structured Programming | Data types, control flow, pointers, memory management, file I/O, structures/unions, and mini-projects. | ⚓ Sea_Of_C |
| CSE 102 | Structured Prog. Sessional | Official laboratory assessments, including timed online evaluations and structured offline projects in C. | 💻 CSE_102 |
| CSE 105 | Data Structures & Alg. I | Linear/non-linear structures (BST, Heaps, Graphs), Sorting, Greedy strategies, DP, and Divide & Conquer. | 📐 DSA_Genesis |
| CSE 106 | DSA I Sessional | Algorithmic implementations, complex problem-solving modules, and rigorous weekly online/offline lab tests. | 🧠 CSE_106 |
| CSE 107 | Object-Oriented Programming | Advanced OOP paradigms (Abstraction, Inheritance, Polymorphism) explored via an interactive code-running suite in C++ and Java. | ☕ OOPverse |
| CSE 108 | OOP Sessional | Practical application of OOP principles, modular software construction, and verified lab assessments. | 🛠️ CSE_108 |
A comprehensive deep-dive into the fundamentals of structured programming using C.
- Core Topics: Low-level pointer manipulation, dynamic memory allocation, bitwise operations, macros, preprocessors, custom data types (
struct,union,enum), and persistent storage using File I/O. - Deliverables: Academic mini-projects implementing modular, clean code principles.
The practical crucible for C programming. This repository hosts targeted solutions to algorithmic problems under strict laboratory timelines.
- Onlines: Time-constrained, real-time algorithmic problem solving.
- Offlines: Production of optimized, logic-heavy standalone modules evaluated for edge cases and efficiency.
The architectural foundation of efficient software. This repository maps out theoretical data structures and fundamental algorithmic paradigms.
- Structures: Arrays, Linked Lists, Stacks, Queues, Binary Search Trees (BST), and Binary Heaps.
- Algorithms: Graph traversals, sorting mechanics, and paradigm-shifting techniques like Greedy Approaches, Dynamic Programming (DP), and Divide & Conquer.
Hands-on implementation of the data structures conceptualized in CSE 105. Focuses heavily on performance, time/space complexity optimization, and passing rigorous custom test suites during evaluation.
A dual-language exploration of Object-Oriented Programming principles using C++ and Java.
- Interactive Architecture: Designed not just as static code, but as an interactive sandbox/code runner to demonstrate core pillars: Encapsulation, Inheritance, Polymorphism, and Abstraction.
- Concepts: Exception handling, templates/generics, interfaces, and memory management profiles across different runtimes.
Practical software construction. This repository validates theoretical OOP knowledge by building scalable, maintainable applications, managing class hierarchies, and solving live, sessional lab challenges.
- Languages: C, C++ (STL), Java (JDK)
- Paradigms: Structured Programming, Object-Oriented Programming (OOP), Functional Aspects of Modern Java
- Core Competencies: Algorithm Design, Asymptotic Analysis, Memory Management, Interactive Execution Runtimes
🎨 Maintained with a commitment to clean architecture, algorithmic efficiency, and professional documentation.