The document discusses various programming concepts, particularly focusing on loops, conditionals, and arithmetic operations using C language syntax. It includes practical examples and exercises to demonstrate loop functions, how to print number series, and various mathematical calculations such as factorial, Fibonacci series, and sums. The content is structured to facilitate understanding and application of basic programming techniques for learners.

1. C in One Shot
Part - 3

2. Loops in One Shot

3. What and
Why?
loods - bear baar ->
repetition
printf("Hello PWIn");
P
rintG / "Hello PW (n");
DRY I do not repeat yourself

4. condition
updation/increment
initialization A r
Output
I
· Hello PW
O Hello PW
6
B
-
· Hello PW
& 1) condition check
-S
I
steps
3) Updation
I⑥
*
Hello PW
B ·
Hello PW
R 2) Loop be andar ado
I
i = i + 1( i +
+

5. -> HW. S i =
i+ 3;
·
Hello World
·
Hello World
Sep
1: Check condition
11
·
Hello World
i
al Step
2: Go Inside look
I
· Hello World
· Hello World
I
B
Step
3:
Updation
O
*

6. For Loop
for(int i = 1; i<10; i++){
// code
}

7. Ques : Print hello world ‘n’ times. Take ‘n’ as
input from user

8. How for loop works : the various parameters.
incition
rationf
he increment/decrementin

9. Ques : Print numbers from 1 to 100
in different lines Output
Oput: L 4 -
5 - 6
in
. i =
123
I
1-2-3-
&
100

10. Ques : Print all the even numbers from 1 to 100
&
if (i%2
= = 0<
print"God", i);
3

11. HW : Print all the odd numbers from 1 to 100

12. Ques : Print the table of 19.
19, 38, 57
..... 190

13. HW : Print the table of ‘n’. Here ‘n’ is a integer
which user will input.
int n;
scanf/" Ood",&n);
2n +
1 + 2xn -
1
- 2n -
1
-

14. Ques : Display this AP - 1,3,5,7,9.. upto ‘n’
terms.
he
*
3,5,7, 9, 11, 13. D
an
=
1 +
(n-
1)-2
vXvV - 1 + 2n -
z
=
2222
a, a+d,a + 2d, a
+ bd . . .
a +In-
1)d
↓
↳ common th
G n terr
difference
first
term
inti =
1; ic =
2n+; i =
i + 2

15. HW : Display this AP - 4,7,10,13,16.. upto ‘n’
terms.
for lint i =
4; ic = 3
4n
+1;i = i+3)
*
7
, 10, 13, 16.... .
S
v
printf("ood", i);
3
3
⑳Ou an = a + (n-1)d
d = 3 an
=
4 + (n-
1)3
=
u + 3n - 3
= 3n + 1

16. Ques : Display this GP - 1,2,4,8,16,32,.. upto ‘n’
terms. x32 *
2
-
GDean = ar"
n-
1
=
c
inta =
1,
for linti=1, i <n; i
+ +) <
printf/"%od", a);
a
=
a+ 2;
3

17. HW : Display this GP - 3,12,48,.. upto ‘n’ terms.

18. Ques : Display this AP - 100,97,94,..upto all
terms which are positive.
100,97,94,91, 88...
-
3 -
3 -
3 an = 100 +
(n-
1)(-
3)
=
100 -
3n + 3
problem - no
of terms-?? :53n
103-3n -0
=>
3n <103
=> n -
10e xc34.33
*
ax = 34

19. Output
-
-
I
10097949188
*
i

20. HW : Display this GP - 100,50,25,.. upto ‘n’
terms.
D
100 50
2312.5 Wat
v V
t 12 12
flo
ta = 100;
for (inti =
1; i <
n;i
+
+) E
-
3

21. Loop ke andar jo bhi daalo
vo sab repeat hota hai !!
for ( x
line 1;
line 2;
line3;
3

22. Break;
& It is used to terminate

23. Ques : WAP to check if a number is prime or
not. 25-composite
Prime - n
S.
eps: 2 to 24
↓
n&1 25%2-X
23%3-X
2. 3, 5, 7, 11, 13, 17, 19,23 2 3%4 +
X
25%350

24. Rounds
- 'Iterations"
J is 2 to 24
23 bear loop
n
=
25 FL
E3Y S
d
1, 3,25
12-1, 2, 3, 4, 6, 12

25. Number - n
I 2 to n-1
-
if(ni = =
00 posite
break;
wait)) + a
=
1,
break;
G if (a = =
0) prime
else composite

26. E
M
↓
is 2 ton-
1
n
=
2
->
i - 2 to 1
W
i =
2 + n-
1
No
n = 1
& i =
2 to 0
R
LoopX

27. Continue; Output
round Ro
I
23
-Skip Karo us
i =
X & BU

28. Ques : WAP to print odd numbers from 1 to
100.
for (int i =
1, i =100; it+
E
if (i%2! =0/2 ll odd
printf((
3
How
work: WAP to
print all the even numbers
from 1 to 100,
using continue statement.

29. While Loop
int i = 0;
while(i<10){
// code
i++;
}
for (inti =1; i < 10; i+ +
2
printf(*%d", i);
3

30. #
te
Loops:
i =
10- 12
O
int i =
1; ->
true
I- I
while 1 -
2
printf("Yodi); -
3
i--;
3

31. Do- While
Loop
do {
//code
} while ( another == 'y' ) ;
-
-
useless
or a
-
3 While (condition);
Semester

32. Predict the output
main( ) {
int j ;
while ( j <= 10 ) {
printf ( "n%d", j ) ;
j = j + 1 ;
}
}
f a
↓
j Random

33. Predict the output
main( ) {
int i = 1 ;
while ( i <= 10 ) ;
{
printf ( "n%d", i ) ;
i++ ;
}
}
17 Output
*
# o (
w
j
I:itis-S
· 6
- 7
·g

34. Predict the output
main( ) {
int x = 1 ;
while ( x == 1 ) {
x = x - 1 ;
printf ( "n%d", x ) ;
}
}
-

35. Predict the output
main( ) {
int x = 4, y, z ;
y = --x ;
z = x-- ;
printf ( "n%d %d %d", x, y, z ) ;
}
2
*
5.2s
-> 3
I
n
=
Y
-n
=
3
- -
M

36. c
+ + 5x =
x +
2; post
+ + x+x = x +
1;pre
x--
=>
x
=
x -
1
- -
m+ x
=
x
-
1

37. Predict the output
main( ) {
int x = 4, y = 3, z ;
z = x-- -y ;
printf ( "n%d %d %d", x, y, z ) ;
}
⑱ NE. OutThe
U 3
. . .
I
O

38. Predict the output
main( ) {
while ( 'a' < 'b' )
printf ( "nmalyalam is a palindrome" ) ;
}
a-> 97b98
Output
o ma.. ↑
o m - -
*
Infinite loop
magalam
I·

39. Predict the output
main( ) {
int i = 10 ;
while ( i = 20 )
printf ( "nA computer buff!" ) ;
}
A
⑩
i
Infinite Loop

40. Predict the output
main( ) {
int i ;
while ( i = 10 ) {
printf ( "n%d", i ) ;
i = i + 1 ;
}
}
10
Output
· 10
N
I·
10
·
10
·
18
·10
Infinite Loop

41. Predict the output
main( ) {
float x = 1.1 ;
while ( x == 1.1 ) {
printf ( "n%f", x ) ;
x = x – 0.1 ;
}
}
⑭Outtat
I

42. Predict the output
main( ) {
while ( '1' < '2' )
printf ( "nIn while loop" ) ;
}
-> Always true
Terminate X
Infinite Loop

43. Predict the output
main( ) {
int x = 4, y = 0, z ;
while ( x >= 0 ) {
x-- ;
y++ ;
if ( x == y )
continue ;
else
printf ( “n%d %d”, x, y ) ;
}
}
&Ng Outtais
I

44. Predict the output
main( ) {
int x = 4, y = 0, z ;
while ( x >= 0 ) {
if ( x == y )
break ;
else
printf ( “n%d %d”, x, y ) ;
x-- ;
y++ ;
}
}
Homework ↓
*

45. Questions using
Operators
+ - * /

46. Ques : WAP to count digits of a given number.
n =
19325
#
tht:1)/ operator
2)19325/10 = 1932
int count =
0;
n =
n/10;
count++;
condition -
40 on

47. Ques : WAP to count digits of a given number.
n
=
15341312/0
Count =
0 && BY
~

48. Ques : WAP to print sum of digits of a given
number. n
=
12345
Sum
=
1 + 2 + 3 + 4 + 5 =
15
#
Hi
13% Operator &
operator
2)
1+ 2+ 3+ 4 + 5 =
5 + 4 + 3 + 2 + 1
sum
=
0 ;
sum = sum + last Digit;
n =
n/10;

49. Ques : WAP to print sum of digits of a given
number. sum =
0;B9 M IS
n
=
S3Y*312X O
ed = n%10; 1rd=
$1p
sum
=
sum + ld; -I
n =
a/l0;

50. HW : WAP to print sum of all the even digits of
a given number.
n = 12345
sum = 2 + 4 = 6
#
Hint Use the same code. (if condition)
-

51. Ques : WAP to print reverse of a given
number. & stone it. n = 1234
v
=
4321
Athm: v
=
w + (4%10)
N 8
v
=
x*10
U
15
up n
=
n/10
t 45450
t 4524320
O 4321
#
Hints condition > n >0
or
2) Abhi 2
gues
n! =
0
2) 10 se
multiply

52. Ques : WAP to print reverse of a given
number. 'Dry Run' n = 5513/0
v
=
0M40935505250
43210
I swap
C v =
0/10;

53. HW : WAP to print the sum of given number
and its reverse.
n =
1234v =
432)
sum = 1234 + 4321 = 5555

54. Ques : Print the sum of this series :
1 - 2 + 3 - 4 + 5 - 6… upto ‘n’.
-
terms
Method-1
- .
#Hint: loop, if-else
if n = 1000 sets
say
then loop will run 1000 times
1 + 2+ 3 +y
...n terms.
d
n

55. Ques : Print the sum of this series :
1 - 2 + 3 - 4 + 5 - 6… upto ‘n’.
(1 -
2+ B -
x) +
(5 -
6) + (7 -
8)
en
=
8
+
+ + + 1 + -
1
= -
Y
n is even, if (n%2 ==
07
sum =
-
n/2;

56. Ques : Print the sum of this series :
1 - 2 + 3 - 4 + 5 - 6… upto ‘n’.
it n is odd -
if (n%2! = 03
n
=
7
x -
2 + B -
x) + (5 -
6) +
E
f
-
1+ -+
-
1 + 7
= -
3 + 7
= -
+
R

57. Ques : Print the factorial of a given number ‘n’.
r
⑭
5) =
5x4x3x2x1 n! -n
factorial
10 =
10x9X8X7X6x5x4x3x2x1
n! = nx(n -
1)x(n -
2)x.... 3x2X1
0! = 1
int product: 1;
for (i= 1; i c
=
n; i + +
product: Producti;

58. Ques : Print the factorial of a given number ‘n’.
product =
xX*6*n
=
5
-
i =
x*M*6

59. HW : Print the factorials of first ‘n’ numbers
Done in Lecture
-
-
n
=
5
n =
nx(n-
1)!
↳
1! = 1
11 =
1
2 = 2x1 =
2
2! = 2x1!
3
=
3x(N=
6
3
=
3x21
u! =
4x3
u
=
uxx1
=
24
5
= Sxy)
5!
=
545x1 = 120 6 =
6x5!

60. Ques : Print the nth fibonacci number.
&
A
15th
1.12358 13 21 3455 89 . . .
12 3 Y56 7 8 9 10 1
8th term = 6th terms + 7th term
tops: 1) 3 variables a
a
=
1; loop(I <
b =
1; sum
=
a +
b;
sum =
0 a =
b;
3b
=
sum;

61. Ques : Print the nth fibonacci number.
8 13 21 sum = a +
b
B A I
B B I
a
=
b
B B b = sum
* ⑳
a b Sum
n
=
6 ↑ 2) - 8th Ferry
n -> (n+ 2)t fibonacci

62. HW : Print first ‘n’ fibonacci numbers.
Output n
=
7
The 1st fibonacci number is 1
The 2a--is I
2
3
S
8
93

63. Ques : Two numbers are entered through the
keyboard. Write a program to find the value of one
number raised to the power of another.
a, b i ab int power=1;
b
= + 2 = 32 for">S
↓ power-power *a;
S
2 - 2 x 2x2x2x2
- 3
5 times

64. Ques : Two numbers are entered through the
keyboard. Write a program to find the value of one
number raised to the power of another.
a =
2, b = 5
power =1***1632
↳
a
Fax
a...
& Eimes
ar -
22,23,2",2,2.. 2
n

65. Ques : Write a program to print all the ASCII values
and their equivalent characters of 26 alphabets
using a while loop. (Capital case)
A + 65
B +
66
C + 67
D - 68
>
·
2 - 90

66. HW : Write a program to print out all Armstrong
numbers between 1 and 500. If sum of cubes of
each digit of the number is equal to the number
itself, then the number is called an Armstrong
number. For example, 153 = ( 1 * 1 * 1 ) + ( 5 * 5 * 5 ) +
( 3 * 3 * 3 )
A
wvΔ
13+ 53 + 33 =
153