C Lab
C Lab
C Lab
#include <stdio.h>
#include <stdlib.h>
struct student{
charname[50];
int marks;
};
intmain(){
int n, i;
struct students[100];
FILE*fp;
scanf("%d", &n);
scanf("%s", s[i].name);
scanf("%d", &s[i].marks);
if(fp == NULL) {
printf("Error openingfile!\n");
exit(1);
fclose(fp);
printf("Data savedtostudents.txt\n");
return 0;
1b)
#include <stdio.h>
intmain(){
int x=10;
int *ptr;
ptr= &x;
return 0;
1c)
#include <stdio.h>
intsum(intn) {
int i, s=0;
s+= i;
}
return s;
intmain(){
int n;
scanf("%d", &n);
return 0;
2a)
#include <stdio.h>
#include <stdlib.h>
struct student{
charname[50];
int marks;
};
intmain(){
int n, i;
struct students;
FILE*fptr;
scanf("%d", &n);
if(fptr == NULL){
printf("Error openingfile!\n");
exit(1);
}
for(i =0;i <n;i++) {
scanf("%s", s.name);
scanf("%d", &s.marks);
fclose(fptr);
return 0;
In the loop, the programpromptsthe usertoenter the nameandmarksof each student, and
writesthe information tothefile usingfprintf().Finally, the programclosesthe fileusing
fclose().
2b)
#include <stdio.h>
intmain(){
ptr1 =&num1;
ptr2 =&num2;
sum=*ptr1+ *ptr2;
2c)
#include <stdio.h>
intfactorial(int n){
result *=i;
return result;
intmain(){
int n;
return 0;
3a)
Emp.NoEmp.Name Emp.Sal
1 XYZ100000.00
2 ABC200000.00
3 PQR300000.00
.. .
.. .
.. .
#include <stdio.h>
struct Employee {
int empNo;
char empName[50];
float empSal;
};
intmain(){
int n;
scanf("%d", &n);
structEmployeeemp[n];
scanf("%d", &emp[i].empNo);
scanf("%s", emp[i].empName);
scanf("%f", &emp[i].empSal);
printf("Emp.No Emp.NameEmp.Sal\n");
}
return0;
3b)
#include <stdio.h>
*sum= *a +*b;
intmain(){
int a, b, sum;
printf("Enterthefirstnumber: ");
scanf("%d", &a);
printf("Enterthesecondnumber: ");
scanf("%d", &b);
printf("Sumof%dand%dis%d\n", a, b, sum);
return0;
3c)
#include <stdio.h>
intgcd(int a, int b) {
int remainder;
while (b!= 0) {
remainder= a%b;
a =b;
b=remainder;
returna;
intmain(){
int a, b, result;
printf("Enterthefirstnumber: ");
scanf("%d", &a);
printf("Enterthesecondnumber: ");
scanf("%d", &b);
printf("TheGCDof%dand%dis%d\n", a, b, result);
return0;
4a)
#include <stdio.h>
intmain(){
FILE*fp;
char ch;
fp=fopen(filename, "r");
if (fp==NULL) {
return 1;
fclose(fp);
return0;
4b)
#include <stdio.h>
if (*a> *b) {
*biggest =*a;
} else{
*biggest =*b;
intmain(){
int a, b, biggest;
printf("Enterthefirstnumber: ");
scanf("%d", &a);
printf("Enterthesecondnumber: ");
scanf("%d", &b);
return0;
4c)
Write a Cprogramtofindthe LCMofgiven two numbersusinga user-definefunction int
lcm(int, int).
#include <stdio.h>
intgcd(int a, int b) {
if (b== 0)
return a;
returngcd(b, a %b);
intlcm(inta, int b) {
intmain(){
int a, b;
printf("Entertwonumbers: ");
return0;
5a)
#include <stdio.h>
intmain(){
FILE*fp;
fp=fopen("file1.txt", "w");
if (fp==NULL) {
printf("Couldnotopen file");
return 0;
}
char str[100];
scanf("%[^\n]s", str);
printf("Datawrittentofilesuccessfully\n");
fclose(fp);
return0;
5b)
#include <stdio.h>
intmain(){
int n, i;
scanf("%d", &n);
int arr[n];
scanf("%d", &arr[i]);
return0;
}
5c)
#include <stdio.h>
intgcd(int a, int b) {
if (b== 0)
return a;
returngcd(b, a %b);
intmain(){
int a, b, c;
printf("Enterthreenumbers: ");
return0;
6a)
#include <stdio.h>
intmain(){
FILE*fp;
char data[100];
if (fp==NULL) {
printf("Error openingfile\n");
return 1;
printf("Enterdatatoappend: ");
gets(data);//Readdata fromuser
printf("Dataappendedtofile successfully\n");
fclose(fp);//Closethefile
return0;
6b)
#include <stdio.h>
#include <string.h>
*a= *b;
*b=temp;
int i;
if (l== r)
printf("%s\n", str);
else{
intmain(){
char str[100];
scanf("%s", str);
int n= strlen(str);
permute(str, 0, n -1);
return0;
6c)
#include<stdio.h>
int lcm=1;
int i =2;
while (1)
{
if(i %a == 0&&i%b==0&&i%c==0)
lcm= i;
break;
i++;
return lcm;
intmain()
int a, b, c;
return 0;
7a)
#include<stdio.h>
intmain()
FILE*fp1, *fp2;
charch;
if(fp1==NULL)
{
printf("File 1 doesn'texist.\n");
return0;
fputc(ch, fp2);
fclose(fp1);
fclose(fp2);
return 0;
7b)
#include <stdio.h>
#include <stdlib.h>
intmain()
scanf("%d", &n);
if(ptr==NULL)
printf("Memoryallocationfailed.\n");
return1;
max=ptr[0];
if(ptr[i] >max)
max=ptr[i];
return 0;
7c)
#include <stdio.h>
intisprime(intn) {
int i;
if(n%i == 0) return 0;
return 1;
intmain(){
int n;
scanf("%d", &n);
if(isprime(n)) {
}else {
printf("%disnot aprime number.\n", n);
return 0;
8a)
#include <stdio.h>
#include <ctype.h>
intmain(){
FILE*fp;
charch;
if(fp == NULL) {
printf("Couldnotopen file\n");
return0;
charCount++;
if(isspace(ch) || ch =='\n'){
wordCount++;
fclose(fp);
8b)
#include <stdio.h>
intlength(char *str) {
len++;
str++;
return len;
intmain(){
return 0;
8c)
#include <stdio.h>
intispalindrome(int num) {
while (temp!=0){
reversed=reversed* 10+temp%10;
temp /=10;
}
returnnum== reversed;
intmain(){
int num;
scanf("%d", &num);
if (ispalindrome(num))
else
return0;
9a)
#include <stdio.h>
#include <ctype.h>
intmain(void) {
charc;
FILE*file;
if(file==NULL) {
printf("Error openingfile!\n");
return1;
if(c=='\n') lines++;
if(c=='.' || c== '!' || c=='?') sentences++;
fclose(file);
return 0;
9b)
#include <stdio.h>
#include <string.h>
void reverse(char*str){
chartemp=*start;
*start= *end;
*end=temp;
start++;
end--;
intmain(){
char str[100];
scanf("%s", str);
reverse(str);
9c)
#include <stdio.h>
intisPerfect(intnum)
int i, sum=0;
for(i=1;i<num;i++){
if(num%i == 0)
sum += i;
intmain()
int num;
scanf("%d", &num);
if(isPerfect(num))
else
return 0;
}
10a)
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_LINES100
char *lines[MAX_LINES];
char line[MAX_LINE_LEN];
int line_count= 0;
if (argc!= 2){
return 1;
if (file ==NULL) {
return 1;
strcpy(lines[line_count], line);
line_count++;
fclose(file);
free(lines[i]);
return0;
10b)
#include <stdio.h>
#include <string.h>
intis_palindrome(char*str) {
while (str<end) {
if(*str!= *end)return0;
str++;
end--;
return1;
intmain(){
char str[100];
scanf("%s", str);
if (is_palindrome(str)) {
} else{
}
return0;
10c)
#include <stdio.h>
#include <math.h>
intisarmstrong(int num) {
originalNum=num;
originalNum/= 10;
++n;
originalNum=num;
remainder=originalNum%10;
originalNum/= 10;
if(result == num)
return1;
else
return0;
intmain(){
int num;
if(isarmstrong(num))
else
return 0;
11a)
#include <stdio.h>
#include <stdlib.h>
intmain(){
FILE*file_ptr1, *file_ptr2;
char filename[100], c;
printf("Enterthefilename: ");
scanf("%s", filename);
//Openfile inreadmode
c =getc(file_ptr1);
if (file_ptr1==NULL) {
return 0;
scanf("%d", &line_num);
c =getc(file_ptr1);
c= getc(file_ptr1);
if(c=='\n')
count++;
//Untiltheline tobedeletedisreached
if(count!=line_num) {
//Copyalllinesin File2
putc(c, file_ptr2);
fclose(file_ptr1);
fclose(file_ptr2);
//Remove originalfile
remove(filename);
rename("temp.c", filename);
return0;
11b)
#include <stdio.h>
void reverse(int*num) {
int rev= 0;
while (*num) {
rev= rev* 10+ *num%10;
*num /=10;
*num=rev;
intmain(){
int num;
scanf("%d", &num);
reverse(&num);
return 0;
11c)
#include <stdio.h>
#include <math.h>
intfactorial(int n){
int f= 1;
while (n > 1) {
f*= n;
n--;
return f;
intisstrong(intn) {
while (t) {
sum+= factorial(d);
t/=10;
intmain(){
int n;
scanf("%d", &n);
if(isstrong(n)){
}else {
return 0;
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
FILE*fptr1, *fptr2;
charbuffer[1024];
int lineCount= 0;
if(fptr1== NULL) {
printf("Error openingfile\n");
exit(1);
if(fptr2== NULL) {
printf("Error openingfile\n");
fclose(fptr1);
exit(1);
while (!feof(fptr1)) {
strcpy(buffer, "\0");
lineCount++;
if(lineCount==lineNumber) {
}else {
}
}
fclose(fptr1);
fclose(fptr2);
remove(filename);
rename("replacement.tmp", filename);
intmain(){
charfilename[100];
int lineNumber;
charnewLine[1024];
scanf("%s", filename);
scanf("%d", &lineNumber);
scanf("\n");
printf("Line replacedsuccessfully\n");
return 0;
#include <stdio.h>
intmain(){
int n, count= 0;
scanf("%d", ptr);
*ptr/= 10;
count++;
return 0;
12c)
#include <stdio.h>
#include <math.h>
void all_armstrongs(intn) {
num =i;
originalNum=num;
originalNum/=10;
digits++;
}
originalNum=num;
remainder= originalNum%10;
result+=pow(remainder, digits);
originalNum/=10;
if(result == num)
printf("%disanArmstrongnumber\n", num);
intmain(){
int n;
scanf("%d", &n);
all_armstrongs(n);
return0;
13a)
#include <stdio.h>
#include <stdlib.h>
intmain()
charch;
if(fp1==NULL)
printf("Couldnotopen filefile1.txt\n");
exit(0);
if(fp2==NULL)
printf("Couldnotopen filefile2.txt\n");
exit(0);
if(fp3==NULL)
printf("Couldnotopen fileoutput.txt\n");
exit(0);
fputc(ch, fp3);
fputc(ch, fp3);
}
printf("Filesmerged successfullyintooutput.txt\n");
fclose(fp1);
fclose(fp2);
fclose(fp3);
return 0;
13b)
#include <stdio.h>
intis_prime(int num) {
int i;
if (num<=1) return 0;
return1;
intmain(){
scanf("%d", p_num);
if (is_prime(*p_num))
else
13c)
#include<stdio.h>
#include<math.h>
intfactorial(int num){
int fact=1;
while(num> 0) {
fact *=num;
num--;
return fact;
intis_strong(intnum) {
while(n> 0) {
int r= n%10;
sum+= factorial(r);
n/=10;
void all_strongs(int n) {
if(is_strong(i))
printf("%d", i);
}
intmain(){
int n;
scanf("%d", &n);
all_strongs(n);
return 0;
14a)
#include <stdio.h>
#include <stdlib.h>
FILE*fp_in, *fp_out;
int ch;
if (argc!= 3){
return 1;
if (fp_in ==NULL) {
printf("Error openinginputfile\n");
return 1;
printf("Error openingoutputfile\n");
return 1;
fclose(fp_in);
fclose(fp_out);
return0;
14b)
#include <stdio.h>
int i, res= 1;
res*= i;
*result= res;
intmain(){
scanf("%d", &num);
factorial(&result, num);
return0;
14c)
#include <stdio.h>
#include <stdbool.h>
boolis_palindrome(int num){
while (num!=0){
num /=10;
returnreverse == original;
void all_palindromes(intn) {
if(is_palindrome(i))
printf("%d\n", i);
intmain(){
int n;
printf("EnterN: ");
scanf("%d", &n);
all_palindromes(n);
return0;
15a)
#include <stdio.h>
#include <stdlib.h>
if(argc !=3) {
return1;
if(!encrypted) {
return1;
if(!decrypted) {
return1;
}
unsignedcharbuffer[1024];
size_t n;
buffer[i]= ~buffer[i];
fwrite(buffer, 1, n, decrypted);
fclose(encrypted);
fclose(decrypted);
return 0;
15b)
#include <stdio.h>
#include <math.h>
intlength(int number) {
int count= 0;
count++;
number /= 10;
return count;
}
intisArmstrongNumber(intnumber) {
int sum=0;
number /= 10;
intmain(){
int number;
scanf("%d", ptr);
if(isArmstrongNumber(number)) {
}else {
return 0;
15c)
Write a Cprogramtoprint allperfect numbersbetween1 toNusingauser-define function
void all_perfects(int).
#include <stdio.h>
void all_perfects(intn) {
int sum=0;
if (i%j == 0) {
sum+= j;
if(sum== i){
intmain(){
int n;
scanf("%d", &n);
all_perfects(n);
return 0;
#include <stdio.h>
#include <stdlib.h>
if(argc !=2) {
return1;
if(remove(argv[1]) ==0) {
}else {
perror("Error deletingfile");
return 0;
16b)
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
intfactorial(int num)
{
int result =1;
result *=i;
return result;
intisStrongNumber(int*num)
int sum=0;
while (*num> 0) {
sum+= factorial(digit);
*num /=10;
intmain()
int num;
scanf("%d", &num);
if(isStrongNumber(&num)) {
}else {
return 0;
}
Thisprogramtakesa positiveinteger asinputandusesa pointer todetermine whether it isa
strongnumberor not. Astrongnumber isdefinedasa number wherethesumof the
factorialsofitsdigitsisequal totheoriginal number.The isStrongNumberfunction takesa
pointer toan integerasinput andreturnsa 1ifthe numberisastrongnumberanda 0if it isnot.
The factorialfunction isusedtocalculatethefactorialof anumber. The input integerispassed
toisStrongNumberusinga pointer, andtheresultisprintedtothe console indicatingwhether
the numberisastrongnumber ornot.
16c)
#include<stdio.h>
intis_prime(int n)
int i;
if(n <= 1)
return0;
if(n%i == 0)
return0;
return 1;
void all_primes(int n)
int i;
if(is_prime(i))
printf("%d", i);
intmain()
{
int n;
scanf("%d", &n);
all_primes(n);
return 0;
17a)
#include <stdio.h>
#include <ctype.h>
intmain(){
charc;
FILE*file;
if(file==NULL) {
printf("Error openingfile!\n");
return0;
if(isalpha(c)) {
vowels++;
}else {
consonants++;
}
fclose(file);
return 0;
17b)
#include <stdio.h>
#include <stdbool.h>
int i;
returnfalse;
return true;
intmain(){
scanf("%d", &num);
if(num<= 0) {
return0;
while (num> 0) {
*p=num%10;
p++;
len++;
num/=10;
}else {
return 0;
17c)
#include <stdio.h>
unsignedlonglongfactorial(unsignedint n){
if(n == 0) {
return1;
intmain(){
unsignedintnum;
printf("Enter apositive integer: ");
scanf("%u", &num);
if(num<0) {
return0;
return 0;
18a)
#include <stdio.h>
while (*str1!='\0') {
*str2 =*str1;
str1++;
str2++;
*str2 ='\0';
intmain(){
charstr1[100], str2[100];
scanf("%s", str1);
copyString(str1, str2);
18b)
#include <stdio.h>
int i, sum=0;
sum+= divisors[i];
intmain(){
scanf("%d", &num);
if(num<= 0) {
return0;
int i;
if(num%i == 0) {
*p=i;
p++;
len++;
}
}
}else {
return 0;
18c)
#include <stdio.h>
if(num2== 0){
returnnum1;
intmain(){
return0;
return 0;
}
19a)
#include <stdio.h>
intcompareStrings(char*str1, char*str2) {
if(*str1 != *str2) {
return0;
str1++;
str2++;
intmain(){
charstr1[100], str2[100];
if(compareStrings(str1, str2)) {
printf("Stringsare equal\n");
}else {
return 0;
19b)
Write a Cprogramtofindwhetherthe given positive number isa primenumber ornotusing
pointers
#include <stdio.h>
#include <stdbool.h>
int i;
if(num%i == 0) {
returnfalse;
return true;
intmain(){
int num;
scanf("%d", &num);
if(num<= 1){
return0;
*p= num/2;
if(isPrime(num, p)) {
}else {
return 0;
}
19c)
#include <stdio.h>
if(num2== 0){
returnnum1;
intmain(){
return0;
return 0;
20a)
intfindLength(char*str){
int count= 0;
count++;
str++;
return count;
intmain(){
charstr[100];
scanf("%s", str);
return 0;
20b)
#include <stdio.h>
#include <math.h>
int sum=0;
int temp=*p;
int digits= 0;
while (*p!=0){
digits++;
p/= 10;
}
*p= temp;
while (*p!=0){
*p/= 10;
intmain(){
int num, i;
scanf("%d", &num);
if(num<= 0) {
return0;
*p=i;
if(isArmstrong(i, p)){
printf("%d\n", i);
return 0;
20c)
Write a Cprogramtofindthe sumofthefirst Nnatural numbersusingrecursion
#include <stdio.h>
intsum(intnum) {
if(num== 0) {
return0;
intmain(){
int num;
scanf("%d", &num);
if(num<= 0) {
return0;
return 0;
21a)
Write a Cprogramtoconcatenatethegiventwostringswithoutusingapre-definedfunction
#include <stdio.h>
while (*str1!='\0') {
*result =*str1;
result++;
str1++;
}
while (*str2!='\0') {
*result =*str2;
result++;
str2++;
*result ='\0';
intmain(){
scanf("%s", str1);
scanf("%s", str2);
return 0;
21b)
#include <stdio.h>
#include <math.h>
intfactorial(int num){
if(num== 0) {
return1;
int temp=*p;
while (*p!=0){
sum+= factorial(lastDigit);
*p/= 10;
intmain(){
int num, i;
scanf("%d", &num);
if(num<= 0) {
return0;
*p=i;
if(isStrong(i, p)) {
printf("%d\n", i);
return 0;
21c)
Write a Cprogramtofindthe reverse ofa given number usingrecursion.
#include <stdio.h>
void reverse(intnum) {
if(num== 0) {
return;
printf("%d", num%10);
reverse(num/10);
intmain(){
int num;
scanf("%d", &num);
if(num<= 0) {
return0;
reverse(num);
printf("\n");
return 0;
22a)
#include <stdio.h>
#include <string.h>
intmain(){
charstr1[100], str2[100];
scanf("%s", str1);
strcpy(str2, str1);
return 0;
22b)
#include <stdio.h>
#include <stdbool.h>
boolisPalindrome(intnum, int*p){
while (*p!=0){
*p/= 10;
return temp==rev;
intmain(){
int num, i;
scanf("%d", &num);
if(num<= 0) {
return0;
}
*p=i;
if(isPalindrome(i, p)) {
printf("%d\n", i);
return 0;
22c)
#include <stdio.h>
#include <stdbool.h>
boolisPalindrome(intnum, int*p){
while (*p!=0){
*p/= 10;
return temp==rev;
intmain(){
int num, i;
if(num<= 0) {
return0;
*p=i;
if(isPalindrome(i, p)) {
printf("%d\n", i);
return 0;
23a)
#include <stdio.h>
#include <string.h>
intmain(){
charstr1[100], str2[100];
int result;
scanf("%s", str1);
scanf("%s", str2);
if(result == 0) {
printf("Stringsare equal\n");
}else {
return 0;
23b)
#include <stdio.h>
intfindSum(intnum, int*p){
int i, sum=0;
if(*p%i== 0) {
sum += i;
return sum;
intmain(){
int num, i;
scanf("%d", &num);
if(num<= 0) {
return0;
*p=i;
if(findSum(i, p) ==i) {
printf("%d\n", i);
return 0;
23c)
#include <stdio.h>
intfindFactorial(int num){
if(num== 0) {
return1;
intfindSum(intnum) {
while (num!= 0) {
rem= num%10;
sum+= findFactorial(rem);
num/=10;
return sum;
intmain(){
int num, sum;
scanf("%d", &num);
if(num<= 0) {
return0;
sum=findSum(num);
if(sum== num) {
}else {
return 0;
24a)
#include <stdio.h>
#include <string.h>
intmain(){
charstr[100];
int length;
scanf("%s", str);
length= strlen(str);
return 0;
}
24b)
#include <stdio.h>
#include <stdbool.h>
boolis_prime(int n) {
if(n <= 1)
returnfalse;
if(n%i == 0)
returnfalse;
return true;
void print_primes(int*n) {
if(is_prime(i)) {
printf("%d\n", i);
intmain(){
int n;
scanf("%d", &n);
print_primes(&n);
return 0;
}
Thisprogramusesthe is_primefunctiontocheck ifa given number isprime, andthe
print_primesfunctiontoprint allprimenumbersbetween1 to N. ThevalueofN ispassedtothe
print_primesfunctionasapointer.
24c)
#include <stdio.h>
if(n == 0) {
returntrue;
if(!is_palindrome(reduced_number, original)){
returnfalse;
*original/=10;
if(last_digit !=*original%10){
returnfalse;
return true;
intmain(){
int n;
scanf("%d", &n);
if(is_palindrome(n, &n)) {
}else {
printf("The number isnot apalindrome.\n");
return 0;
25a)
#include <stdio.h>
#include <string.h>
intmain(){
charstr1[100], str2[100];
scanf("%s", str1);
scanf("%s", str2);
concatenate(str1, str2);
return 0;
}
25b)
#include <stdio.h>
#include <ctype.h>
if(isalpha(*str)){
(*vowels)++;
}else {
(*consonants)++;
str++;
intmain(){
charstr[100];
scanf("%s", str);
count_vowels_consonants(str, &vowels, &consonants);
return 0;
25c)
Write a Cprogramtofindwhetherthe given positive number isa perfect number ornot using
recursion
#include <stdio.h>
intis_divisor(intnumber, inti) {
if(i == 1){
return1;
if(number%i== 0) {
intis_perfect_number(intnumber){
if(sum== number) {
return1;
}
return 0;
intmain(){
int number;
scanf("%d", &number);
if(is_perfect_number(number)) {
}else {
return 0;
26a)
#include <stdio.h>
#include <string.h>
chartemp;
if(start>=end) {
return;
}
temp =*(str+ start);
*(str+end) =temp;
intmain(){
charstr[100];
scanf("%s", str);
return 0;
26b)
#include <stdio.h>
int temp, i, j;
intmain(){
sort_array(arr, size);
printf("Sortedarray: ");
int i;
printf("\n");
return 0;
26c)
#include <stdio.h>
intis_prime(int num) {
int i;
if(num<= 1){
return0;
}
if(num%i == 0) {
return0;
return 1;
intmain(){
int num;
scanf("%d", &num);
if(is_prime(num)) {
}else {
return 0;
27a)
#include <stdio.h>
#include <string.h>
void reverse_string(char *str) {
int i, j;
chartemp;
temp= *(str+i);
intmain(){
charstr[100];
scanf("%s", str);
reverse_string(str);
return 0;
27b)
#include <stdio.h>
int*largest(int*a, intn) {
int i, max=a[0];
max=a[i];
p=&a[i];
return p;
intmain(){
int i, n;
int a[100];
scanf("%d", &n);
scanf("%d", &a[i]);
return 0;
27c)
#include <stdio.h>
void interchange(int *a, intn) {
min= a[i];
min_index= i;
max=a[i];
max_index= i;
a[min_index] = max;
a[max_index] = min;
intmain(){
int i, n;
int a[100];
scanf("%d", &n);
scanf("%d", &a[i]);
interchange(a, n);
printf("Interchangedarray: ");
printf("%d", a[i]);
}
printf("\n");
return 0;
28a)
#include <stdio.h>
#include <string.h>
int i, j;
char*temp;
temp= a[i];
a[i] =a[j];
a[j] =temp;
}
intmain(){
int i, n;
char*a[100];
charstr[100];
scanf("%d", &n);
scanf("%s", str);
a[i] = strdup(str);
sort_strings(a, n);
printf("Sortedstrings: \n");
printf("%s\n", a[i]);
return 0;
28b)
#include <stdio.h>
intsum_array(int*a, intn) {
int i, sum=0;
for(i =0;i <n;i++) {
return sum;
intmain(){
scanf("%d", &n);
scanf("%d", &a[i]);
return 0;
28c)
#include <stdio.h>
int i;
returni;
return -1;
intmain(){
scanf("%d", &n);
scanf("%d", &a[i]);
scanf("%d", &key);
if(index== -1) {
printf("Elementnot found\n");
}else {
return 0;
#include <stdio.h>
#include <string.h>
#define MAX_CHARS256
void countFrequency(char*str) {
int count[MAX_CHARS];
count[i] =0;
count[str[i]]++;
if(count[i] > 0) {
intmain(){
charstr[100];
scanf("%s", str);
countFrequency(str);
return 0;
}
Thisprogramdemonstrateshowtofindthe frequencyofeach unique characterina string.
The countFrequencyfunctiontakesa stringstr asinput, createsanarraycount tostorethe
frequencyofeach character, initializesthe frequencyofeach characterto0, andthen
iteratesthroughthestringtocountthefrequencyof each character. Finally, thefunction
printsthe frequency ofeach uniquecharacter.The mainfunction readsthe stringfromthe
user, callsthe countFrequencyfunction, andreturns.
29b)
#include <stdio.h>
*arr= *end;
*end= temp;
arr++;
end--;
intmain(){
int size, i;
scanf("%d", &size);
int arr[size];
scanf("%d", &arr[i]);
reverseArray(arr, size);
printf("The elementsofthearrayin reverse orderare: ");
printf("%d", arr[i]);
return 0;
29c)
#include <stdio.h>
int i, j;
intmain(){
int size, i;
int arr[size];
scanf("%d", &arr[i]);
bubbleSort(arr, size);
printf("%d", arr[i]);
return 0;
30a)
#include <stdio.h>
#include <string.h>
int i, j;
if(str[i]== c) {
len--;
i--;
str[len] ='\0';
intmain(){
charstr[100];
charc;
scanf("%s", str);
deleteChar(str, c);
return 0;
30b)
#include <stdio.h>
#include <string.h>
#define MAX_STRINGS100
intmain(){
int n;
charstrings[MAX_STRINGS][MAX_LENGTH];
char*sortedStrings[MAX_STRINGS];
scanf("%d", &n);
scanf("%s", strings[i]);
sortedStrings[i] =strings[i];
printf("Sortedstrings:\n");
printf("%s\n", sortedStrings[i]);
return 0;
30c)
#define MAX_ROWS100
#define MAX_COLS100
int i, j;
transposed[j][i] =mat[i][j];
intmain(){
printf("Enterthematrix:\n");
scanf("%d", &mat[i][j]);
printf("Thetransposedmatrixis:\n");
printf("%d", transposed[i][j]);
}
printf("\n");
return0;
31a)
#include <stdio.h>
int temp=a;
a =b;
b=temp;
int temp=*a;
*a =*b;
*b= temp;
intmain()
swap_val(x, y);
swap_ref(&x, &y);
printf("Aftercall-by-reference: x=%d, y =%d\n", x, y);
return 0;
Aftercall-by-value: x=10, y= 20
31c)
#include <stdio.h>
intmain(){
int m, n, p, q, c, d, k, sum=0;
for(c= 0;c<m;c++)
scanf("%d", &first[c][d]);
else {
printf("Enter theelementsofsecondmatrix\n");
scanf("%d", &second[c][d]);
for (c=0;c<m;c++) {
multiply[c][d]= sum;
sum= 0;
printf("Productofthe matrices:\n");
for (c=0;c<m;c++) {
printf("%d\t", multiply[c][d]);
printf("\n");
return 0;
Pattern().
SRM-UNIVERSITY
SRM-UNIVERSIT
SRM-UNIVERSI
SRM-UNIVERS
SRM-UNIVER
SRM-UNIV
SRM-UNI
SRM-UN
SRM-U
SRMSRM
SR
SR
SRM
SRMSRM-U
SRM-UN
SRM-UNI
SRM-UNIV
SRM-UNIVE
SRM-UNIVER
SRM-UNIVERS
SRM-UNIVERSI
SRM-UNIVERSIT
SRM-UNIVERSITY
#include <stdio.h>
void Pattern(int n) {
int i, j;
printf("SRM-UNIVERSITY\n"[j]);
printf("\n");
printf("\n");
intmain(){
int n =15;
Pattern(n);
return 0;