في عصر الذكاء الاصطناعي… المطلوب مش مبرمج. المطلوب مهندس.

Introduction to Problem Solving • Input/Process/Output • Algorithms Basics • Flowchart Symbols & Rules • Converting Problems to Flowcharts • Tracing • Common Logic Mistakes

What is a Computer? • Binary & Number Systems • How Programs Run • Compiler vs Interpreter • Memory Basics (RAM/Variables) • From Code to Binary

First Program (Hello World) • Code Structure & Syntax • Comments & Readability • Input/Output • Compilation Errors vs Logic Errors

Variables Concept • Data Types • Type Casting • Constants • Memory Representation • Common Beginner Mistakes

Decision Making • if Statement • Nested if • switch Statement • Logical Conditions

Loop Concepts • break & continue • Nested Loops • Pattern Problems • Mixed Practice

Array Operations • Searching & Sorting Basics • Frequency Arrays • 2D Arrays • Strings

Function Syntax • Parameters & Return Values • Scope • Overloading • Recursion Intro

Struct Basics • Arrays of Structs • Passing Structs • Real Data Modeling

Memory Addresses • Pointers Basics • Pointers & Arrays • Dynamic Memory Intro • Common Pointer Mistakes

What is OOP? • Procedural vs Object-Oriented • Real World Modeling • Class vs Object • Why OOP Exists

Creating Classes & Objects • Accessing Members • Object Interaction • Common Design Mistakes

Constructor Concept • Overloading Constructors • Object Initialization Flow

Access Modifiers • Getters & Setters • Validation Logic

Static Variables • Class-Level Behavior • Memory Sharing

Base & Derived Classes • Constructor Chaining • Method Overriding

Virtual Functions • Runtime Behavior • override Keyword

Overloading Arithmetic Operators • Best Practices • When NOT to Overload

HAS-A vs IS-A • Object Ownership • Design Decisions

try/catch • Custom Exceptions • Safe Design

Responsibility Separation • Refactoring • Preparing for Large Systems

What is a Data Structure? • ADT • Time Complexity (Big O) • Space Complexity • Comparing Solutions

Node Structure & Memory Layout • Singly LL Operations • Doubly LL • Trade-offs vs Arrays

Stack Concept (LIFO) • Array & Linked List Implementation • push/pop/peek • Parentheses Check

Queue Concept (FIFO) • Circular Queues • Priority Queue • CPU Scheduling Simulation

Tree Terminology • Binary Trees • Tree Traversals • Recursive Thinking

BST Properties • Insert/Search/Delete • BST vs Regular Tree

Min Heap / Max Heap • Heap Insert & Extract • Heap Sort

Hashing Concept • Hash Functions • Collision Handling • Real-world Use Cases