Scribd
Upload
4 views

Practical-2

Uploaded by

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

Practical-2

Uploaded by

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

Q1: WAP to find the sum of two numbers.

Answer:

#include <stdio.h>
int main() {
int num1, num2, sum;
printf("Enter two numbers: ");
scanf("%d %d", &num1, &num2);
sum = num1 + num2;
printf("Sum: %d\n", sum);
return 0;
}

Q2: WAP to check if a number is prime.

Answer:

#include <stdio.h>

int main() {
int num, i, flag = 0;
printf("Enter a number: ");
scanf("%d", &num);

for(i = 2; i <= num/2; ++i) {


if(num % i == 0) {
flag = 1;
break;
}
}

if(flag == 0)
printf("%d is a prime number.\n", num);
else
printf("%d is not a prime number.\n", num);
return 0;
}

Q3: WAP to find the factorial of a number.

Answer:

#include <stdio.h>

int main() {
int i, n, t1 = 0, t2 = 1, nextTerm;
printf("Enter the number of terms: ");
scanf("%d", &n);

printf("Fibonacci Series: ");


for(i = 1; i <= n; ++i) {
if(i == 1) {
printf("%d, ", t1);
continue;
}
if(i == 2) {
printf("%d, ", t2);
continue;
}
nextTerm = t1 + t2;
t1 = t2;
t2 = nextTerm;
printf("%d, ", nextTerm);
}
printf("\n");
return 0;
}

Q4: WAP to reverse a given number.

Answer:

#include <stdio.h>

int main() {
int num, reversed = 0, remainder;
printf("Enter a number: ");
scanf("%d", &num);

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

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


return 0;
}

Q5: WAP to check if a number is an Armstrong


number.

Answer:

#include <stdio.h>

int factorial(int n) {
int fact = 1;
for(int i = 1; i <= n; ++i) {
fact *= i;
}
return fact;
}

int main() {
int num;
printf("Enter a number: ");
scanf("%d", &num);

printf("Factorial of %d: %d\n", num, factorial(num));


return 0;
}

Q6: WAP to check if a number is a palindrome.

Answer:

#include <stdio.h>

int main() {
int num, sum = 0, remainder, temp;
printf("Enter a number: ");
scanf("%d", &num);

temp = num;
while (temp != 0) {
remainder = temp % 10;
sum += remainder * remainder * remainder;
temp /= 10;
}

if(sum == num)
printf("%d is an Armstrong number.\n", num);
else
printf("%d is not an Armstrong number.\n", num);
return 0;
}
Q7: WAP to print a simple pattern of stars (e.g.,
triangle pattern).

Answer:

#include <stdio.h>

int main() {
int rows;
printf("Enter number of rows: ");
scanf("%d", &rows);

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


for(int j = 1; j <= rows - i; ++j)
printf(" ");
for(int j = 1; j <= (2*i - 1); ++j)
printf("*");
printf("\n");
}
return 0;
}

Q8: WAP to print a square pattern of stars.

Answer:

#include <stdio.h>
int main() {
int num1, num2, num3;
printf("Enter three numbers: ");
scanf("%d %d %d", &num1, &num2, &num3);

if(num1 >= num2 && num1 >= num3)


printf("%d is the largest number.\n", num1);
else if(num2 >= num1 && num2 >= num3)
printf("%d is the largest number.\n", num2);
else
printf("%d is the largest number.\n", num3);
return 0;
}

Q9: WAP to print the Fibonacci series up to n


terms.

Answer:

#include <stdio.h>

int main() {
int num, sum = 0, remainder;
printf("Enter a number: ");
scanf("%d", &num);

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

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


return 0;
}

Q10: WAP to implement an array of integers and


find the sum of even numbers in the array.

Answer:

#include <stdio.h>

struct Student {
char name[100];
int roll_no;
float marks;
};

int main() {
struct Student s;

printf("Enter name: ");


scanf("%s", s.name);
printf("Enter roll number: ");
scanf("%d", &s.roll_no);
printf("Enter marks: ");
scanf("%f", &s.marks);

printf("\nStudent Information:\n");
printf("Name: %s\n", s.name);
printf("Roll No: %d\n", s.roll_no);
printf("Marks: %.2f\n", s.marks);
return 0;
}

Q11: WAP to create a structure to store and


display student information (name, roll number,
marks).

Answer:

#include <stdio.h>

int main() {
int arr[5], sum = 0;
printf("Enter 5 integers: ");
for(int i = 0; i < 5; ++i)
scanf("%d", &arr[i]);

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


if(arr[i] % 2 == 0)
sum += arr[i];
}
printf("Sum of even numbers: %d\n", sum);
return 0;
}

Q12: WAP to create a union to store and display


different data types (e.g., integer, float,
character).

Answer:

#include <stdio.h>

union Data {
int i;
float f;
char c;
};

int main() {
union Data data;

printf("Enter an integer: ");


scanf("%d", &data.i);
printf("Integer: %d\n", data.i);

printf("Enter a float: ");


scanf("%f", &data.f);
printf("Float: %.2f\n", data.f);
printf("Enter a character: ");
scanf(" %c", &data.c);
printf("Character: %c\n", data.c);

return 0;
}

Q13: WAP to find the sum of digits of a number.

Answer:

#include <stdio.h>

int main() {
char str[100];
int vowels = 0, consonants = 0;
printf("Enter a string: ");
scanf("%s", str);

for(int i = 0; str[i] != '\0'; ++i) {


if(str[i] == 'a' || str[i] == 'e' || str[i] == 'i' || str[i] == 'o' || str[i]
== 'u' ||
str[i] == 'A' || str[i] == 'E' || str[i] == 'I' || str[i] == 'O' || str[i]
== 'U') {
++vowels;
} else {
++consonants;
}
}
printf("Vowels: %d\n", vowels);
printf("Consonants: %d\n", consonants);
return 0;
}

Q14: WAP to find the largest of three numbers


using a simple function.

Answer:

#include <stdio.h>

int main() {
int num, reversed = 0, remainder, original;
printf("Enter a number: ");
scanf("%d", &num);

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

if(original == reversed)
printf("%d is a palindrome number.\n", original);
else
printf("%d is not a palindrome number.\n", original);
return 0;
}

Q15: WAP to implement a simple function to check


whether a given character is a vowel or consonant.

Answer:

#include <stdio.h>

void swap(int *x, int *y) {


int temp = *x;
*x = *y;
*y = temp;
}

int main() {
int num1, num2;
printf("Enter two numbers: ");
scanf("%d %d", &num1, &num2);

swap(&num1, &num2);

printf("After swapping: num1 = %d, num2 = %d\n", num1, num2);


return 0;
}

You might also like