SlideShare a Scribd company logo
C- Programming
2. wZbwU msL¨vi †hvMdj wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
1.Start
2. Input n1, n2, m3
3. Sum = n1 + n2 +n3
4. Print sum
5. End
Start
input n1, n2, n3
Sum = n1 + n2 + n3
Print sum
end
#include <stdio.h>
Int main ( )
{
int, num1, num2, num3, sum;
print f (“Enter two numbers”);
scan f (“%d”, &n1 &n2 &n3);
sum = n1 + n2 + n3;
print f (“%dn”, sum);
}
C-Programming
Algorithm Flowchart
1. `ywU msL¨vi †hvMdj wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
1.Start
2. Input num1, num2
3. Sum = num1 + num2
4. Print sum
5. End
Start
input num1, num2
Sum = num1 + num2
Print sum
end
#include <stdio.h>
Int main ( )
{
int, num1, num2, sum;
print f (“Enter two numbers”);
scan f (“%d”, &num1 &num2);
sum = num1 + num2;
print f (“%dn”, sum);
}
C-Programming
Algorithm Flowchart
Written by
Ratul Sir
01303094863
4. wZbwU msL¨vi †hvMdj Mo wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
1.Start
2. Input n1, n2, n3
3. Sum = n1 + n2 + n3
4. Avg = sum/3
4. Print sum
5. End
Start
input n1, n2, n3
Sum = n1 + n2 + n3
Print sum, avg
end
avg =sum/3
#include <stdio.h>
Int main ( )
{
int, num1, num2, sum;
print f (“Enter two numbers”);
scan f (“%d”, &n1 &n2);
sum = n1 + n2;
avg = (float) sum/2;
print f (“%dn”
, sum);
print f (“%fn ”
, avg)
}
C-Programming
Algorithm Flowchart
3. `ywU msL¨vi †hvMdj Mo wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
1.Start
2. Input n1, n2
3. Sum = n1 + n2
4. Avg = sum/2
4. Print sum
5. End
Start
input n1, n2
Sum = n1 + n2
Print sum, avg
end
avg = sum/2
#include <stdio.h>
Int main ( )
{
int, num1, num2, sum;
print f (“Enter two numbers”);
scan f (“%d”, &n1 &n2);
sum = n1 + n2;
avg = (float) sum/2;
print f (“%dn”
, sum);
print f (“%fn ”
, avg)
}
C-Programming
Algorithm Flowchart
Written by
Ratul Sir
01303094863
Written by
Ratul Sir
01303094863
5. GKwU wGf’‡Ri †ÿGdj wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
1.Start
2. Input b, h
3. Area =
1
2
× b × h
4. Print area
5. End
#include <stdio.h>
Int main ( )
{
float, base, height, area;
print f (“Enter base=”);
scan f (“%f ”, &base);
print f (“Enter height=”);
scan f (“%f ”, & height);
area = 0.5× b × h
print f (“%fn ”, area)
}
C-Programming
Algorithm
Start
input b, h
area =
1
2
× b × h
Print , area
end
Flowchart
6. wGf’‡Ri wZbwU evnyi ˆ`N©¨ †`Iqv Av‡Q Zvi †ÿGd‡ji wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
1.Start
2. Input a, b, c
3. i) sum = a+b+c/3
ii) Area of triangle
= sqrt (s*(s-a)*(s-b)*(s-c))
4. Print area of triangle
5. End
#include <stdio.h>
Int main ( )
{
float, sum, area;
print f (“Enter value”);
scan f (“%f %f %f ”, &a &b &c);
sum = (a+b+c)/2
area = sqrt (s*(s-a)*(s-b)*(s-c))
print f (“%fn ”
, area)
}
C-Programming
Algorithm
Start
input a, b, c
sum = a+b+c/3
Print , area of triangle
end
Area of triangle
= sqrt (s*(s-a)*(s-b)*(s-c))
Flowchart
Written by
Ratul Sir
01303094863
7. e‡Ëi †ÿGdj wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
1.Start
2. Input radius
3. Area of circle
=3.1416*r* r
4. Print area of
circle
5. End
#include <stdio.h>
Int main ( )
{
float, radius, area;
print f (“Enter radius”);
scan f (“%f ”, &radius);
area of circle =3.1416*r* r
print f (“%fn ”
, area)
}
C-Programming
Algorithm
Start
input radius
Area of circle
=3.1416*r* r
Print, area of circle
end
Flowchart
8. dv‡ibnvBU †¯‹‡ji ZvcgvGv‡K †mjwmqvm †¯‹‡ji ZvcgvGvq iæcvšÍ‡ii Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
1.Start
2. Input F
3. C =
F−32
9
× 5
4. Print C
5. End
#include <stdio.h>
Int main ( )
{
float, C,F;
print f (“Enter Farhenit”);
scan f (“%f ”, &F);
C =(F-32)/1.8
print f (“%fn ”
, C)
}
C-Programming
Algorithm
Start
input F
C=((F-32)/9)*5
Print C
end
Flowchart
𝐂
𝟓
=
𝐅 − 𝟑𝟐
𝟗
=
𝐊 − 𝟐𝟕𝟑. 𝟏𝟓
𝟓
=
𝐑
𝟒
Written by
Ratul Sir
01303094863
9. ‡mjwmqvm †¯‹‡ji ZvcgvGv‡K dv‡ibnvBU †¯‹‡ji ZvcgvGvq iæcvšÍ‡ii Rb¨ A¨vjMwi`g, †d¬vPvU, wm-
‡cÖvMªvwgs
1.Start
2. Input C
3. F = 𝐶 ×
9
5
+ 32
4. Print C
5. End
#include <stdio.h>
Int main ( )
{
float, C,F;
print f (“Enter Centrigade”);
scan f (“%f ”, &C);
C =(C*1.8)+32
print f (“%fn ”
, F)
}
C-Programming
Algorithm
Start
input C
F= (𝐶 × 9/5)+32
Print F
end
Flowchart
10. ‡Kvb GKwU eY© ¯^ieY© bvwK e¨vÄeY Zv wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
1.Start
2. Input ch
3. If ch ==`a’ or ch ==`A’
or ch == `e’ or ch ==`E’
or ch==`i’ or ch== `I’
or ch==`o’ or ch==`O’
or ch==`u’ or ch==`U’
1.Yes, print vowel
2. No, print consonant
5. End
#include <stdio.h>
Int main ( )
{
float , C,F;
print f (“Enter Centrigade”);
scan f (“%f ”, &C);
C =(C*1.8)+32
print f (“%fn ”, F)
}
C-Programming
Algorithm
Start
input ch
Print consonent
end
Flowchart
ch==`a’|| ch==`A’
||ch==`e’||ch==`E’
||ch==`i’||ch==`I’|
|ch==`o’||ch==`O’
||ch==u’||ch==`U’
No
Yes
Print vowel
Written by
Ratul Sir
01303094863
11. ‡Kvb GKwU eY© ‡QvU bvwK eo Zv wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
C-Programming
Algorithm Flowchart
1. Start
2. Input
3. Is ch>=`A’ and ch<=`Z’
i) Yes, Print Capital
ii) No, goto next step
4. Is ch>=`a’ and ch<=`z’
i) Yes, Print Small
ii) No, Print not a latter
5. End
start
input ch
Ch>=`A’ &
Ch<=`Z’ P.C
Ch>=`A’ &
Ch<=`Z’ P.S
end
print not a latte
#include <stdio.h>
Int main ( )
{
int ch;
print f (“Enter any latter”);
scan f (“%c”, &ch);
if (ch>=`A’ &&ch<=`Z’);
print f (“capital”);
else
if (ch>=`a’ && ch<=`z’);
print f (“small”);
else
print f (“not a latter”);
}
Written by
Ratul Sir
01303094863
12. ‡Kvb GKwU mvj Awael© wKbv Zv wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
C-Programming
Algorithm Flowchart
1. Start
2. Input year
3. If (y%400==0)
Repeat next step
4. If (y%100==0)
and (y%4==0)
5. Print not leap
6. Print Leap Year
7. End
start
input year
is
y%400==0 P.L.Y
is
y%4==0
&&
y%100==0
end
print not Leap year
P.L.Y
#include <stdio.h>
Int main ( )
{
int ch;
print f (“Enter year”);
scan f (“%d”, &year);
if (y%400==0);
print f (“Leap year”);
else
if (y%4==0
&& y%100 !==0 );
print f (“Leap Year”);
else
print f (“not leap year”);
}
Written by
Ratul Sir
01303094863
13. wZbwU msL¨vi g‡a¨ eo msL¨v wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
C-Programming
Algorithm Flowchart
1. Start
2. Input num1, num2, num3
3. Is n1>n2 and n1>n3
(i) Yes, Print n1
(ii) No, goto next step
4. Is n2>n1 and n2>n3
(i) Yes, Print n2
(ii) No, goto next step
5. Is n2>n1 and n2>n3
(i) Yes, Print n3
(ii) No, Print equal
6. End
start
input n1, n2, n3
P.n1
is
n1>n2
&&
n1>n3
end
is
n2>n1
&&
n2>n3
is
n2>n1
&&
n2>n3
P.n2
P.n3
#include <stdio.h>
int main ( )
{
int, n1,n2, n3;
print f (“Enter the three
number”);
scan f (“%d%d%d”,
&n1&n2&n3);
if (n1>n2 && n1>n3);
print f (“%dn
”, n1)
if (n2>n1 && n2>n3);
print f (“%dn
”, n2)
if (n3>n1 && n3>n2);
print f (“%dn
”, n3)
print f (“equal”);
}
Print equal
14. wZbwU msL¨vi g‡a¨ †QvU msL¨v wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
C-Programming
Algorithm Flowchart
1. Start
2. Input num1, num2, num3
3. Is n1<n2 and n1<n3
(i) Yes, Print n1
(ii) No, goto next step
4. Is n2<n1 and n2<n3
(i) Yes, Print n2
(ii) No, goto next step
5. Is n2<n1 and n2<n3
(i) Yes, Print n3
(ii) No, Print equal
6. End
start
input n1, n2, n3
P.n1
is
n1<n2
&&
n1<n3
end
is
n2<n1
&&
n2<n3
is
n2<n1
&&
n2<n3
P.n2
P.n3
#include <stdio.h>
int main ( )
{
int, n1,n2, n3;
print f (“Enter the three
number”);
scan f (“%d%d%d”,
&n1&n2&n3);
if (n1>n2 && n1>n3);
print f (“%dn
”, n1)
if (n2>n1 && n2>n3);
print f (“%dn
”, n2)
if (n3>n1 && n3>n2);
print f (“%dn
”, n3)
print f (“equal”);
}
Written by
Ratul Sir
01303094863
15. 1+2+3+4+ ... ... ... ...+N wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
C-Programming
Algorithm Flowchart
16. 1+2+3+4+ ... ... ... ...+N wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
18. 1+4+7+11+ ... ... ... ...+N wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
17. 1+3+5+7+ ... ... ... ...+N wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
1. Start
2. Input n
3. sum = 0
i =1
4. while i<= n
Repeat next step
5. sum = sum + i
i = i+1
6. Print sum
7. End
start
input ch
P. S
i<=n
end
#include <stdio.h>
int main ( )
{
int i, n, sum;
print f (“Enter n”);
scan f (“%d”, &n);
for (i=1, i<=n’ i++);
{
Sum=sum+i
}
print f (“%dn sum”);
}
sum = 0 , i =1
sum = sum + i
i = i+1
Written by
Ratul Sir
01303094863
19. 1+2+3+4+ ... ... ... ...+100 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
C-Programming
Algorithm Flowchart
20. 5+10+15+20+ ... ... ... ...+200 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
22. 10+16+22+ ... ... ... ...+70 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
21. 10+20+30+ ... ... ... ...+100 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
1. Start
2. Input 100
3. sum = 0
i =1
4. while i<= 100
Repeat next step
5. sum = sum + i
i = i+1
6. Print sum
7. End
start
input 100
P. S
i<=100
end
#include <stdio.h>
int main ( )
{
int i, n, sum;
print f (“Enter ”);
scan f (“%d”, &n);
for (i=1, i<=100’ i++);
{
Sum=sum+i
}
print f (“%dn”, sum)
}
sum = 0 , i =1
sum = 0 , i =1
i = i+1
Written by
Ratul Sir
01303094863
23. 1.5+2.5+3.5+ ... ... ... ...+n wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
C-Programming
Algorithm Flowchart
24. 5.5+10.5+15.5+ ... ... ... ...+100.5 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-
‡cÖvMªvwgs
26. 10.5+16.5+22.5+ ... ... ... ...+70.5 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-
‡cÖvMªvwgs
25. 10.5+20.5+30.5+ ... ... ... ...+100.5 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-
‡cÖvMªvwgs
1. Start
2. Input n
3. sum = 0
i =1.5
4. while i<= n
Repeat next step
5. sum = sum + i
i = i+1
6. Print sum
7. End
start
input n
P. S
i<=n
end
#include <stdio.h>
int main ( )
{
float= i, n, sum;
print f (“Enter any number ”);
scan f (“%f”, &n);
for (i=1, i<=n’ i++);
{
Sum=sum+i
}
print f (“%f n”, sum)
}
sum = 0 , i =1
sum = sum+i
i = i+1
Written by
Ratul Sir
01303094863
27. 12
+22
+32
+ ... ... ... ...+n2
wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
C-Programming
Algorithm Flowchart
28. 52
+102
+152
+202
+ ... ... ... ...+1002
wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-
‡cÖvMªvwgs
30. 102
+162
+222
+ ... ... ... ...+702
wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
29. 102
+202
+302
+ ... ... ... ...+1002
wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
1. Start
2. Input n
3. sum = 0
i = 1
4. while i<= n
Repeat next step
5. sum = sum + i*i
i = i+1
6. Print sum
7. End
start
input n
P. S
i<=n
end
#include <stdio.h>
int main ( )
{
int i, n, sum;
print f (“Enter n”);
scan f (“%d”, &n);
for (i=1, i<=n’ i++);
{
Sum=sum+i*i
}
print f (“%dn”, sum)
}
sum = sum+i*i
i = i+1
sum = 0 , i =1
Written by
Ratul Sir
01303094863
i =1
31. 1 ‡_‡K n ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
C-Programming
Algorithm Flowchart
32. 1 ‡_‡K 100 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
34. 1 ‡_‡K 50 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
33. 1 ‡_‡K 75 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
#include <stdio.h>
int main ( )
{
int i, n;
print f (“Enter n”);
scan f (“%d”, &n);
for (i=1, i<=n’ i++);
print f (“%dn”, i)
}
1. Start
2. Input n
3. sum = 0
i = 1
4. while i<= n
goto next step
5. Print i
6. Update i
7. End
start
input n
i<=n
end
print i
update i
i = 1
35. 1 ‡_‡K 100 ch©šÍ we‡Rvi msL¨v wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
C-Programming
Algorithm Flowchart
36. 1 ‡_‡K 95 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
38. 1 ‡_‡K 50 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
37. 1 ‡_‡K 75 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
#include <stdio.h>
int main ( )
{
int i, n;
print f (“Enter n=100”);
scan f (“%d”, &n);
for (i=1, i<=100’ i+2);
{
print f (“%dn
”, i)
}
}
1. Start
2. Input 100
3. sum = 0
i = 1
4. while i=1, i<= 100, i+2
5. Print sum
6. End
start
input 100
i<=100
end
s = s+i
i = i+2
sum = 0, i =1
Print sum
1| abvZ¥K msL¨v n‡Z n‡e|
2| 1 Ges †h msL¨v‡K wbYq Ki †h mL¨v ev‡` wbt‡k‡l fvMdj hw` †ei nq Zvn‡j †mUv †gŠwjK msL¨v bq|
3| 2 †_‡K g~j msL¨vi Av‡Mi msL¨v w`‡q fvM Ki‡Z n‡e|
39. ‡Kvb GKwU msL¨v †gŠwjK wKbv Zv wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
C-Programming
Algorithm Flowchart
40. 1 ‡_‡K 95 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
42. 1 ‡_‡K 50 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
41. 1 ‡_‡K 75 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
#include <stdio.h>
int main ( )
{
int, i, num, count=0;
print f (“Enter positive
number”);
scan f (“%d”, &num);
for (i=2, i<num, i++);
{
if (num%i==0)
{ count++;
Break;
}
if (count==0)
printf (“prime num”)
}
else
print f (“not prime num”)
}
1. Start
2. Input num
3. i=2, count == 0
4. Is i<num
i) Yes, goto step 5
ii) No, goto step 6
5. Is ( num % i == 0
i) Yes, count++, goto
step6
ii) No, goto step 4
6. Is (count == 0)
i) Yes, print prime
ii) No, print not a prime
6. End
start
input num
i<num
end
count++
i ++
Count ==0, i=2
pp
num
%==0
Count
==0
PNP
1 2 3 4 5
5
2 3 4 5 6 7 8 9 10 11
11
2 3 4 5 6 7 8
8
N
Y
Y
N
43.‡Kvb GKwU (+) bv (Ñ) Zv wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
C-Programming
Algorithm Flowchart
1. Start
2. Input num
3. Is num>0
i) Yes, print possitive
ii) No, goto next step
4. Is num<0
i) Yes, print negative
ii) No, print zero
5. End
start
input num
Print +
num>0
end
num<0 Print -
Print zero
#include <stdio.h>
int main ()
{
int i, n, fact=1;
print f (“Enter any positive
number”);
scan f (“%d”, &n);
for (i=1, i<=n’ i++);
{
fact = fact * i
}
print f (“%dn
”, fact);
}
Y
N
Y
N
Written by
Ratul Sir
01303094863
44.‡Kvb GKwU abvËK c~Y© msL¨vi d¨v±wiqvj wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs
C-Programming
Algorithm Flowchart
1. Start
2. Input n
3. fact =1
i =1
4. while i<= n
Repeat next step
5. fact = fact * i
i = i+1
6. Print fact
7. End
start
input n
P. F
i<=n
end
#include <stdio.h>
int main ()
{
int i, n, fact=1;
print f (“Enter any positive
number”);
scan f (“%d”, &n);
for (i=1, i<=n’ i++);
{
fact = fact * i
}
print f (“%dn ”, fact);
}
fact = fact * i
i = i+1
fact = 1 , i =1
Written by
Ratul Sir
01303094863

More Related Content

PDF
Simple C programs
PPTX
C-LOOP-Session-2.pptx
DOCX
DOC
'C' language notes (a.p)
PDF
C Programming Example
DOCX
DOCX
Best C Programming Solution
Simple C programs
C-LOOP-Session-2.pptx
'C' language notes (a.p)
C Programming Example
Best C Programming Solution

Similar to chapter-5: C-Programming by "Ratul Rana Sir", Ullapara, Sirajganj (20)

PDF
The solution manual of programming in ansi by Robin
DOCX
Practical write a c program to reverse a given number
DOCX
Practical write a c program to reverse a given number
DOCX
Practical File of C Language
PDF
The solution manual of c by robin
DOCX
Lab manual operating system [cs 502 rgpv] (usefulsearch.org) (useful search)
DOCX
Let us C (by yashvant Kanetkar) chapter 3 Solution
PDF
PDF
Progr3
PDF
C lab programs
PDF
C lab programs
DOCX
Bti1022 lab sheet 3
PDF
Unix Programs
PPTX
Tech-1.pptx
PDF
Assignment on Numerical Method C Code
DOCX
C Language Programs
DOCX
Lab loop
PDF
Progr2
DOCX
B.Com 1year Lab programs
PPTX
PROGRAMMING IN C EXAMPLE PROGRAMS FOR NEW LEARNERS - SARASWATHI RAMALINGAM
The solution manual of programming in ansi by Robin
Practical write a c program to reverse a given number
Practical write a c program to reverse a given number
Practical File of C Language
The solution manual of c by robin
Lab manual operating system [cs 502 rgpv] (usefulsearch.org) (useful search)
Let us C (by yashvant Kanetkar) chapter 3 Solution
Progr3
C lab programs
C lab programs
Bti1022 lab sheet 3
Unix Programs
Tech-1.pptx
Assignment on Numerical Method C Code
C Language Programs
Lab loop
Progr2
B.Com 1year Lab programs
PROGRAMMING IN C EXAMPLE PROGRAMS FOR NEW LEARNERS - SARASWATHI RAMALINGAM
Ad

Recently uploaded (20)

PDF
Chinmaya Tiranga quiz Grand Finale.pdf
PDF
O7-L3 Supply Chain Operations - ICLT Program
PPTX
1st Inaugural Professorial Lecture held on 19th February 2020 (Governance and...
PDF
The Lost Whites of Pakistan by Jahanzaib Mughal.pdf
PPTX
master seminar digital applications in india
PDF
3rd Neelam Sanjeevareddy Memorial Lecture.pdf
PPTX
Institutional Correction lecture only . . .
PDF
Black Hat USA 2025 - Micro ICS Summit - ICS/OT Threat Landscape
PPTX
GDM (1) (1).pptx small presentation for students
PDF
Supply Chain Operations Speaking Notes -ICLT Program
PPTX
school management -TNTEU- B.Ed., Semester II Unit 1.pptx
PDF
ANTIBIOTICS.pptx.pdf………………… xxxxxxxxxxxxx
PPTX
human mycosis Human fungal infections are called human mycosis..pptx
PPTX
Final Presentation General Medicine 03-08-2024.pptx
PPTX
Microbial diseases, their pathogenesis and prophylaxis
PDF
Chapter 2 Heredity, Prenatal Development, and Birth.pdf
PPTX
202450812 BayCHI UCSC-SV 20250812 v17.pptx
PDF
A systematic review of self-coping strategies used by university students to ...
PPTX
Cell Types and Its function , kingdom of life
PDF
Saundersa Comprehensive Review for the NCLEX-RN Examination.pdf
Chinmaya Tiranga quiz Grand Finale.pdf
O7-L3 Supply Chain Operations - ICLT Program
1st Inaugural Professorial Lecture held on 19th February 2020 (Governance and...
The Lost Whites of Pakistan by Jahanzaib Mughal.pdf
master seminar digital applications in india
3rd Neelam Sanjeevareddy Memorial Lecture.pdf
Institutional Correction lecture only . . .
Black Hat USA 2025 - Micro ICS Summit - ICS/OT Threat Landscape
GDM (1) (1).pptx small presentation for students
Supply Chain Operations Speaking Notes -ICLT Program
school management -TNTEU- B.Ed., Semester II Unit 1.pptx
ANTIBIOTICS.pptx.pdf………………… xxxxxxxxxxxxx
human mycosis Human fungal infections are called human mycosis..pptx
Final Presentation General Medicine 03-08-2024.pptx
Microbial diseases, their pathogenesis and prophylaxis
Chapter 2 Heredity, Prenatal Development, and Birth.pdf
202450812 BayCHI UCSC-SV 20250812 v17.pptx
A systematic review of self-coping strategies used by university students to ...
Cell Types and Its function , kingdom of life
Saundersa Comprehensive Review for the NCLEX-RN Examination.pdf
Ad

chapter-5: C-Programming by "Ratul Rana Sir", Ullapara, Sirajganj

  • 1. C- Programming 2. wZbwU msL¨vi †hvMdj wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 1.Start 2. Input n1, n2, m3 3. Sum = n1 + n2 +n3 4. Print sum 5. End Start input n1, n2, n3 Sum = n1 + n2 + n3 Print sum end #include <stdio.h> Int main ( ) { int, num1, num2, num3, sum; print f (“Enter two numbers”); scan f (“%d”, &n1 &n2 &n3); sum = n1 + n2 + n3; print f (“%dn”, sum); } C-Programming Algorithm Flowchart 1. `ywU msL¨vi †hvMdj wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 1.Start 2. Input num1, num2 3. Sum = num1 + num2 4. Print sum 5. End Start input num1, num2 Sum = num1 + num2 Print sum end #include <stdio.h> Int main ( ) { int, num1, num2, sum; print f (“Enter two numbers”); scan f (“%d”, &num1 &num2); sum = num1 + num2; print f (“%dn”, sum); } C-Programming Algorithm Flowchart Written by Ratul Sir 01303094863
  • 2. 4. wZbwU msL¨vi †hvMdj Mo wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 1.Start 2. Input n1, n2, n3 3. Sum = n1 + n2 + n3 4. Avg = sum/3 4. Print sum 5. End Start input n1, n2, n3 Sum = n1 + n2 + n3 Print sum, avg end avg =sum/3 #include <stdio.h> Int main ( ) { int, num1, num2, sum; print f (“Enter two numbers”); scan f (“%d”, &n1 &n2); sum = n1 + n2; avg = (float) sum/2; print f (“%dn” , sum); print f (“%fn ” , avg) } C-Programming Algorithm Flowchart 3. `ywU msL¨vi †hvMdj Mo wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 1.Start 2. Input n1, n2 3. Sum = n1 + n2 4. Avg = sum/2 4. Print sum 5. End Start input n1, n2 Sum = n1 + n2 Print sum, avg end avg = sum/2 #include <stdio.h> Int main ( ) { int, num1, num2, sum; print f (“Enter two numbers”); scan f (“%d”, &n1 &n2); sum = n1 + n2; avg = (float) sum/2; print f (“%dn” , sum); print f (“%fn ” , avg) } C-Programming Algorithm Flowchart Written by Ratul Sir 01303094863 Written by Ratul Sir 01303094863
  • 3. 5. GKwU wGf’‡Ri †ÿGdj wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 1.Start 2. Input b, h 3. Area = 1 2 × b × h 4. Print area 5. End #include <stdio.h> Int main ( ) { float, base, height, area; print f (“Enter base=”); scan f (“%f ”, &base); print f (“Enter height=”); scan f (“%f ”, & height); area = 0.5× b × h print f (“%fn ”, area) } C-Programming Algorithm Start input b, h area = 1 2 × b × h Print , area end Flowchart 6. wGf’‡Ri wZbwU evnyi ˆ`N©¨ †`Iqv Av‡Q Zvi †ÿGd‡ji wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 1.Start 2. Input a, b, c 3. i) sum = a+b+c/3 ii) Area of triangle = sqrt (s*(s-a)*(s-b)*(s-c)) 4. Print area of triangle 5. End #include <stdio.h> Int main ( ) { float, sum, area; print f (“Enter value”); scan f (“%f %f %f ”, &a &b &c); sum = (a+b+c)/2 area = sqrt (s*(s-a)*(s-b)*(s-c)) print f (“%fn ” , area) } C-Programming Algorithm Start input a, b, c sum = a+b+c/3 Print , area of triangle end Area of triangle = sqrt (s*(s-a)*(s-b)*(s-c)) Flowchart Written by Ratul Sir 01303094863
  • 4. 7. e‡Ëi †ÿGdj wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 1.Start 2. Input radius 3. Area of circle =3.1416*r* r 4. Print area of circle 5. End #include <stdio.h> Int main ( ) { float, radius, area; print f (“Enter radius”); scan f (“%f ”, &radius); area of circle =3.1416*r* r print f (“%fn ” , area) } C-Programming Algorithm Start input radius Area of circle =3.1416*r* r Print, area of circle end Flowchart 8. dv‡ibnvBU †¯‹‡ji ZvcgvGv‡K †mjwmqvm †¯‹‡ji ZvcgvGvq iæcvšÍ‡ii Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 1.Start 2. Input F 3. C = F−32 9 × 5 4. Print C 5. End #include <stdio.h> Int main ( ) { float, C,F; print f (“Enter Farhenit”); scan f (“%f ”, &F); C =(F-32)/1.8 print f (“%fn ” , C) } C-Programming Algorithm Start input F C=((F-32)/9)*5 Print C end Flowchart 𝐂 𝟓 = 𝐅 − 𝟑𝟐 𝟗 = 𝐊 − 𝟐𝟕𝟑. 𝟏𝟓 𝟓 = 𝐑 𝟒 Written by Ratul Sir 01303094863
  • 5. 9. ‡mjwmqvm †¯‹‡ji ZvcgvGv‡K dv‡ibnvBU †¯‹‡ji ZvcgvGvq iæcvšÍ‡ii Rb¨ A¨vjMwi`g, †d¬vPvU, wm- ‡cÖvMªvwgs 1.Start 2. Input C 3. F = 𝐶 × 9 5 + 32 4. Print C 5. End #include <stdio.h> Int main ( ) { float, C,F; print f (“Enter Centrigade”); scan f (“%f ”, &C); C =(C*1.8)+32 print f (“%fn ” , F) } C-Programming Algorithm Start input C F= (𝐶 × 9/5)+32 Print F end Flowchart 10. ‡Kvb GKwU eY© ¯^ieY© bvwK e¨vÄeY Zv wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 1.Start 2. Input ch 3. If ch ==`a’ or ch ==`A’ or ch == `e’ or ch ==`E’ or ch==`i’ or ch== `I’ or ch==`o’ or ch==`O’ or ch==`u’ or ch==`U’ 1.Yes, print vowel 2. No, print consonant 5. End #include <stdio.h> Int main ( ) { float , C,F; print f (“Enter Centrigade”); scan f (“%f ”, &C); C =(C*1.8)+32 print f (“%fn ”, F) } C-Programming Algorithm Start input ch Print consonent end Flowchart ch==`a’|| ch==`A’ ||ch==`e’||ch==`E’ ||ch==`i’||ch==`I’| |ch==`o’||ch==`O’ ||ch==u’||ch==`U’ No Yes Print vowel Written by Ratul Sir 01303094863
  • 6. 11. ‡Kvb GKwU eY© ‡QvU bvwK eo Zv wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs C-Programming Algorithm Flowchart 1. Start 2. Input 3. Is ch>=`A’ and ch<=`Z’ i) Yes, Print Capital ii) No, goto next step 4. Is ch>=`a’ and ch<=`z’ i) Yes, Print Small ii) No, Print not a latter 5. End start input ch Ch>=`A’ & Ch<=`Z’ P.C Ch>=`A’ & Ch<=`Z’ P.S end print not a latte #include <stdio.h> Int main ( ) { int ch; print f (“Enter any latter”); scan f (“%c”, &ch); if (ch>=`A’ &&ch<=`Z’); print f (“capital”); else if (ch>=`a’ && ch<=`z’); print f (“small”); else print f (“not a latter”); } Written by Ratul Sir 01303094863
  • 7. 12. ‡Kvb GKwU mvj Awael© wKbv Zv wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs C-Programming Algorithm Flowchart 1. Start 2. Input year 3. If (y%400==0) Repeat next step 4. If (y%100==0) and (y%4==0) 5. Print not leap 6. Print Leap Year 7. End start input year is y%400==0 P.L.Y is y%4==0 && y%100==0 end print not Leap year P.L.Y #include <stdio.h> Int main ( ) { int ch; print f (“Enter year”); scan f (“%d”, &year); if (y%400==0); print f (“Leap year”); else if (y%4==0 && y%100 !==0 ); print f (“Leap Year”); else print f (“not leap year”); } Written by Ratul Sir 01303094863
  • 8. 13. wZbwU msL¨vi g‡a¨ eo msL¨v wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs C-Programming Algorithm Flowchart 1. Start 2. Input num1, num2, num3 3. Is n1>n2 and n1>n3 (i) Yes, Print n1 (ii) No, goto next step 4. Is n2>n1 and n2>n3 (i) Yes, Print n2 (ii) No, goto next step 5. Is n2>n1 and n2>n3 (i) Yes, Print n3 (ii) No, Print equal 6. End start input n1, n2, n3 P.n1 is n1>n2 && n1>n3 end is n2>n1 && n2>n3 is n2>n1 && n2>n3 P.n2 P.n3 #include <stdio.h> int main ( ) { int, n1,n2, n3; print f (“Enter the three number”); scan f (“%d%d%d”, &n1&n2&n3); if (n1>n2 && n1>n3); print f (“%dn ”, n1) if (n2>n1 && n2>n3); print f (“%dn ”, n2) if (n3>n1 && n3>n2); print f (“%dn ”, n3) print f (“equal”); } Print equal
  • 9. 14. wZbwU msL¨vi g‡a¨ †QvU msL¨v wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs C-Programming Algorithm Flowchart 1. Start 2. Input num1, num2, num3 3. Is n1<n2 and n1<n3 (i) Yes, Print n1 (ii) No, goto next step 4. Is n2<n1 and n2<n3 (i) Yes, Print n2 (ii) No, goto next step 5. Is n2<n1 and n2<n3 (i) Yes, Print n3 (ii) No, Print equal 6. End start input n1, n2, n3 P.n1 is n1<n2 && n1<n3 end is n2<n1 && n2<n3 is n2<n1 && n2<n3 P.n2 P.n3 #include <stdio.h> int main ( ) { int, n1,n2, n3; print f (“Enter the three number”); scan f (“%d%d%d”, &n1&n2&n3); if (n1>n2 && n1>n3); print f (“%dn ”, n1) if (n2>n1 && n2>n3); print f (“%dn ”, n2) if (n3>n1 && n3>n2); print f (“%dn ”, n3) print f (“equal”); } Written by Ratul Sir 01303094863
  • 10. 15. 1+2+3+4+ ... ... ... ...+N wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs C-Programming Algorithm Flowchart 16. 1+2+3+4+ ... ... ... ...+N wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 18. 1+4+7+11+ ... ... ... ...+N wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 17. 1+3+5+7+ ... ... ... ...+N wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 1. Start 2. Input n 3. sum = 0 i =1 4. while i<= n Repeat next step 5. sum = sum + i i = i+1 6. Print sum 7. End start input ch P. S i<=n end #include <stdio.h> int main ( ) { int i, n, sum; print f (“Enter n”); scan f (“%d”, &n); for (i=1, i<=n’ i++); { Sum=sum+i } print f (“%dn sum”); } sum = 0 , i =1 sum = sum + i i = i+1 Written by Ratul Sir 01303094863
  • 11. 19. 1+2+3+4+ ... ... ... ...+100 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs C-Programming Algorithm Flowchart 20. 5+10+15+20+ ... ... ... ...+200 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 22. 10+16+22+ ... ... ... ...+70 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 21. 10+20+30+ ... ... ... ...+100 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 1. Start 2. Input 100 3. sum = 0 i =1 4. while i<= 100 Repeat next step 5. sum = sum + i i = i+1 6. Print sum 7. End start input 100 P. S i<=100 end #include <stdio.h> int main ( ) { int i, n, sum; print f (“Enter ”); scan f (“%d”, &n); for (i=1, i<=100’ i++); { Sum=sum+i } print f (“%dn”, sum) } sum = 0 , i =1 sum = 0 , i =1 i = i+1 Written by Ratul Sir 01303094863
  • 12. 23. 1.5+2.5+3.5+ ... ... ... ...+n wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs C-Programming Algorithm Flowchart 24. 5.5+10.5+15.5+ ... ... ... ...+100.5 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm- ‡cÖvMªvwgs 26. 10.5+16.5+22.5+ ... ... ... ...+70.5 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm- ‡cÖvMªvwgs 25. 10.5+20.5+30.5+ ... ... ... ...+100.5 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm- ‡cÖvMªvwgs 1. Start 2. Input n 3. sum = 0 i =1.5 4. while i<= n Repeat next step 5. sum = sum + i i = i+1 6. Print sum 7. End start input n P. S i<=n end #include <stdio.h> int main ( ) { float= i, n, sum; print f (“Enter any number ”); scan f (“%f”, &n); for (i=1, i<=n’ i++); { Sum=sum+i } print f (“%f n”, sum) } sum = 0 , i =1 sum = sum+i i = i+1 Written by Ratul Sir 01303094863
  • 13. 27. 12 +22 +32 + ... ... ... ...+n2 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs C-Programming Algorithm Flowchart 28. 52 +102 +152 +202 + ... ... ... ...+1002 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm- ‡cÖvMªvwgs 30. 102 +162 +222 + ... ... ... ...+702 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 29. 102 +202 +302 + ... ... ... ...+1002 wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 1. Start 2. Input n 3. sum = 0 i = 1 4. while i<= n Repeat next step 5. sum = sum + i*i i = i+1 6. Print sum 7. End start input n P. S i<=n end #include <stdio.h> int main ( ) { int i, n, sum; print f (“Enter n”); scan f (“%d”, &n); for (i=1, i<=n’ i++); { Sum=sum+i*i } print f (“%dn”, sum) } sum = sum+i*i i = i+1 sum = 0 , i =1 Written by Ratul Sir 01303094863
  • 14. i =1 31. 1 ‡_‡K n ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs C-Programming Algorithm Flowchart 32. 1 ‡_‡K 100 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 34. 1 ‡_‡K 50 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 33. 1 ‡_‡K 75 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs #include <stdio.h> int main ( ) { int i, n; print f (“Enter n”); scan f (“%d”, &n); for (i=1, i<=n’ i++); print f (“%dn”, i) } 1. Start 2. Input n 3. sum = 0 i = 1 4. while i<= n goto next step 5. Print i 6. Update i 7. End start input n i<=n end print i update i i = 1
  • 15. 35. 1 ‡_‡K 100 ch©šÍ we‡Rvi msL¨v wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs C-Programming Algorithm Flowchart 36. 1 ‡_‡K 95 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 38. 1 ‡_‡K 50 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 37. 1 ‡_‡K 75 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs #include <stdio.h> int main ( ) { int i, n; print f (“Enter n=100”); scan f (“%d”, &n); for (i=1, i<=100’ i+2); { print f (“%dn ”, i) } } 1. Start 2. Input 100 3. sum = 0 i = 1 4. while i=1, i<= 100, i+2 5. Print sum 6. End start input 100 i<=100 end s = s+i i = i+2 sum = 0, i =1 Print sum
  • 16. 1| abvZ¥K msL¨v n‡Z n‡e| 2| 1 Ges †h msL¨v‡K wbYq Ki †h mL¨v ev‡` wbt‡k‡l fvMdj hw` †ei nq Zvn‡j †mUv †gŠwjK msL¨v bq| 3| 2 †_‡K g~j msL¨vi Av‡Mi msL¨v w`‡q fvM Ki‡Z n‡e| 39. ‡Kvb GKwU msL¨v †gŠwjK wKbv Zv wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs C-Programming Algorithm Flowchart 40. 1 ‡_‡K 95 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 42. 1 ‡_‡K 50 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs 41. 1 ‡_‡K 75 ch©šÍ wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs #include <stdio.h> int main ( ) { int, i, num, count=0; print f (“Enter positive number”); scan f (“%d”, &num); for (i=2, i<num, i++); { if (num%i==0) { count++; Break; } if (count==0) printf (“prime num”) } else print f (“not prime num”) } 1. Start 2. Input num 3. i=2, count == 0 4. Is i<num i) Yes, goto step 5 ii) No, goto step 6 5. Is ( num % i == 0 i) Yes, count++, goto step6 ii) No, goto step 4 6. Is (count == 0) i) Yes, print prime ii) No, print not a prime 6. End start input num i<num end count++ i ++ Count ==0, i=2 pp num %==0 Count ==0 PNP 1 2 3 4 5 5 2 3 4 5 6 7 8 9 10 11 11 2 3 4 5 6 7 8 8 N Y Y N
  • 17. 43.‡Kvb GKwU (+) bv (Ñ) Zv wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs C-Programming Algorithm Flowchart 1. Start 2. Input num 3. Is num>0 i) Yes, print possitive ii) No, goto next step 4. Is num<0 i) Yes, print negative ii) No, print zero 5. End start input num Print + num>0 end num<0 Print - Print zero #include <stdio.h> int main () { int i, n, fact=1; print f (“Enter any positive number”); scan f (“%d”, &n); for (i=1, i<=n’ i++); { fact = fact * i } print f (“%dn ”, fact); } Y N Y N Written by Ratul Sir 01303094863
  • 18. 44.‡Kvb GKwU abvËK c~Y© msL¨vi d¨v±wiqvj wbY©‡qi Rb¨ A¨vjMwi`g, †d¬vPvU, wm-‡cÖvMªvwgs C-Programming Algorithm Flowchart 1. Start 2. Input n 3. fact =1 i =1 4. while i<= n Repeat next step 5. fact = fact * i i = i+1 6. Print fact 7. End start input n P. F i<=n end #include <stdio.h> int main () { int i, n, fact=1; print f (“Enter any positive number”); scan f (“%d”, &n); for (i=1, i<=n’ i++); { fact = fact * i } print f (“%dn ”, fact); } fact = fact * i i = i+1 fact = 1 , i =1 Written by Ratul Sir 01303094863