- WAP to Print Hello World
#include <stdio.h>
#include <conio.h>
void main()
{
printf(“Hello World”);
getch();
}
- WAP to Add Two Numbers
#include <stdio.h>
#include <conio.h>
void main()
{
int a=5, b=10, c;
c = a + b;
printf(“Sum = %d”, c);
getch();
}
- WAP to Print Sum of two inputted Numbers
#include <stdio.h>
#include <conio.h>
void main()
{
int a, b, c;
scanf(“%d%d”, &a, &b);
c = a + b;
printf(“Sum = %d”, c);
getch();
}
- WAP to find area of circle
#include <stdio.h>
#include <conio.h>
void main()
{
float r, area;
scanf(“%f”, &r);
area = 3.14 * r * r;
printf(“Area = %f”, area);
getch();
}
- WAP to print simple interest
#include <stdio.h>
#include <conio.h>
void main()
{
float p, t, r, si;
scanf(“%d%d%d”, &p, &t, &r);
si = (p * t * r) / 100;
printf(“Simple Interest = %f”, si);
getch();
}
- WAP to Convert Nepali Rupees to Indian Currency
#include <stdio.h>
#include <conio.h>
void main()
{
float npr, inr;
scanf(“%f”, &npr);
inr = npr / 1.6;
printf(“Indian Rupees = %f”, inr);
getch();
}
- WAP to Convert Fahrenheit to Celsius
#include <stdio.h>
#include <conio.h>
void main()
{
float f, c;
scanf(“%f”, &f);
c = (f – 32) * 5 / 9;
printf(“Celsius = %f”, c);
getch();
}
- WAP to find Greatest among two numbers
#include <stdio.h>
#include <conio.h>
void main()
{
int a, b;
scanf(“%d%d”, &a, &b);
if(a > b)
printf(“Greatest = %d”, a);
else
printf(“Greatest = %d”, b);
getch();
}
- WAP to find Greatest among three numbers
#include <stdio.h>
#include <conio.h>
void main()
{
int a, b, c;
scanf(“%d%d%d”, &a, &b, &c);
if(a > b && a > c)
printf(“Greatest = %d”, a);
else if(b > c)
printf(“Greatest = %d”, b);
else
printf(“Greatest = %d”, c);
getch();
}
- WAP to Check Odd or Even
#include <stdio.h>
#include <conio.h>
void main()
{
int n;
scanf(“%d”, &n);
if(n % 2 == 0)
printf(“Even”);
else
printf(“Odd”);
getch();
}
- WAP to Check Voting eligibility
#include <stdio.h>
#include <conio.h>
void main()
{
int age;
scanf(“%d”, &age);
if(age >= 18)
printf(“Eligible for voting”);
else
printf(“Not eligible”);
getch();
}
- WAP to find inputed number is Divisible by 5 or not
#include <stdio.h>
#include <conio.h>
void main()
{
int n;
scanf(“%d”, &n);
if(n % 5 == 0)
printf(“Divisible by 5”);
else
printf(“Not divisible by 5”);
getch();
}
- WAP to Check inputed number is Zero or Not
#include <stdio.h>
#include <conio.h>
void main()
{
int n;
scanf(“%d”, &n);
if(n == 0)
printf(“Zero”);
else
printf(“Not Zero”);
getch();
}
- WAP to Print 10 Natural Numbers and Sum (for loop)
#include <stdio.h>
#include <conio.h>
void main()
{
int i, sum = 0;
for(i = 1; i <= 10; i++)
{
printf(“%d “, i);
sum += i;
}
printf(“\nSum = %d”, sum);
getch();
}
- WAP to Print 10 Odd Numbers (do-while)
#include <stdio.h>
#include <conio.h>
void main()
{
int i = 1, count = 0;
do
{
printf(“%d “, i);
i += 2;
count++;
} while(count < 10);
getch();
}
- WAP to Print 10 Even Numbers (while)
#include <stdio.h>
#include <conio.h>
void main()
{
int i = 2, count = 0;
while(count < 10)
{
printf(“%d “, i);
i += 2;
count++;
}
getch();
}
- WAP to find Sum of 10 inputted numbers
#include <stdio.h>
#include <conio.h>
void main()
{
int i, n, sum = 0;
for(i = 1; i <= 10; i++)
{
scanf(“%d”, &n);
sum += n;
}
printf(“Sum = %d”, sum);
getch();
}
- WAP to find Factorial of a number
#include <stdio.h>
#include <conio.h>
void main()
{
int n, i, fact = 1;
scanf(“%d”, &n);
for(i = 1; i <= n; i++)
fact = fact*i;
printf(“Factorial = %d”, fact);
getch();
}
- WAP for Multiplication table
#include <stdio.h>
#include <conio.h>
void main()
{
int n, i;
scanf(“%d”, &n);
for(i = 1; i <= 10; i++)
printf(“%d x %d = %d\n”, n, i, n*i);
getch();
}
- WAP to find Fibonacci Series (10 terms)
#include <stdio.h>
#include <conio.h>
void main()
{
int a=1, b=2, c, i;
printf(“%d %d “, a, b);
for(i = 3; i <= 10; i++)
{
c = a + b;
printf(“%d “, c);
a = b;
b = c;
}
getch();
}
- WAP to check whether number is Prime or Composite
#include <stdio.h>
#include <conio.h>
void main()
{
int n, i, count = 0;
scanf(“%d”, &n);
for(i = 1; i <= n; i++)
{
if(n % i == 0)
count++;
}
if(count == 2)
printf(“Prime Number”);
else
printf(“Composite Number”);
getch();
}
- WAP to find Prime Numbers between 1 to 100
#include <stdio.h>
#include <conio.h>
void main()
{
int i, j, count;
for(i = 1; i <= 100; i++)
{
count = 0;
for(j = 1; j <= i; j++)
{
if(i % j == 0)
count++;
}
if(count == 2)
printf(“%d “, i);
}
getch();
}
- WAP to find First 15 Prime Numbers
#include <stdio.h>
#include <conio.h>
void main()
{
int n = 2, count, i, found = 0;
while(found < 15)
{
count = 0;
for(i = 1; i <= n; i++)
{
if(n % i == 0)
count++;
}
if(count == 2)
{
printf(“%d “, n);
found++;
}
n++;
}
getch();
}
- WAP to find Quotient and Remainder
#include <stdio.h>
#include <conio.h>
void main()
{
int a, b;
scanf(“%d%d”, &a, &b);
printf(“Quotient = %d\n”, a / b);
printf(“Remainder = %d”, a % b);
getch();
}
- WAP to count total digits in a number
#include <stdio.h>
#include <conio.h>
void main()
{
int n, count = 0;
scanf(“%d”, &n);
while(n != 0)
{
n = n / 10;
count++;
}
printf(“Total digits = %d”, count);
getch();
}
- WAP to print sum of digits
#include <stdio.h>
#include <conio.h>
void main()
{
int n, sum = 0,r;
scanf(“%d”, &n);
while(n != 0)
{
r = n % 10;
sum = sum + r;
n = n / 10;
}
printf(“Sum of digits = %d”, sum);
getch();
}
- WAP to print reverse of digits
#include <stdio.h>
#include <conio.h>
void main()
{
int n, rev = 0,r;
scanf(“%d”, &n);
while(n != 0)
{
r = n % 10;
rev = rev * 10 + r;
n = n / 10;
}
printf(“Reverse = %d”, rev);
getch();
}
- WAP to check Palindrome number
#include <stdio.h>
#include <conio.h>
void main()
{
int n, temp, rev = 0;
scanf(“%d”, &n);
temp = n;
while(n != 0)
{
r = n % 10;
rev = rev * 10 + r;
n = n / 10;
}
if(temp == rev)
printf(“Palindrome”);
else
printf(“Not Palindrome”);
getch();
}
- WAP to check Armstrong number
#include <stdio.h>
#include <conio.h>
void main()
{
int n, temp, sum = 0, r;
scanf(“%d”, &n);
temp = n;
while(n != 0)
{
r = n % 10;
sum = sum + r * r * r;
n = n / 10;
}
if(temp == sum)
printf(“Armstrong Number”);
else
printf(“Not Armstrong”);
getch();
}
- WAP to print First 10 Palindrome Numbers
#include <stdio.h>
#include <conio.h>
void main()
{
int n = 1, rev, temp, count = 0;
while(count < 10)
{
temp = n;
rev = 0;
while(temp != 0)
{
r = temp % 10;
rev = rev * 10 + r;
temp = temp / 10;
}
if(rev == n)
{
printf(“%d “, n);
count++;
}
n++;
}
getch();
}
- WAP to print Palindrome Numbers between 100 to 500
#include <stdio.h>
#include <conio.h>
void main()
{
int n, temp, rev;
for(n = 100; n <= 500; n++)
{
temp = n;
rev = 0;
while(temp != 0)
{
r = temp % 10;
rev = rev * 10 + r;
temp = temp / 10;
}
if(rev == n)
printf(“%d “, n);
}
getch();
}
- WAP to find HCF and LCM of two numbers
#include <stdio.h>
#include <conio.h>
void main()
{
int a, b, i, hcf, lcm;
scanf(“%d%d”, &a, &b);
for(i = 1; i <= a && i <= b; i++)
{
if(a % i == 0 && b % i == 0)
hcf = i;
}
lcm = (a * b) / hcf;
printf(“HCF = %d\nLCM = %d”, hcf, lcm);
getch();
}
- WAP to find HCF and LCM using Built-in Function
#include <stdio.h>
#include <conio.h>
#include <math.h>
void main()
{
int a, b, hcf, lcm;
scanf(“%d%d”, &a, &b);
hcf = __gcd(a, b);
lcm = (a * b) / hcf;
printf(“HCF = %d\nLCM = %d”, hcf, lcm);
getch();
}
SERIES PROGRAMS
- i) 5, 10, 15, … 50
#include <stdio.h>
#include <conio.h>
void main()
{
int i;
for(i = 5; i <= 50; i += 5)
printf(“%d “, i);
getch();
}
- ii) 5, 10, 15, … up to 50th term
#include <stdio.h>
#include <conio.h>
void main()
{
int i;
for(i = 1; i <= 50; i++)
printf(“%d “, i*5);
getch();
}
iii) 1, 2, 4, 8, 16 … (10 terms)
#include <stdio.h>
#include <conio.h>
void main()
{
int i, n = 1;
for(i = 1; i <= 10; i++)
{
printf(“%d “, n);
n *= 2;
}
getch();
}
- iv) 999, 728, 511 … (10 terms)
#include <stdio.h>
#include <conio.h>
void main()
{
int i, n = 999;
for(i = 1; i <= 10; i++)
{
printf(“%d “, n);
n -= 271;
}
getch();
}
- v) Fibonacci Series (10 terms)
#include <stdio.h>
#include <conio.h>
void main()
{
int a=1, b=2, c, i;
printf(“%d %d “, a, b);
for(i = 3; i <= 10; i++)
{
c = a + b;
printf(“%d “, c);
a = b;
b = c;
}
getch();
}
- vi) Pattern
1
22
333
4444
55555
#include <stdio.h>
#include <conio.h>
void main()
{
int i, j;
for(i = 1; i <= 5; i++)
{
for(j = 1; j <= i; j++)
printf(“%d”, i);
printf(“\n”);
}
getch();
}



