KEMBAR78
C Part-5 Loop Based Programs All Solutions | PDF | Mathematics | Computer Science
Scribd
Upload
30 views9 pages

C Part-5 Loop Based Programs All Solutions

The document contains a series of C programming exercises, each demonstrating different programming concepts such as loops, conditionals, and arithmetic operations. It includes tasks like printing numbers, calculating sums, checking for prime and perfect numbers, and converting binary to decimal. Each exercise is accompanied by its corresponding C code implementation.

Uploaded by

anujbhandari400
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
30 views9 pages

C Part-5 Loop Based Programs All Solutions

The document contains a series of C programming exercises, each demonstrating different programming concepts such as loops, conditionals, and arithmetic operations. It includes tasks like printing numbers, calculating sums, checking for prime and perfect numbers, and converting binary to decimal. Each exercise is accompanied by its corresponding C code implementation.

Uploaded by

anujbhandari400
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 9

1.

Print numbers from 1 to 10


#include <stdio.h>
int main() {
for (int i = 1; i <= 10; i++) {
printf("%d ", i);
}
return 0;
}

2. Print numbers from 10 to 1


#include <stdio.h>
int main() {
for (int i = 10; i >= 1; i--) {
printf("%d ", i);
}
return 0;
}

3. Print the first N natural numbers


#include <stdio.h>
int main() {
int N;
printf("Enter N: ");
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
printf("%d ", i);
}
return 0;
}

4. Print the sum of the first N natural numbers


#include <stdio.h>
int main() {
int N, sum = 0;
printf("Enter N: ");
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
sum += i;
}
printf("Sum: %d\n", sum);
return 0;
}

5. Print the sum of all even numbers up to N


#include <stdio.h>
int main() {
int N, sum = 0;
printf("Enter N: ");
scanf("%d", &N);
for (int i = 2; i <= N; i += 2) {
Compiled By: Er.Gaurab Mishra (HOD, COMPUTER)
k.m.c college, BagBazar
sum += i;
}
printf("Sum of even numbers: %d\n", sum);
return 0;
}

6. Print the sum of all odd numbers up to N


#include <stdio.h>
int main() {
int N, sum = 0;
printf("Enter N: ");
scanf("%d", &N);
for (int i = 1; i <= N; i += 2) {
sum += i;
}
printf("Sum of odd numbers: %d\n", sum);
return 0;
}

7. Calculate the factorial of a given number


#include <stdio.h>
int main() {
int N, fact = 1;
printf("Enter a number: ");
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
fact *= i;
}
printf("Factorial: %d\n", fact);
return 0;
}

8. Calculate the factors of a number


#include <stdio.h>
int main() {
int N;
printf("Enter a number: ");
scanf("%d", &N);
printf("Factors: ");
for (int i = 1; i <= N; i++) {
if (N % i == 0) {
printf("%d ", i);
}
}
return 0;
}

9. Print the multiplication table of a number


#include <stdio.h>
int main() {
int N;
printf("Enter a number: ");
Compiled By: Er.Gaurab Mishra (HOD, COMPUTER)
k.m.c college, BagBazar
scanf("%d", &N);
for (int i = 1; i <= 10; i++) {
printf("%d × %d = %d\n", N, i, N * i);
}
return 0;
}

10. Print all multiples of 5 between 1 and N


#include <stdio.h>
int main() {
int N;
printf("Enter N: ");
scanf("%d", &N);
printf("Multiples of 5: ");
for (int i = 5; i <= N; i += 5) {
printf("%d ", i);
}
return 0;
}

11. Count the number of digits in a number


#include <stdio.h>
int main() {
int N, count = 0;
printf("Enter a number: ");
scanf("%d", &N);
while (N != 0) {
N /= 10;
count++;
}
printf("Number of digits: %d\n", count);
return 0;
}

12. Check whether the given number is a palindrome


#include <stdio.h>
int main() {
int N, original, reversed = 0, remainder;
printf("Enter a number: ");
scanf("%d", &N);
original = N;
while (N != 0) {
remainder = N % 10;
reversed = reversed * 10 + remainder;
N /= 10;
}
if (original == reversed)
printf("Palindrome\n");
else
printf("Not a palindrome\n");
return 0;
}

Compiled By: Er.Gaurab Mishra (HOD, COMPUTER)


k.m.c college, BagBazar
13. Check whether the given number is an Armstrong number
#include <stdio.h>
#include <math.h>
int main() {
int N, original, remainder, result = 0, count = 0;
printf("Enter a number: ");
scanf("%d", &N);
original = N;

// Count number of digits


int temp = N;
while (temp != 0) {
temp /= 10;
count++;
}

// Compute sum of nth power of digits


temp = N;
while (temp != 0) {
remainder = temp % 10;
result += pow(remainder, count);
temp /= 10;
}

if (original == result)
printf("Armstrong number\n");
else
printf("Not an Armstrong number\n");

return 0;
}

14. Print the sum of digits of a number


#include <stdio.h>
int main() {
int N, sum = 0, remainder;
printf("Enter a number: ");
scanf("%d", &N);

while (N != 0) {
remainder = N % 10;
sum += remainder;
N /= 10;
}

printf("Sum of digits: %d\n", sum);


return 0;
}

15. Reverse the digits of a number (e.g., 123 -> 321)


#include <stdio.h>
int main() {
int N, reversed = 0, remainder;
printf("Enter a number: ");
Compiled By: Er.Gaurab Mishra (HOD, COMPUTER)
k.m.c college, BagBazar
scanf("%d", &N);

while (N != 0) {
remainder = N % 10;
reversed = reversed * 10 + remainder;
N /= 10;
}

printf("Reversed number: %d\n", reversed);


return 0;
}

16. Check if a number is an Armstrong number (using a loop for digit processing)
#include <stdio.h>
#include <math.h>
int main() {
int N, original, remainder, result = 0, count = 0;
printf("Enter a number: ");
scanf("%d", &N);
original = N;

// Count number of digits


int temp = N;
while (temp != 0) {
temp /= 10;
count++;
}

// Compute sum of nth power of digits


temp = N;
while (temp != 0) {
remainder = temp % 10;
result += pow(remainder, count);
temp /= 10;
}

if (original == result)
printf("Armstrong number\n");
else
printf("Not an Armstrong number\n");

return 0;
}

17. Generate the first N terms of the Fibonacci sequence


#include <stdio.h>
int main() {
int N, first = 0, second = 1, next;
printf("Enter N: ");
scanf("%d", &N);

printf("Fibonacci sequence: ");


for (int i = 0; i < N; i++) {
printf("%d ", first);
next = first + second;
first = second;
second = next;
}
Compiled By: Er.Gaurab Mishra (HOD, COMPUTER)
k.m.c college, BagBazar
return 0;
}

18. Calculate the sum of the first N terms of the Fibonacci series
#include <stdio.h>
int main() {
int N, first = 0, second = 1, next, sum = 0;
printf("Enter N: ");
scanf("%d", &N);

for (int i = 0; i < N; i++) {


sum += first;
next = first + second;
first = second;
second = next;
}

printf("Sum of first %d Fibonacci terms: %d\n", N, sum);


return 0;
}

19. Print all prime numbers up to N


#include <stdio.h>
int main() {
int N, i, j, isPrime;
printf("Enter N: ");
scanf("%d", &N);

printf("Prime numbers up to %d: ", N);


for (i = 2; i <= N; i++) {
isPrime = 1; // Assume number is prime
for (j = 2; j * j <= i; j++) {
if (i % j == 0) {
isPrime = 0;
break;
}
}
if (isPrime)
printf("%d ", i);
}
return 0;
}

20.Find the Greatest Common Divisor (GCD) of two numbers using a loop
#include <stdio.h>
int main() {
int a, b, gcd;
printf("Enter two numbers: ");
scanf("%d %d", &a, &b);

for (int i = 1; i <= a && i <= b; i++) {


if (a % i == 0 && b % i == 0)
gcd = i;
Compiled By: Er.Gaurab Mishra (HOD, COMPUTER)
k.m.c college, BagBazar
}

printf("GCD: %d\n", gcd);


return 0;
}

21. Find the Least Common Multiple (LCM) of two numbers using a loop
#include <stdio.h>
int main() {
int a, b, lcm;
printf("Enter two numbers: ");
scanf("%d %d", &a, &b);

lcm = (a > b) ? a : b;

while (1) {
if (lcm % a == 0 && lcm % b == 0) {
printf("LCM: %d\n", lcm);
break;
}
lcm++;
}

return 0;
}

22. Calculate the power of a number without using the pow() function
#include <stdio.h>
int main() {
int a, b, result = 1;
printf("Enter base and exponent: ");
scanf("%d %d", &a, &b);

for (int i = 0; i < b; i++) {


result *= a;
}

printf("Result: %d\n", result);


return 0;
}

23. Count how many numbers between 1 and N are divisible by 3 or 5


#include <stdio.h>
int main() {
int N, count = 0;
printf("Enter N: ");
scanf("%d", &N);

for (int i = 1; i <= N; i++) {


if (i % 3 == 0 || i % 5 == 0)
count++;
}

printf("Count: %d\n", count);


return 0;
Compiled By: Er.Gaurab Mishra (HOD, COMPUTER)
k.m.c college, BagBazar
}

24. Check if a number is a perfect number

(A perfect number is a number whose sum of factors, excluding itself, equals the number.)

#include <stdio.h>
int main() {
int N, sum = 0;
printf("Enter a number: ");
scanf("%d", &N);

for (int i = 1; i < N; i++) {


if (N % i == 0)
sum += i;
}

if (sum == N)
printf("%d is a Perfect Number\n", N);
else
printf("%d is not a Perfect Number\n", N);

return 0;
}

25. Print all perfect numbers up to N


#include <stdio.h>
int main() {
int N, sum;
printf("Enter N: ");
scanf("%d", &N);

printf("Perfect numbers up to %d: ", N);


for (int num = 1; num <= N; num++) {
sum = 0;
for (int i = 1; i < num; i++) {
if (num % i == 0)
sum += i;
}
if (sum == num)
printf("%d ", num);
}

return 0;
}

26. Find the sum of squares of the first N natural numbers


#include <stdio.h>
int main() {
int N, sum = 0;
printf("Enter N: ");
scanf("%d", &N);

for (int i = 1; i <= N; i++) {


sum += i * i;

Compiled By: Er.Gaurab Mishra (HOD, COMPUTER)


k.m.c college, BagBazar
}

printf("Sum of squares: %d\n", sum);


return 0;
}

27. Find the sum of cubes of the first N natural numbers


#include <stdio.h>
int main() {
int N, sum = 0;
printf("Enter N: ");
scanf("%d", &N);

for (int i = 1; i <= N; i++) {


sum += i * i * i;
}

printf("Sum of cubes: %d\n", sum);


return 0;
}

28. Print the decimal equivalent of a binary number (e.g., input binary 101 -> output
decimal 5)
#include <stdio.h>
#include <math.h>
int main() {
int binary, decimal = 0, remainder, power = 0;
printf("Enter a binary number: ");
scanf("%d", &binary);

while (binary != 0) {
remainder = binary % 10;
decimal += remainder * pow(2, power);
binary /= 10;
power++;
}

printf("Decimal equivalent: %d\n", decimal);


return 0;
}

Compiled By: Er.Gaurab Mishra (HOD, COMPUTER)


k.m.c college, BagBazar

You might also like