📍 Module 1: Programming in C – Basics

• Introduction to C Language & IDE Setup

• Data Types, Variables, Constants

• Operators and Expressions

• Input/Output (printf, scanf)

• Conditional Statements (if, if-else, switch)

• Loops (for, while, do-while)

• Functions and Recursion

• Arrays and Strings

• Pointers and Dynamic Memory Allocation

• Structures & Unions

• File Handling in C

📍 Module 2: Introduction to Data Structures

• What are Data Structures?

• Static vs Dynamic Structures

• Time & Space Complexity Analysis (Big O Notation)

• Types of Data Structures (Linear & Non-Linear)

📍 Module 3: Linear Data Structures

• Arrays

  • 1D and 2D Arrays

  • Sorting Algorithms (Bubble, Selection, Insertion, Merge, Quick)

  • Searching Algorithms (Linear, Binary)

• Linked List

  • Singly Linked List

  • Doubly Linked List

  • Circular Linked List

  • Operations (Insert, Delete, Search, Traverse)

• Stacks

  • Implementation using Array & Linked List

  • Applications (Expression Evaluation, Recursion)

• Queues

  • Simple Queue

  • Circular Queue

  • Priority Queue

  • Deque

📍 Module 4: Non-Linear Data Structures

• Trees

  • Binary Trees & Binary Search Trees

  • Tree Traversals (Inorder, Preorder, Postorder)

  • AVL Trees (Intro)

• Graphs

  • Representations: Adjacency Matrix & List

  • BFS and DFS Traversal

  • Applications in Networking, Games, AI

📍 Module 5: Algorithms & Problem Solving

• Recursion Practice

• Divide and Conquer Algorithms

• Greedy Algorithms

• Backtracking

• Dynamic Programming (Intro with Problems)

• Hashing and Hash Tables (Basic Concept)

• Practice Problems with Patterns and Logic Building

📍 Module 6: Competitive Coding & Interview Prep

• Top Coding Challenges on Arrays, Strings, Linked Lists, Trees, Graphs

• How to approach a coding question

• Dry run and complexity optimization

• Resume & GitHub Project Guidance

• Mock Interviews & HR Tips