The document contains multiple C programming tasks, including functions to find minimum and maximum values, reverse an array, find the second largest number, merge arrays, calculate averages, and check for duplicates. It also includes string manipulation tasks like reversing, checking palindromes, counting vowels and words, converting to uppercase, and checking for anagrams. Each task contains a main function demonstrating its usage with sample inputs and outputs.

1. Array Tasks
1)#include <stdio.h>
void findMinMax(int arr[], int size) {
int max = arr[0];
int min = arr[0];
for(int i = 1; i < size; i++) {
if(arr[i] > max) max = arr[i];
if(arr[i] < min) min = arr[i];
}
printf("Max: %d, Min: %dn", max, min);
}
int main() {
int arr[] = {3, 5, 7, 2, 8};
int size = sizeof(arr) / sizeof(arr[0]);
findMinMax(arr, size);
return 0;
}
2)#include <stdio.h>
void reverseArray(int arr[], int size) {
for(int i = size - 1; i >= 0; i--) {
printf("%d ", arr[i]);
}
printf("n");
}
int main() {
int arr[] = {1, 2, 3, 4, 5};
int size = sizeof(arr) / sizeof(arr[0]);
reverseArray(arr, size);
return 0;
}
3)#include <stdio.h>
void findSecondLargest(int arr[], int size) {
int first = arr[0], second = -1;
for(int i = 1; i < size; i++) {
if(arr[i] > first) {
second = first;
first = arr[i];

2. } else if(arr[i] > second && arr[i] != first) {
second = arr[i];
}
}
printf("Second Largest: %dn", second);
}
int main() {
int arr[] = {10, 20, 4, 45, 99};
int size = sizeof(arr) / sizeof(arr[0]);
findSecondLargest(arr, size);
return 0;
}
4)#include <stdio.h>
void leftRotate(int arr[], int size) {
int temp = arr[0];
for(int i = 0; i < size - 1; i++) {
arr[i] = arr[i+1];
}
arr[size-1] = temp;
for(int i = 0; i < size; i++) {
printf("%d ", arr[i]);
}
printf("n");
}
int main() {
int arr[] = {1, 2, 3, 4, 5};
int size = sizeof(arr) / sizeof(arr[0]);
leftRotate(arr, size);
return 0;
}
5)#include <stdio.h>
void mergeArrays(int arr1[], int size1, int arr2[], int size2) {
int merged[size1 + size2];
int i = 0, j = 0, k = 0;
while(i < size1 && j < size2) {
if(arr1[i] < arr2[j]) merged[k++] = arr1[i++];

3. else merged[k++] = arr2[j++];
}
while(i < size1) merged[k++] = arr1[i++];
while(j < size2) merged[k++] = arr2[j++];
for(int i = 0; i < size1 + size2; i++) {
printf("%d ", merged[i]);
}
printf("n");
}
int main() {
int arr1[] = {1, 3, 5, 7};
int arr2[] = {2, 4, 6, 8};
int size1 = sizeof(arr1) / sizeof(arr1[0]);
int size2 = sizeof(arr2) / sizeof(arr2[0]);
mergeArrays(arr1, size1, arr2, size2);
return 0;
}
6)#include <stdio.h>
void findAverage(int arr[], int size) {
int sum = 0;
for(int i = 0; i < size; i++) {
sum += arr[i];
}
printf("Average: %dn", sum / size);
}
int main() {
int arr[] = {10, 20, 30, 40, 50};
int size = sizeof(arr) / sizeof(arr[0]);
findAverage(arr, size);
return 0;
}
7)#include <stdio.h>
void countOccurrences(int arr[], int size, int element) {
int count = 0;
for(int i = 0; i < size; i++) {
if(arr[i] == element) count++;
}
printf("Occurrences of %d: %dn", element, count);

4. }
int main() {
int arr[] = {1, 2, 3, 2, 2, 4, 5};
int size = sizeof(arr) / sizeof(arr[0]);
int element = 2;
countOccurrences(arr, size, element);
return 0;
}
8)#include <stdio.h>
void findSum(int arr[], int size) {
int sum = 0;
for(int i = 0; i < size; i++) {
sum += arr[i];
}
printf("Sum: %dn", sum);
}
int main() {
int arr[] = {1, 2, 3, 4, 5};
int size = sizeof(arr) / sizeof(arr[0]);
findSum(arr, size);
return 0;
}
8)#include <stdio.h>
void checkElement(int arr[], int size, int element) {
int found = 0;
for(int i = 0; i < size; i++) {
if(arr[i] == element) {
found = 1;
break;
}
}
printf(found ? "Yesn" : "Non");
}
int main() {
int arr[] = {10, 20, 30, 40};
int size = sizeof(arr) / sizeof(arr[0]);
int element = 25;
checkElement(arr, size, element);

5. return 0;
}
9)#include <stdio.h>
void checkElement(int arr[], int size, int element) {
int found = 0;
for(int i = 0; i < size; i++) {
if(arr[i] == element) {
found = 1;
break;
}
}
printf(found ? "Yesn" : "Non");
}
int main() {
int arr[] = {10, 20, 30, 40};
int size = sizeof(arr) / sizeof(arr[0]);
int element = 25;
checkElement(arr, size, element);
return 0;
}
10)#include <stdio.h>
void removeDuplicates(int arr[], int size) {
int result[size];
int k = 0;
for(int i = 0; i < size; i++) {
int j;
for(j = 0; j < i; j++) {
if(arr[i] == arr[j]) break;
}
if(j == i) {
result[k++] = arr[i];
}
}
for(int i = 0; i < k; i++) {
printf("%d ", result[i]);
}
printf("n");
}

6. int main() {
int arr[] = {1, 2, 2, 3, 4, 4, 5};
int size = sizeof(arr) / sizeof(arr[0]);
removeDuplicates(arr, size);
return 0;
}
11)#include <stdio.h>
void findIndex(int arr[], int size, int element) {
int index = -1;
for(int i = 0; i < size; i++) {
if(arr[i] == element) {
index = i;
break;
}
}
printf("Index of %d: %dn", element, index);
}
int main() {
int arr[] = {10, 20, 30, 20, 10};
int size = sizeof(arr) / sizeof(arr[0]);
int element = 20;
findIndex(arr, size, element);
return 0;
}
12)#include <stdio.h>
#include <stdlib.h>
int compare(const void *a, const void *b) {
return (*(int *)a - *(int *)b);
}
void findMedian(int arr[], int size) {
qsort(arr, size, sizeof(int), compare);
if(size % 2 == 0) {
printf("Median: %.1fn", (arr[size/2 - 1] + arr[size/2]) / 2.0);
} else {
printf("Median: %dn", arr[size/2]);
}
}

7. int main() {
int arr[] = {3, 1, 4, 2};
int size = sizeof(arr) / sizeof(arr[0]);
findMedian(arr, size);
return 0;
}
13)#include <stdio.h>
void findCommonElements(int arr1[], int size1, int arr2[], int size2) {
printf("Common elements: ");
for (int i = 0; i < size1; i++) {
for (int j = 0; j < size2; j++) {
if (arr1[i] == arr2[j]) {
printf("%d ", arr1[i]);
break;
}
}
}
printf("n");
}
int main() {
int arr1[] = {1, 2, 3, 4};
int arr2[] = {3, 4, 5, 6};
int size1 = sizeof(arr1) / sizeof(arr1[0]);
int size2 = sizeof(arr2) / sizeof(arr2[0]);
findCommonElements(arr1, size1, arr2, size2);
return 0;
}
14)#include <stdio.h>
int findDifference(int arr[], int size) {
int min = arr[0];
int max = arr[0];
for (int i = 1; i < size; i++) {
if (arr[i] < min) {
min = arr[i];
}
if (arr[i] > max) {
max = arr[i];
}
}
return max - min;

8. }
int main() {
int arr[] = {10, 3, 5, 8, 7};
int size = sizeof(arr) / sizeof(arr[0]);
printf("Difference: %dn", findDifference(arr, size));
return 0;
}
15)#include <stdio.h>
int sumOfEvenNumbers(int arr[], int size) {
int sum = 0;
for (int i = 0; i < size; i++) {
if (arr[i] % 2 == 0) {
sum += arr[i];
}
}
return sum;
}
int main() {
int arr[] = {1, 2, 3, 4, 5, 6};
int size = sizeof(arr) / sizeof(arr[0]);
printf("Sum of even numbers: %dn", sumOfEvenNumbers(arr, size));
return 0;
}
16)#include <stdio.h>
int isSorted(int arr[], int size) {
for (int i = 1; i < size; i++) {
if (arr[i] < arr[i - 1]) {
return 0; // Not sorted
}
}
return 1; // Sorted
}
int main() {
int arr1[] = {1, 2, 3, 4, 5};
int arr2[] = {5, 3, 8, 1};
int size1 = sizeof(arr1) / sizeof(arr1[0]);
int size2 = sizeof(arr2) / sizeof(arr2[0]);

9. printf("Array 1 is %sn", isSorted(arr1, size1) ? "sorted" : "not sorted");
printf("Array 2 is %sn", isSorted(arr2, size2) ? "sorted" : "not sorted");
return 0;
}
String Tasks
1)include <stdio.h>
#include <string.h>
void reverseString(char str[]) {
int len = strlen(str);
for(int i = len - 1; i >= 0; i--) {
printf("%c", str[i]);
}
printf("n");
}
int main() {
char str[] = "Hello";
reverseString(str);
return 0;
}
2)#include <stdio.h>
#include <string.h>
void checkPalindrome(char str[]) {
int len = strlen(str);
int isPalindrome = 1;
for(int i = 0; i < len / 2; i++) {
if(str[i] != str[len - 1 - i]) {
isPalindrome = 0;
break;
}
}
if(isPalindrome) printf("Palindromen");
else printf("Not a palindromen");
}
int main() {
char str[] = "madam";

10. checkPalindrome(str);
return 0;
}
3)#include <stdio.h>
#include <string.h>
void countVowels(char str[]) {
int count = 0;
for(int i = 0; str[i] != '0'; i++) {
char c = str[i];
if(c == 'a' || c == 'e' || c == 'i' || c == 'o' || c == 'u' ||
c == 'A' || c == 'E' || c == 'I' || c == 'O' || c == 'U') {
count++;
}
}
printf("Number of vowels: %dn", count);
}
int main() {
char str[] = "OpenAI";
countVowels(str);
return 0;
}
4)#include <stdio.h>
#include <string.h>
void countWords(char str[]) {
int count = 0;
for(int i = 0; str[i] != '0'; i++) {
if((i == 0 && str[i] != ' ') || (str[i] != ' ' && str[i - 1] == ' ')) {
count++;
}
}
printf("Number of words: %dn", count);
}
int main() {
char str[] = "Hello World";
countWords(str);
return 0;
}
5)#include <stdio.h>

11. #include <string.h>
void toUpperCase(char str[]) {
for(int i = 0; str[i] != '0'; i++) {
if(str[i] >= 'a' && str[i] <= 'z') {
str[i] = str[i] - 'a' + 'A';
}
}
printf("Uppercase: %sn", str);
}
int main() {
char str[] = "OpenAI";
toUpperCase(str);
return 0;
}
6)#include <stdio.h>
#include <string.h>
void removeSpaces(char str[]) {
int count = 0;
for(int i = 0; str[i] != '0'; i++) {
if(str[i] != ' ') {
str[count++] = str[i];
}
}
str[count] = '0';
printf("String without spaces: %sn", str);
}
int main() {
char str[] = "Remove all spaces";
removeSpaces(str);
return 0;
}
7)#include <stdio.h>
#include <string.h>
void findFrequency(char str[]) {
int freq[256] = {0}; // ASCII characters
for(int i = 0; str[i] != '0'; i++) {
freq[(int)str[i]]++;

12. }
for(int i = 0; i < 256; i++) {
if(freq[i] != 0) {
printf("%c: %dn", i, freq[i]);
}
}
}
int main() {
char str[] = "hello";
findFrequency(str);
return 0;
}
8)#include <stdio.h>
#include <string.h>
void sortString(char str[]) {
int len = strlen(str);
for(int i = 0; i < len - 1; i++) {
for(int j = i + 1; j < len; j++) {
if(str[i] > str[j]) {
char temp = str[i];
str[i] = str[j];
str[j] = temp;
}
}
}
}
void checkAnagram(char str1[], char str2[]) {
sortString(str1);
sortString(str2);
if(strcmp(str1, str2) == 0) {
printf("Anagramsn");
} else {
printf("Not Anagramsn");
}
}
int main() {
char str1[] = "listen";
char str2[] = "silent";
checkAnagram(str1, str2);

13. return 0;
}
9)#include <stdio.h>
#include <string.h>
void capitalizeFirstLetter(char str[]) {
int len = strlen(str);
for(int i = 0; i < len; i++) {
if(i == 0 || (str[i - 1] == ' ' && str[i] != ' ')) {
if(str[i] >= 'a' && str[i] <= 'z') {
str[i] = str[i] - 'a' + 'A';
}
}
}
printf("Capitalized String: %sn", str);
}
int main() {
char str[] = "hello world";
capitalizeFirstLetter(str);
return 0;
}
10)#include <stdio.h>
#include <string.h>
void replaceSubstring(char str[], char old[], char new[]) {
char result[100] = "";
int i = 0, j = 0, found = 0;
int oldLen = strlen(old);
int newLen = strlen(new);
while(str[i] != '0') {
found = 1;
for(int k = 0; k < oldLen; k++) {
if(str[i + k] != old[k]) {
found = 0;
break;
}
}
if(found) {
strcat(result, new);
i += oldLen;
} else {
result[j++] = str[i++];

14. }
}
result[j] = '0';
printf("Result: %sn", result);
}
int main() {
char str[] = "The cat is on the cat";
char old[] = "cat";
char new[] = "dog";
replaceSubstring(str, old, new);
return 0;
}
11)#include <stdio.h>
#include <string.h>
void findLongestWord(char str[]) {
int maxLen = 0, maxStart = 0, currLen = 0, currStart = 0;
for(int i = 0; ; i++) {
if(str[i] != ' ' && str[i] != '0') {
if(currLen == 0) currStart = i;
currLen++;
} else {
if(currLen > maxLen) {
maxLen = currLen;
maxStart = currStart;
}
currLen = 0;
}
if(str[i] == '0') break;
}
printf("Longest Word: ");
for(int i = maxStart; i < maxStart + maxLen; i++) {
printf("%c", str[i]);
}
printf("n");
}
int main() {
char str[] = "Find the longest word in this sentence";
findLongestWord(str);
return 0;
}

15. 12)#include <stdio.h>
#include <string.h>
void extractSubstring(char str[], int start, int end) {
char result[100];
int j = 0;
for(int i = start; i <= end && str[i] != '0'; i++) {
result[j++] = str[i];
}
result[j] = '0';
printf("Substring: %sn", result);
}
int main() {
char str[] = "Programming";
int start = 0, end = 4;
extractSubstring(str, start, end);
return 0;
}
13)#include <stdio.h>
int findLastOccurrence(char str[], char ch) {
int index = -1;
for(int i = 0; str[i] != '0'; i++) {
if(str[i] == ch) {
index = i;
}
}
return index;
}
int main() {
char str[] = "hello world";
char ch = 'o';
int index = findLastOccurrence(str, ch);
printf("Last occurrence of '%c' is at index: %dn", ch, index);
return 0;
}
14)#include <stdio.h>
int countConsonants(char str[]) {

16. int count = 0;
for(int i = 0; str[i] != '0'; i++) {
char ch = str[i];
if((ch >= 'a' && ch <= 'z') || (ch >= 'A' && ch <= 'Z')) {
if(ch != 'a' && ch != 'e' && ch != 'i' && ch != 'o' && ch != 'u' &&
ch != 'A' && ch != 'E' && ch != 'I' && ch != 'O' && ch != 'U') {
count++;
}
}
}
return count;
}
int main() {
char str[] = "Hello World";
printf("Number of consonants: %dn", countConsonants(str));
return 0;
}
15)#include <stdio.h>
void replaceDigits(char str[], char replaceChar) {
for(int i = 0; str[i] != '0'; i++) {
if(str[i] >= '0' && str[i] <= '9') {
str[i] = replaceChar;
}
}
}
int main() {
char str[] = "The year 2024";
char replaceChar = '*';
replaceDigits(str, replaceChar);
printf("Modified string: %sn", str);
return 0;
}
16)#include <stdio.h>
int isOnlyAlphabets(char str[]) {
for(int i = 0; str[i] != '0'; i++) {
char ch = str[i];

17. if(!((ch >= 'A' && ch <= 'Z') || (ch >= 'a' && ch <= 'z'))) {
return 0;
}
}
return 1;
}
int main() {
char str[] = "HelloWorld";
if(isOnlyAlphabets(str)) {
printf("Only Alphabetsn");
} else {
printf("Not Only Alphabetsn");
}
return 0;
}