Scribd
Upload
2 views

BCA LAB

The document contains multiple C programs that demonstrate various programming concepts. Programs include checking for Armstrong numbers, finding the largest of three numbers, calculating string length without functions, checking for palindrome numbers, determining prime numbers, calculating the sum of integers, computing factorials, and printing patterns. Each program is self-contained with input prompts and outputs relevant results based on user input.

Uploaded by

lathankp
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

BCA LAB

The document contains multiple C programs that demonstrate various programming concepts. Programs include checking for Armstrong numbers, finding the largest of three numbers, calculating string length without functions, checking for palindrome numbers, determining prime numbers, calculating the sum of integers, computing factorials, and printing patterns. Each program is self-contained with input prompts and outputs relevant results based on user input.

Uploaded by

lathankp
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Program 1:

ARM strong number

#include <stdio.h>
int main() {
int num, originalNum, remainder, result = 0;
printf("Enter a three-digit integer: ");
scanf("%d", &num);
originalNum = num;

while (originalNum != 0) {
remainder = originalNum % 10;

result += remainder * remainder * remainder;


originalNum /= 10;
}

if (result == num)
printf("%d is an Armstrong number.", num);
else
printf("%d is not an Armstrong number.", num);

return 0;
}

Largest among Three numbers


#include <stdio.h>

int main() {

double n1, n2, n3;

printf("Enter three different numbers: ");


scanf("%lf %lf %lf", &n1, &n2, &n3);

// if n1 is greater than both n2 and n3, n1 is the largest


if (n1 >= n2 && n1 >= n3)
printf("%.2f is the largest number.", n1);

// if n2 is greater than both n1 and n3, n2 is the largest


if (n2 >= n1 && n2 >= n3)
printf("%.2f is the largest number.", n2);

// if n3 is greater than both n1 and n2, n3 is the largest


if (n3 >= n1 && n3 >= n2)
printf("%.2f is the largest number.", n3);
return 0;
}

PROGRAM 2:
Find length of string without using string functions
#include <stdio.h>
int main()
{
char s[] = "string length without using string function";
int i;

for (i = 0; s[i] != '\0'; ++i);

printf("Length of the string: %d", i);


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

return 0;
}

Program 3
Prime number
#include <stdio.h>

int main() {

int n, i, flag = 0;
printf("Enter a positive integer: ");
scanf("%d", &n);
if (n == 0 || n == 1)
flag = 1;
for (i = 2; i <= n / 2; ++i) {
if (n % i == 0) {
flag = 1;
break;
}
}
if (flag == 0)
printf("%d is a prime number.", n);
else
printf("%d is not a prime number.", n);

return 0;
}

Sum of (1-10):

#include <stdio.h>
int main()
{
int n, i, sum = 0;
do {
printf("Enter a positive integer: ");
scanf("%d", &n);
} while (n <= 0);

for (i = 1; i <= n; ++i) {


sum += i;
}
printf("Sum = %d", sum);
return 0;
}
Program 4
Factorial of number:
#include <stdio.h>
int main() {
int n, i;
unsigned long long fact = 1;
printf("Enter an integer: ");
scanf("%d", &n);

// shows error if the user enters a negative integer


if (n < 0)
printf("Error! Factorial of a negative number doesn't exist.");
else {
for (i = 1; i <= n; ++i) {
fact *= i;
}
printf("Factorial of %d = %llu", n, fact);
}

return 0;
}

Pyramid pattern of A or *:
#include <stdio.h>
int main() {
int i, j;
char input, alphabet = 'A';
printf("Enter an uppercase character you want to print in the last row: ");
scanf("%c", &input);
for (i = 1; i <= (input - 'A' + 1); ++i) {
for (j = 1; j <= i; ++j) {
printf("%c ", alphabet);
}
++alphabet;
printf("\n");
}
return 0;
}
Or
#include <stdio.h>
int main() {
int i, j, rows;
printf("Enter the number of rows: ");
scanf("%d", &rows);
for (i = 1; i <= rows; ++i) {
for (j = 1; j <= i; ++j) {
printf("* ");
}
printf("\n");
}
return 0;
}

Program5:
Factorial of number:
#include <stdio.h>
int main() {
int n, i;
unsigned long long fact = 1;
printf("Enter an integer: ");
scanf("%d", &n);

// shows error if the user enters a negative integer


if (n < 0)
printf("Error! Factorial of a negative number doesn't exist.");
else {
for (i = 1; i <= n; ++i) {
fact *= i;
}
printf("Factorial of %d = %llu", n, fact);
}

return 0;
}

Print pattern
4
43
432
4321

#include <stdio.h>

int main() {
int rows, i, j;

printf("Enter the number of rows: ");


scanf("%d", &rows);

for (i = 1; i <= rows; i++) {


for (j = rows; j >= i; j--) {
printf("%d ", j);
}
printf("\n");
}

return 0;
}

You might also like