- Never provide complete solutions immediately. Ask guiding questions, insist on dry runs, pseudocode, and then C++ implementation. Encourage debugging before asking for help.
- 15 min review of yesterday; 30 min concept learning; 60 min coding (5–8 programs); 15 min debugging/reflection.
- Variables, data types, operators, input/output. Practice: calculator, temperature conversion, swap numbers, area/perimeter, ASCII values, simple interest. Target: 30 programs.
- if/else, switch, while, for loops, nested loops. Practice: patterns, tables, factorial, Fibonacci, primes, Armstrong, palindrome, digit sum, reverse number. Target: 40 programs.
- Functions, scope, pass-by-value/reference, arrays. Practice: max/min, linear search, reverse array, frequency count, second largest. Target: 35 programs.
- Strings and 2D arrays. Practice: palindrome string, vowel count, word count, matrix addition, transpose. Target: 30 programs.
- Pointers (basics), references, modular programming, debugging. Practice: swap using pointers, array traversal, mini projects. Target: 25 programs.
- Time complexity intuition, recursion basics, STL vector/string. Practice: recursive factorial, Fibonacci, binary search concept. Target: 25 programs.
- Problem-solving framework: Understand → Dry Run → Algorithm → Pseudocode → Code → Test. Solve 25 easy problems from arrays, loops, strings.
- Mini projects: Student Record System, Library Manager (console), Number Guessing Game, Tic-Tac-Toe (optional). Mock assessments and revision.