LIST OF PROGRAM-WPS Office
LIST OF PROGRAM-WPS Office
1. Swap two numbers (using a third variable and without a third variable)
#include <stdio.h>
int main() {
int a, b, temp;
temp = a;
a = b;
b = temp;
return 0;
#include <stdio.h>
int main() {
int a, b;
a = a + b;
b = a - b;
a = a - b;
#include <stdio.h>
int main() {
} else {
return 0;
#include <stdio.h>
int main() {
int choice;
scanf("%d", &choice);
if (choice == 1) {
} else if (choice == 2) {
scanf("%f", &temp);
} else {
printf("Invalid choice!\n");
return 0;
#include <stdio.h>
int main() {
char ch;
scanf("%c", &ch);
return 0;
#include <stdio.h>
#include <math.h>
int main() {
scanf("%f", &principal);
scanf("%f", &rate);
scanf("%f", &time);
return 0;
#include <stdio.h>
int main() {
int num;
scanf("%d", &num);
if (num % 2 == 0)
printf("Even\n");
else
printf("Odd\n");
return 0;
#include <stdio.h>
int main() {
int num;
scanf("%d", &num);
if (num > 0)
printf("Positive\n");
printf("Negative\n");
else
printf("Zero\n");
return 0;
#include <stdio.h>
int main() {
int a, b, c;
else
return 0;
#include <stdio.h>
int main() {
int year;
scanf("%d", &year);
printf("Leap Year\n");
else
return 0;
#include <stdio.h>
int main() {
int num;
scanf("%d", &num);
if (num % 5 == 0 && num % 11 == 0)
else
return 0;
#include <stdio.h>
int main() {
char ch;
printf("Vowel\n");
else
printf("Consonant\n");
return 0;
#include <stdio.h>
int main() {
int age;
printf("Eligible to vote\n");
else
return 0;
#include <stdio.h>
int main() {
int marks;
scanf("%d", &marks);
printf("Grade: A\n");
printf("Grade: B\n");
printf("Grade: C\n");
printf("Grade: D\n");
printf("Grade: E\n");
else
printf("Grade: F\n");
return 0;
#include <stdio.h>
int main() {
int n, i;
printf("Enter N: ");
scanf("%d", &n);
printf("\n");
return 0;
#include <stdio.h>
int main() {
int n, sum = 0, i;
printf("Enter N: ");
scanf("%d", &n);
sum += i;
return 0;
#include <stdio.h>
int main() {
printf("Enter N: ");
scanf("%d", &n);
if (i % 2 == 0)
evenSum += i;
else
oddSum += i;
return 0;
#include <stdio.h>
int main() {
int n, i;
scanf("%d", &n);
return 0;
#include <stdio.h>
int main() {
int n, i;
scanf("%d", &n);
fact *= i;
return 0;
#include <stdio.h>
int main() {
int n, i, a = 0, b = 1, next;
scanf("%d", &n);
next = a + b;
a = b;
b = next;
printf("\n");
return 0;
}
20. Check if a number is prime
#include <stdio.h>
int main() {
int n, i, flag = 1;
scanf("%d", &n);
if (n <= 1)
flag = 0;
if (n % i == 0) {
flag = 0;
break;
if (flag)
printf("Prime\n");
else
printf("Not Prime\n");
return 0;
#include <stdio.h>
int main() {
int n, sum = 0;
scanf("%d", &n);
while (n > 0) {
sum += n % 10;
n /= 10;
return 0;
#include <stdio.h>
int main() {
int n, rev = 0;
scanf("%d", &n);
while (n > 0) {
n /= 10;
return 0;
#include <stdio.h>
int main() {
scanf("%d", &n);
temp = n;
temp /= 10;
if (n == rev)
printf("Palindrome\n");
else
printf("Not Palindrome\n");
return 0;
#include <stdio.h>
int main() {
x = a;
y = b;
while (y != 0) {
int temp = y;
y = x % y;
x = temp;
gcd = x;
lcm = (a * b) / gcd;
printf("GCD = %d\nLCM = %d\n", gcd, lcm);
return 0;
#include <stdio.h>
int main() {
temp = num;
sum = 0;
digits = 0;
temp /= 10;
digits++;
temp = num;
int power = 1, i;
power *= remainder;
sum += power;
temp /= 10;
if (sum == num)
printf("\n");
return 0;
#include <stdio.h>
int main() {
scanf("%d", &n);
int arr[n];
scanf("%d", &arr[i]);
max = arr[i];
min = arr[i];
return 0;
int main() {
int n, i;
scanf("%d", &n);
int arr[n];
scanf("%d", &arr[i]);
printf("\n");
return 0;
#include <stdio.h>
int main() {
int n, i, j, temp;
scanf("%d", &n);
int arr[n];
temp = arr[j];
arr[j + 1] = temp;
printf("\n");
return 0;
#include <stdio.h>
int main() {
int n, i, sum = 0;
float avg;
scanf("%d", &n);
int arr[n];
scanf("%d", &arr[i]);
sum += arr[i];
avg = (float)sum / n;
return 0;
#include <stdio.h>
int main() {
scanf("%d", &n);
int arr[n];
scanf("%d", &arr[i]);
scanf("%d", &key);
if (arr[i] == key) {
found = 1;
break;
}
}
if (found)
else
return 0;
int main() {
int n, i, key;
printf("Enter the number of elements: ");
scanf("%d", &n);
int arr[n];
printf("Enter %d sorted elements: ", n);
for (i = 0; i < n; i++)
scanf("%d", &arr[i]);
printf("Enter the element to search: ");
scanf("%d", &key);
int result = binarySearch(arr, n, key);
if (result != -1)
printf("Element found at index %d\n", result);
else
printf("Element not found\n");
return 0;
}
#include <stdio.h>
int main() {
scanf("%d", &n1);
int arr1[n1];
scanf("%d", &arr1[i]);
scanf("%d", &n2);
scanf("%d", &arr2[i]);
i = j = k = 0;
merged[k++] = arr1[i++];
else
merged[k++] = arr2[j++];
}
while (i < n1)
merged[k++] = arr1[i++];
merged[k++] = arr2[j++];
printf("\n");
return 0;
32. Find the second largest and second smallest elements in an array
#include <stdio.h>
int main() {
int n, i;
scanf("%d", &n);
int arr[n];
scanf("%d", &arr[i]);
return 0;
#include <stdio.h>
int main() {
char str[100];
int i = 0;
gets(str);
i++;
return 0;
#include <stdio.h>
#include <string.h>
int main() {
gets(str);
j = strlen(str) - 1;
temp = str[i];
str[i] = str[j];
str[j] = temp;
return 0;
#include <stdio.h>
#include <string.h>
int main() {
char str[100];
int i, j, flag = 1;
gets(str);
j = strlen(str) - 1;
if (str[i] != str[j]) {
flag = 0;
break;
}
if (flag)
printf("Palindrome\n");
else
printf("Not a palindrome\n");
return 0;
#include <stdio.h>
int main() {
char str[100];
gets(str);
char ch = str[i];
if ((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z')) {
vowels++;
else
consonants++;
#include <stdio.h>
int main() {
char str[100];
int i;
gets(str);
str[i] -= 32;
str[i] += 32;
return 0;
#include <stdio.h>
#include <string.h>
int main() {
char str[100];
gets(str);
for (i = 0; str[i] != '\0'; i++)
freq[(int)str[i]]++;
printf("Character frequencies:\n");
if (freq[i] > 0)
return 0;
#include <stdio.h>
int main() {
char str[100];
int i, count = 1;
gets(str);
if (str[i] == ' ' && str[i + 1] != ' ' && str[i + 1] != '\0')
count++;
return 0;
#include <stdio.h>
int factorial(int n) {
int fact = 1;
fact *= i;
return fact;
int main() {
int num;
scanf("%d", &num);
return 0;
#include <stdio.h>
int isPrime(int n) {
if (n < 2)
return 0;
if (n % i == 0)
return 0;
return 1;
int main() {
int num;
scanf("%d", &num);
if (isPrime(num))
printf("Prime\n");
else
printf("Not Prime\n");
return 0;
#include <stdio.h>
*a = *b;
*b = temp;
int main() {
int x, y;
swap(&x, &y);
return 0;
int fibonacci(int n) {
if (n <= 1)
return n;
int main() {
int n;
scanf("%d", &n);
return 0;
#include <stdio.h>
int result = 1;
result *= base;
return result;
int main() {
return 0;
#include <stdio.h>
int sumOfDigits(int n) {
int sum = 0;
while (n > 0) {
sum += n % 10;
n /= 10;
return sum;
int main() {
int num;
scanf("%d", &num);
return 0;
#include <stdio.h>
void decimalToBinary(int n) {
if (n > 0) {
decimalToBinary(n / 2);
printf("%d", n % 2);
int main() {
int num;
scanf("%d", &num);
if (num == 0)
printf("0");
else
decimalToBinary(num);
return 0;
#include <stdio.h>
*a = *b;
*b = temp;
int main() {
int x, y;
swap(&x, &y);
printf("After swapping: %d %d\n", x, y);
return 0;
#include <stdio.h>
int total = 0;
return total;
int main() {
int arr[5], n = 5;
scanf("%d", &arr[i]);
return 0;
#include <stdio.h>
char temp;
end--;
temp = *start;
*start = *end;
*end = temp;
start++;
end--;
int main() {
char str[100];
gets(str);
reverse(str);
return 0;
50. Find the largest and smallest elements in an array using pointers
#include <stdio.h>
int main() {
scanf("%d", &arr[i]);
return 0;
#include <stdio.h>
while (*src) {
*dest = *src;
src++;
dest++;
*dest = '\0';
int main() {
gets(src);
copyString(src, dest);
return 0;
#include <stdio.h>
int main() {
scanf("%d", &A[i][j]);
scanf("%d", &B[i][j]);
printf("Sum of matrices:\n");
printf("\n");
}
return 0;
#include <stdio.h>
int main() {
scanf("%d", &A[i][j]);
scanf("%d", &B[i][j]);
printf("Difference of matrices:\n");
printf("\n");
return 0;
}
54. Multiply two matrices
#include <stdio.h>
int main() {
scanf("%d", &A[i][j]);
scanf("%d", &B[i][j]);
printf("Product of matrices:\n");
printf("\n");
return 0;
#include <stdio.h>
int main() {
scanf("%d", &A[i][j]);
trans[i][j] = A[j][i];
printf("\n");
return 0;
#include <stdio.h>
int main() {
scanf("%d", &A[i][j]);
if (A[i][j] != A[j][i]) {
flag = 0;
break;
if (flag)
printf("Matrix is symmetric\n");
else
return 0;
57. Define a structure for student details (name, roll number, marks) and print the details
#include <stdio.h>
struct Student {
char name[100];
int roll_no;
float marks;
};
int main() {
gets(student1.name);
scanf("%f", &student1.marks);
printf("\nStudent Details:\n");
return 0;
58. Define a structure for employee details and display the highest salary
#include <stdio.h>
struct Employee {
char name[100];
int emp_id;
float salary;
};
int main() {
gets(emp1.name);
scanf("%d", &emp1.emp_id);
gets(emp2.name);
scanf("%d", &emp2.emp_id);
scanf("%f", &emp2.salary);
gets(emp3.name);
scanf("%d", &emp3.emp_id);
scanf("%f", &emp3.salary);
else
return 0;
}
59. Define a structure for a book (title, author, price) and sort books by price
#include <stdio.h>
#include <string.h>
struct Book {
char title[100];
char author[100];
float price;
};
int main() {
gets(book1.title);
gets(book1.author);
scanf("%f", &book1.price);
gets(book2.title);
gets(book2.author);
printf("Enter price: ");
scanf("%f", &book2.price);
gets(book3.title);
gets(book3.author);
scanf("%f", &book3.price);
} else {
return 0;
---------------------------------------------------------------------
END-----------------------------------------------------------------------------