DAY WISE PLAN OVERVIEW

Day Main Topic Subtopics Content Mins

1 Introduction Introduction to Computer understanding, preprocessor concepts, 15
programming different layers in understanding program.
Introduction to C History of C, Why C? & importance 15
Data Different data types -size based on compilers,
Data types
handling limits and range
What an why?, addressing, Scope, local and global
Variable
& storage class
Input & output Scanf, printf, access specifiers, escape sequence,
statement Type casting and problems
Operators Concepts Working of operators and problems
2 Control If, if-else, ladder, cascaded and nested & switch 100
Conditional statements
statements
looping statements While, do while, for 100
Jump statements Break, goto, continue 20
3 Patterns Why patterns and importance. How to visualize 30
Introduction
patterns.
Basic patterns Hollow & filled - box, triangle problems 80
techniques Mirroring , water reflection and combining 30
Combining triangles, sandwich and spiral patterns 70
complex patterns
(Problems)
4 Number Why and importance. Disclaimers(array, strings). 30
Introduction
crunching Why to reconstruct why not to print
Forward & reverse - Digits separation & 180
techniques
reconstruction problems
5 Single What & why? Compiler understanding, 90
Introduction & concept
dimension declarations, size, initialisations, indexing.
of array
Array
Accessing, printing, shifting, insertion & deletion - 120
Methods of array
problems
drawbacks of array Size, memory, time complexity 10
6 Strings What and why?, working, types(wild, null, 30
Pointers
dangling, void), memory acquisition and free.
What and why, declaration, definition, signature, 60
Functions argument return type and calling (by value / ref).
Storage classes. Function vs Macros
What?, Null char, Compiler understanding, 30
Strings
declarations, size, initialisations, indexing.
Accessing and printing. Different fucntions - 100
Methods
predefined and without inbuilt. Problems
Trainers’ technical code of conduct:
1. Never give or teach any syntax or dry concept, you are ought to inculcate the concepts and
syntax while solving the problems.
2. Encourage candidates to use pen and paper to solve and get the concept of the problem
3. Encourage dry run before solving or coding
4. Always use meaning full variable names and encourage students to do the same
5. Always come up with an optimized and simple code on concerning the quality.
6. Make sure to align properly, by proper indents though it’s not required, which will make the
code look code.
7. Make sure only to initialise the variable before the usage scope, not while declaring.
8. Make sure to use the proper and correct terminologies.
9. Then and there make sure to push students to solve problems by stories or your own way
10. Make sure to tell them to take notes in such a way, times down 6 months / 1 year, the notes
need to be useful and understandable.
11. Class control and quality in writing and explaining optimised code is the utmost priority.
12. Make sure solve the problem only in the portal. Don’t use code block or anyother idle
13. Please don’t share your codes to candidates
14. Make candidates to solve the problems in portal.
 DAILY PLAN FOR SESSION HANDLING 4-6 HOURS A DAY
Day 1: Introduction and Data Handling
Concepts need to be covered:
1.1 Introduction to programming
- Explain what is a programming language, also emphasis how computer / processor
understands the language along with the involved backend process.
1.2 Introduction to C
- Explain why C programming, along with its importance. Also, emphasis the need of C in the
current tech era.
1.3 Data types:
- Explain atomic (int, char, float, double) and molecular (array, structure, unions) data types,
along with the qualifiers (long, signed, unsigned, short).
- Explain and display the ranges, size and limits using limit.h for all the data types based on the
compilers. Make sure to explain about ASCII
1.4 Variables
- Explain what is variable and also visualise how a variable is allocated a memory along with its
addressing.
- Show and explain local and global scope of variables along with its storage class (auto, register,
static)
-Explain how to initialise along with how to pass binary, octal, hexadecimal and decimal
numbers.
1.5 input and output statements
- explain the scanf and printf while solving portal problems.
- format specifiers(%d,i,x,o,c,s,f,e,lf,Lf,u,ld,p)
- Escape sequence(\n,t,a,r,b,f,v,’,”,\,?,0,nnn,xhh)
- Explain type casting / convertion
1.6 Operators
- Arithmetic: +,-,*,/,%
- Logical: &&,||, !
- Bitwise: &,|,~,^,<<,>>
- Relational: >,<, ==, >=,<=, !=
- Assignment: =,+=, *=, /=, -=, %=
- Uniary: ++, --
- Terinary: ?,:
- sizeof
1.7 MCQ from portal

Note: Initially to check the level and knowledge of students if any previous session handled, MCQ would
be used for better understanding about the candidates.
Day 2: Control statements
Problems to solve in session:
Conditional statements:
1. Two numbers are equal / not
2. Print the greatest of 2/3/4 numbers
3. Number is positive / negative. Or zero
4. To check given year is leap year or not (%100, %4, %400 )
5. Arrange 4 numbers in ascending order (Introduce and use Macro concept here)
6. Check whether 3 sides/ angle is triangle and check its types as isosceles, equilateral or scalene /
right angles, obtuse or acute. (explain prioritising conditions)
7. To print the day from the number and to print the month name from number
8. To check whether the given char is vowel (use switch without break)
Looping statements:
Series:
1. Print 1 to N and A to Z in reverse order and its lower case
2. AaBb…Zz, aAbB….zZ, AbCd…., aBcD…
3. Print even, odd
4. Average, sum, of N number
5. Fibonacci series
6. Connell series
7. Catalan series
Operation problems:
8. Print factors of a number (basic code, /2 and sqrt(num)) basic to optimized
9. Explain the concept Perfect / deficient / amicable/ betrothed/ quasi amicable number or not
and solve perfect, prime and betrothed.
10. To print prime numbers in a given range
11. HCF, GCD and LCM.

Note: Make sure to explain while, do while and for loop while solving problems and emphasis them that
for is just beautified version of while, no other difference among for and while. The syntax of for is
for(initial settings; condition; alterations). Also, make sure to emphasis that for loop can take function
calling in alterations part. Single line for loop is possible.
Day 3: Patterns
Problems to solve
**** **** * * ****
**** * * * ** ***
**** * * * *** **
**** **** * **** * (water)
1 1 4321 A A 4321
12 22 321 AB BC 123
123 333 21 ABC DEF 21
1234 4444 1 ABCD GHIJ 1 (combng)
1 1 1234 1 1234567 *
01 10 123 24 12345 **
101 101 12 135 123 ***
0101 1010 (concept) 1 2468 (combng) 1 **** ( mirror)

01 02 03 04 05 4444444 01 02 03 04 05 1 To do complex
4333334 2*2
11 12 13 14 15 16 17 18 19 06 patterns with
4322234 3*3*3
21 22 23 24 25 4321234 15 24 25 20 07 numbers and char
4*4*4*4
16 17 18 19 20 4322234 14 23 22 21 08 3*3*3 too. Also add emoji
06 07 08 09 10 4333334 13 12 11 10 09 2*2
4444444 like ☺☻♥♦♣♠
1

Day 4: Number Crunching

Problems to be solved
1. To calculate no of digits
2. No of digits and power without destroying the number
3. To rotate a number
4. Armstrong number
5. Kaprekar number
6. Happy number
7. To read the number from left to right
8. Reversing the number
9. Palindrome
10. Adam number(to check both condition eg: 20)
11. Swap alternative digits
12. 196 algorithm (num + revnum until its palindrome)
13. Num = 123456, choice 0 = 135246, choice 1 = 246135
14. Occurrence of digit
15. Peak digits
Day 5: 1D arrays
Problems to solve at class:
1. To get and print values of an array
2. To calculate number of element
3. To find first / second max element
4. To print the repeated elements
5. To print the array in reverse order
6. To calculate and replace array elements with sum of other elements
7. To perform left sum / right of elements including and excluding number
8. Basic operations of elements (sum, product, average)
9. To reverse an array /swapping techniques (using temp, using addition and sub, using xor ^)
10. Median of two sorted arrays
11. Inserting / deleting an element
12. Rotating the array n times
13. Array sorting ascending / descending
14. Find the max gap between duplicated elements

Day 6: Strings
Problems to solve in class
1. To read and print the string with spaces / 2 sentence using scanf(getchar(), %[^\n*c])
2. To check a given char is vowel or not
3. In built function – strlen, strcpy, strcat, strcmp, strrev, strstr, strupr,strlwr, isupper, islower,
isalpha, isalnum
4. Pointers and its types, double pointer using adam number explain functions
5. Write user defined functions for all inbuilt function in section 3.
6. Reverse a string
7. To check whether a string is palindrome
8. To rotate a string n times
9. To check whether a string is rotation or not
10. Count number of words
11. To reverse a string word by word
12. Swap given 2 words in a string
13. String compression and elongation
14. String sorting