-Important Programming Questions

2. C Program to Calculate the Factorial of a Number Using

1. C Program to Check Prime Number Using a Function: Recursion: 7) wap in C to binary to Decimal Conversion 8) wap in C to float to String Conversion
#include <stdio.h>
#include <stdbool.h>
#include <stdio.h> #include <stdio.h>
bool isPrime(int num) { #include <stdio.h>
int binaryToDecimal(const char *binary) {
if (num <= 1) return false; int main() {
int factorial(int n) {
for (int i = 2; i * i <= num; i++) { int decimal = 0;
if (n == 0) return 1;
float num;
if (num % i == 0) return false; while (*binary) {
} return n * factorial(n - 1); char str[20];
decimal = decimal * 2 + (*binary - '0');
return true; } printf("Enter float: ");
binary++;
} int main() { scanf("%f", &num);
int main()
}
int number;
sprintf(str, "%.2f", num);
{ return decimal;
printf("Enter a number: ");
int number; } printf("String: %s\n", str);
scanf("%d", &number);
printf("Enter a number: ");
printf("Factorial of %d is %d.\n", number, factorial(number)); int main() { return 0;
scanf("%d", &number);
return 0; char binary[33]; }
if (isPrime(number))
} printf("Enter binary: ");
printf("%d is a prime number.\n", number);
else scanf("%s", binary);
printf("%d is not a prime number.\n", number); printf("Decimal: %d\n", binaryToDecimal(binary));
return 0;
return 0;
}
}

4) C Program to Sort an Array using Pointers. 9) Wap in C to Compare Two Strings 10) Reverse a String Using Pointers
#include <stdio.h>
#include <stdio.h>
3) C Program to Find G.C.D Using Recursion: void swap(int *a, int *b) {
#include <stdio.h> #include <string.h>
int temp = *a; #include <string.h> void reverseString(char *str) {
*a = *b; int main() {
#include <stdio.h> char *start = str;
*b = temp;
char str1[100], str2[100]; char *end = str + strlen(str) - 1;
}
int gcd(int a, int b) { printf("Enter first string: "); char temp;
void sortArray(int *arr, int size) {
if (b == 0) return a; for (int i = 0; i < size - 1; i++) { fgets(str1, sizeof(str1), stdin); while (start < end) {

return gcd(b, a % b); for (int j = i + 1; j < size; j++) { str1[strcspn(str1, "\n")] = '\0'; temp = *start;
if (*(arr + i) > *(arr + j)) { printf("Enter second string: ");
} *start = *end;
swap(arr + i, arr + j);
int main() { fgets(str2, sizeof(str2), stdin); *end = temp;
}
int num1, num2; str2[strcspn(str2, "\n")] = '\0'; start++;
}
printf("Enter two numbers: "); } int cmp = strcmp(str1, str2); end--;

scanf("%d %d", &num1, &num2); } if (cmp == 0) }

int main() { printf("Equal\n");
printf("GCD of %d and %d is %d.\n", num1, num2, gcd(num1, }
int arr[] = {64, 25, 12, 22, 11};
num2)); else if (cmp < 0) int main() {
int size = sizeof(arr) / sizeof(arr[0]);
return 0; printf("First is less\n"); char str[100];
sortArray(arr, size);
} printf("Sorted array: "); else printf("Enter a string: ");
for (int i = 0; i < size; i++) { printf("First is greater\n"); fgets(str, sizeof(str), stdin);
printf("%d ", arr[i]);
str[strcspn(str, "\n")] = '\0';
}
return 0; reverseString(str);
printf("\n");
} printf("Reversed: %s\n", str);
return 0;
} return 0; }

5) C Program to Find the Largest Element in an Array Using Pointers: 6) Wap in C to Check if a String is a Palindrome Using Pointers 11) Wap in C to Program to Sort a String. 12) C Program to Insert a String into Another String.
#include <stdio.h>

#include <stdio.h> #include <string.h>

#include <stdio.h> #include <stdio.h>
#include <ctype.h> void sortString(char *str) {
int findLargest(int *arr, int size) { #include <string.h>
int isPalindrome(const char *start, const char *end) { int n = strlen(str);
int largest = *arr;
while (start < end) {
int main() {
for (int i = 0; i < n - 1; i++) {
for (int i = 1; i < size; i++) {
if (tolower(*start) != tolower(*end)) return 0; char dest[100] = "Hello World!";
for (int j = i + 1; j < n; j++) {
if (*(arr + i) > largest) {
start++;
if (str[i] > str[j]) {
char src[] = " Amazing";
largest = *(arr + i);
end--; int pos = 6;
char temp = str[i];
} }
str[i] = str[j]; int lenDest = strlen(dest);
} return 1;
str[j] = temp; int lenSrc = strlen(src);
return largest; }
} for (int i = lenDest; i >= pos; i--) {
} int main() {
char str[100], *start, *end; } dest[i + lenSrc] = dest[i];
int main() {
printf("Enter a string: "); } }
int arr[] = {10, 20, 4, 45, 99};
fgets(str, sizeof(str), stdin); }
int size = sizeof(arr) / sizeof(arr[0]); for (int i = 0; i < lenSrc; i++) {
// Remove newline int main() {
printf("Largest element is %d.\n", findLargest(arr, size)); dest[pos + i] = src[i];
for (end = str; *end; end++); char str[100];
return 0; }
end--;
printf("Enter a string: ");
}
if (isPalindrome(str, end))
scanf("%s", str);
printf("Palindrome\n"); printf("Resulting string: %s\n", dest);
sortString(str);
else
printf("Sorted string: %s\n", str); return 0;
printf("Not a palindrome\n");
return 0; }
return 0;
} }
13) C Program to Find the Transpose of a Matrix. 14) C Program to Check Whether Two Matrices Are Equal or Not. secondMaxPos = i; 19) Wap in c to Find the Second Smallest Number from Given N Numbers:
#include <stdio.h>
#include <stdio.h>
}
#define MAX 10
#include <stdio.h>
#define MAX 10 int main() { if (arr[i] < min) {
#define MAX 100
int main() { int mat1[MAX][MAX], mat2[MAX][MAX]; secondMin = min;
int row, col, equal = 1; int main() {
int matrix[MAX][MAX], transposed[MAX][MAX]; min = arr[i];
printf("Enter rows and columns: ");
int row, col; int arr[MAX];
scanf("%d %d", &row, &col); secondMinPos = minPos;
printf("Enter rows and columns: "); printf("Enter first matrix elements:\n"); int n;
minPos = i;
for (int i = 0; i < row; i++) {
scanf("%d %d", &row, &col); printf("Enter the number of elements: ");
for (int j = 0; j < col; j++) {
} else if (arr[i] < secondMin && arr[i] > min) {
printf("Enter matrix elements:\n"); scanf("%d", &n);
scanf("%d", &mat1[i][j]); secondMin = arr[i];
for (int i = 0; i < row; i++) { } printf("Enter elements:\n");
secondMinPos = i;
for (int j = 0; j < col; j++) { }
for (int i = 0; i < n; i++) {
printf("Enter second matrix elements:\n"); }
scanf("%d", &matrix[i][j]);
scanf("%d", &arr[i]);
}
for (int i = 0; i < row; i++) {
}
for (int j = 0; j < col; j++) {
}
} printf("Second Maximum: %d at position %d\n", secondMax,
scanf("%d", &mat2[i][j]);
secondMaxPos); int min = arr[0], secondMin = arr[0];
for (int i = 0; i < col; i++) { }

for (int j = 0; j < row; j++) {

} printf("Second Minimum: %d at position %d\n", secondMin, for (int i = 0; i < n; i++) {
for (int i = 0; i < row; i++) { secondMinPos); if (arr[i] < min) {
transposed[i][j] = matrix[j][i];
for (int j = 0; j < col; j++) {
return 0; secondMin = min;
} if (mat1[i][j] != mat2[i][j]) {

} equal = 0; } min = arr[i];

break;
printf("Transposed matrix:\n"); } else if (arr[i] < secondMin && arr[i] > min) {
}
for (int i = 0; i < col; i++) { secondMin = arr[i];
}
for (int j = 0; j < row; j++) { }
}
printf("%d ", transposed[i][j]); if (equal) {

printf("Matrices are equal.\n");

}
}
} else { printf("Second Smallest: %d\n", secondMin);
printf("\n");
printf("Matrices are not equal.\n");
return 0;
} }

return 0; } return 0; }
}

15) C Program to Find the Maximum and Minimum in an Array. (Important) 16) C Program to Remove Duplicate Elements From a Sorted Array. 20) Write a program in C to check whether a number is Armstrong or not.

#include <stdio.h> #include <stdio.h>

#include <stdio.h>
#include <math.h>
#define MAX 100 #define MAX 100
int main() {
int main() {
int main() { int num, originalNum, sum = 0, digitCount = 0;
int arr[MAX];
int arr[MAX]; printf("Enter a number: ");
int n; scanf("%d", &num);
int n, min, max;
printf("Enter the number of elements: "); originalNum = num;
printf("Enter the number of elements: "); // Count the number of digits
scanf("%d", &n);
scanf("%d", &n); while (num > 0) {
printf("Enter sorted elements:\n");
printf("Enter elements:\n"); num /= 10;
for (int i = 0; i < n; i++) {
digitCount++;
scanf("%d", &arr[0]); scanf("%d", &arr[i]);
}
min = max = arr[0]; } num = originalNum;

for (int i = 1; i < n; i++) { int newSize = 1; // Calculate the sum of digits raised to the power of digitCount

scanf("%d", &arr[i]); for (int i = 1; i < n; i++) { while (num > 0) {

int digit = num % 10;

if (arr[i] < min) min = arr[i]; if (arr[i] != arr[i - 1]) {
sum += pow(digit, digitCount);
arr[newSize++] = arr[i];
if (arr[i] > max) max = arr[i]; num /= 10;
}
} }
} if (sum == originalNum) {
printf("Minimum value: %d\n", min);
printf("Array after removing duplicates:\n"); printf("%d is an Armstrong number.\n", originalNum);
printf("Maximum value: %d\n", max);
for (int i = 0; i < newSize; i++) { } else {
return 0; printf("%d is not an Armstrong number.\n", originalNum);
printf("%d ", arr[i]);
} }
}

return 0;
printf("\n");
}
return 0;
}

17) C Program to Print Pascal's Pattern Triangle Pyramid. (Important) 18) Write a C program to find the second maximum and second minimum
element from an array along with their positions.
#include <stdio.h>
#include <stdio.h>
#define MAX 100
int main() { int main() {
int n; int arr[MAX];

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

printf("Enter the number of elements: ");
scanf("%d", &n);
scanf("%d", &n);
for (int line = 0; line < n; line++) {
printf("Enter elements:\n");
int value = 1;
for (int i = 0; i < n; i++) {
for (int i = 0; i <= line; i++) { scanf("%d", &arr[i]);
printf("%d ", value); }

value = value * (line - i) / (i + 1); int max = arr[0], secondMax = arr[0];

int min = arr[0], secondMin = arr[0];
}
int maxPos, secondMaxPos;
printf("\n");
int minPos, secondMinPos;
} for (int i = 0; i < n; i++) {
return 0; if (arr[i] > max) {

} secondMax = max;
max = arr[i];
secondMaxPos = maxPos;
maxPos = i;
} else if (arr[i] > secondMax && arr[i] < max) {
secondMax = arr[i];