Programming for Problem Solving (ES-CS201)
Lesson Plan
Clas Topic Details
s
Unit 1: Introduction to Programming (4 lectures)
1 Components of a Disks, memory, processor, program storage and
computer system execution, operating system, compilers.
2 Idea of Algorithm Steps to solve logical and numerical problems.
Representation through flowchart/pseudocode with
examples.
3 From algorithms to Source code, variables (data types), variables and
programs - Part 1 memory locations.
4 From algorithms to Syntax and logical errors in compilation, object code,
programs - Part 2 and executable code.
Unit 2: Arithmetic expressions and precedence (2 lectures)
5 Arithmetic expressions Writing arithmetic expressions, precedence rules, and
examples.
6 Expression evaluation Step-by-step evaluation and common pitfalls.
Unit 3: Conditional Branching and Loops (6 lectures)
7 Writing conditionals if, else if, else statements, relational and logical operators.
8 Evaluation of Nested conditionals, switch-case statements.
conditionals and
branching
9 Iteration and loops - Basics of loops: for, while, and do-while.
Part 1
10 Iteration and loops - Nested loops, break and continue statements.
Part 2
11 Common errors in Debugging infinite loops, off-by-one errors, and logic
loops errors.
12 Application of loops Examples of real-life problems solved using loops.
Unit 4: Arrays (6 lectures)
13 Introduction to arrays 1-D arrays, declaring, initializing, accessing, and
modifying elements.
14 Operations on 1-D Examples: summing elements, finding maximum and
arrays minimum, reversing an array.
15 2-D arrays - Part 1 Declaring, initializing, and accessing 2-D arrays.
16 2-D arrays - Part 2 Matrix operations: addition, subtraction, and transpose.
17 Character arrays and Basics of strings, string input/output, common
strings - Part 1 operations like length, copy, and concatenation.
18 Character arrays and Using string-related functions from <string.h>.
strings - Part 2
Unit 5: Basic Algorithms (6 lectures)
19 Searching algorithms Linear search and binary search with examples.
20 Sorting algorithms - Bubble sort: algorithm, implementation, and analysis.
Part 1
21 Sorting algorithms - Insertion sort and selection sort: algorithms,
Part 2 implementation, and analysis.
22 Roots of equations Example programs to find roots using iterative methods.
23 Notion of complexity Introduction to time complexity through example
programs (no formal definition).
24 Applications of sorting Practical use cases like organizing data or searching
and searching within files.
Unit 6: Functions (5 lectures)
25 Introduction to Writing functions, benefits, and using standard library
functions functions.
26 Function parameters Passing parameters: call by value, returning values.
27 Passing arrays to Understanding call by reference using arrays.
functions
28 Advanced function Scope of variables, recursion vs iteration overview.
concepts
29 Practical applications of Modular programming and real-world examples.
functions
Unit 7: Recursion (5 lectures)
30 Introduction to Basics, how recursion works, and base cases.
recursion
31 Examples of recursion - Factorial, Fibonacci series.
Part 1
32 Examples of recursion - Ackermann function, understanding recursive tree
Part 2 structures.
33 Advanced recursion Quick sort or merge sort algorithms.
34 Recursion vs Iteration When to use recursion, advantages, and limitations.
Unit 8: Structure (4 lectures)
35 Introduction to Defining structures, accessing structure members.
structures
36 Array of structures Declaring and using arrays of structures.
37 Nested structures Structures within structures and examples.
38 Practical applications of Applications in real-world programs.
structures
Unit 9: Pointers (2 lectures)
39 Basics of pointers Defining pointers, pointer arithmetic, and dereferencing.
40 Pointers and self- Concept of linked lists (introduction only, no
referential structures implementation).
Unit 10: File Handling (If time permits)
41 Basics of file handling Opening, reading, writing, and closing files.
42 Practical applications of Writing data to files and reading data from files.
file handling