📘 Data Structures & Programming Concepts — Course Repository

This repository contains structured materials, code implementations, and practice exercises covering fundamental programming and data structures concepts. It is organized according to the course timeline and topics covered throughout the semester.

---

🧭 Course Roadmap

🔹 Unit 1: Functions, Arrays & Structs

📅 Weeks 1–2

• Functions: definition, parameters, return values
• Arrays: 1D & 2D arrays, operations, traversal
• Structures (Structs): grouping data, real-world modeling

---

🔹 Linux Fundamentals

📅 Weeks 2–3

• Basic terminal commands
• File system navigation
• Permissions and file handling
• Shell basics

---

🔹 Unit 2: Searching, Sorting & Analysis

📅 Weeks 4–5

• Searching Algorithms: Linear Search, Binary Search
• Sorting Algorithms: Bubble Sort, Selection Sort, Insertion Sort
• Time Complexity & Big-O Analysis

---

🔹 Unit 3: Pointers & Dynamic Memory Allocation

📅 Weeks 6–7

• Pointer basics and operations
• Memory addresses and dereferencing
• Dynamic memory allocation (malloc, calloc, free)
• Common pitfalls and debugging

---

📝 Midterm Exam

📅 Week 8

• Comprehensive review of Units 1–3
• Exam assessment

---

🔹 Unit 4: Introduction to Classes (OOP Basics)

📅 Weeks 10–11 (Week 9: Spring Break)

• Classes and Objects
• Constructors & Destructors
• Encapsulation basics

---

🔹 Unit 5: Linked Lists

📅 Weeks 12–13

• Singly Linked Lists
• Insertion, Deletion, Traversal
• Memory handling in linked structures

---

🔹 Unit 6: Stacks & Queues

📅 Weeks 14–15

• Stack (LIFO): implementation using arrays & linked lists
• Queue (FIFO): implementation and applications
• Real-world use cases

---

🔁 Final Review

📅 Week 15

• Full course revision
• Practice problems and key concepts

---

🎯 Final Exam

📅 Week 16 — May 7th (2:00 PM – 4:30 PM)

• Cumulative assessment covering all units

---

🛠️ Repository Structure

/unit-1-functions-arrays-structs
/unit-linux
/unit-2-searching-sorting
/unit-3-pointers
/unit-4-classes
/unit-5-linked-lists
/unit-6-stacks-queues
/review-material

---

🚀 How to Use This Repository

• Follow the units sequentially based on the course timeline
• Practice problems after each topic
• Review implementations and understand logic deeply
• Use review materials before exams

---

🎯 Goal

Build a strong foundation in programming and data structures, preparing for advanced computer science concepts and real-world problem solving.

---

📌 Notes

• Consistency > cramming
• Focus on understanding, not memorization
• Practice coding daily

---

🤝 Contributions

Feel free to fork, improve, and contribute additional examples or optimizations.

---

📄 License

This project is for educational purposes.