Assignment 1

1.
#include<stdio.h>
#include<stdlib.h>
int num(int n)
{
int count=0;
while(n>0)
{
n=(n/10);
count++;
}
return count;
}
int main()
{
 int a;
printf("Enter no.:");
scanf("%d",&a);
printf("No. of digits in %d is :%d",a,num(a));
}
2.
#include<stdio.h>
#include<stdlib.h>
int reverse(int num)
{
int rev=0;
while(num>0)
{
rev=rev*10+(num%10);
num=(num/10);
}
return rev;
}
int main()
{
int a;
printf("Enter no.:");
scanf("%d",&a);
printf("Reverse of %d is:%d",a,reverse(a));
}
3.
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
int binary(int num)
{
int bi=0,i=0;
while(num>0)
{
bi=(num%2)*(pow(10,i))+bi;
num=(num/2);
i++;
}
return bi;
}
int main()
{
 int a;
printf("Enter no.");
scanf("%d",&a);
printf("Binary equivalent of %d is :%d",a,binary(a));
}
4.
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
int binary(int num)
{
int bi=0,i=0;
while(num>0)
{
bi=(num%8)*(pow(10,i))+bi;
num=(num/8);
i++;
}
return bi;
}
int main()
{
int a;
printf("Enter no.");
scanf("%d",&a);
printf("Binary equivalent of %d is :%d",a,binary(a));
}
5.
#include<stdio.h>
#include<math.h>
#include<stdlib.h>
int *binary(int num,int *count)
{
int bi=0,i=0;
int *arr=(int *)malloc(100*sizeof(int));
while(num>0)
{
if((num%16)<10)
arr[i]=48+(num%16);
else
arr[i]=97+(num%16)-10;
num=(num/16);
i++;
(*count)++;
}
return arr;
}
int main()
{
int i,a,count=0;
printf("Enter no.");
scanf("%d",&a);
int *arr=(int *)malloc(100*sizeof(int));
arr=binary(a,&count);
for(i=count-1;i>=0;i--)
printf("%c",arr[i]);
}
6.
#include<stdio.h>
#include<stdlib.h>
int length(char *string)
{
int count=0,i=0;
while(*(string+i)!='\0')
{
count++;
i++;
}
return count-1;
}
int main()
{
char *string=(char *)malloc(100*sizeof(char));
printf("Enter string:");
fgets(string,100,stdin);
printf("Length of string is:%d",length(string));
}
7.
#include<stdio.h>
#include<stdlib.h>
int length(char *string)
{
int count=0,i=0;
while(*(string+i)!='\0')
{
 if(*(string+i)!=' ')
count++;
i++;
}
return count-1;
}
int main()
{
char *string=(char *)malloc(100*sizeof(char));
printf("Enter string:");
fgets(string,100,stdin);
printf("Length of string is:%d",length(string));
}
8.
#include<stdio.h>
#include<stdlib.h>
int length(char *string)
{
int count=0,i=0;
while(*(string+i)!='\0')
{

if(*(string+i)=='A'||*(string+i)=='E'||*(string+i)=='I'||*(st
ring+i)=='O'||*(string+i)=='U'||*(string+i)=='a'||*(string+i)=='e'
||*(string+i)=='i'||*(string+i)=='o'||*(string+i)=='u')
count++;
i++;
}
 return count-1;
}
int main()
{
char *string=(char *)malloc(100*sizeof(char));
printf("Enter string:");
fgets(string,100,stdin);
printf("Length of string is:%d",length(string));
}
9.
#include<stdio.h>
#include<stdlib.h>
float mean(int *arr,int n)
{
int i,sum=0;
for(i=0;i<n;i++)
sum+=*(arr+i);
return sum/n;
}
int main()
{
int n,i;
printf("Enter no. of elements:");
scanf("%d",&n);
int *arr=(int *)malloc(n*sizeof(int));
printf("Enter elements:");
for(i=0;i<n;i++)
scanf("%d",arr+i);
 printf("Mean of elements in array:%f",mean(arr,n));
}
10.
#include<stdio.h>
#include<stdlib.h>
#include<math.h>
int prime(int num)
{
int i,count=0;
if(num==1)
return 1;
for(i=2;i<sqrt(num);i++)
{
if(num%i==0)
return 0;
}
return 1;
}
int main()
{
int num;
printf("Enter no.:");
scanf("%d",&num);
if(prime(num))
printf("%d is a prime no.",num);
else
printf("%d is not a prime no.",num);
}
11.
#include<stdio.h>
#include<stdlib.h>
void divisors(int num)
{
int i=2;
printf("1\t");
while(num!=1)
{
while((num%i)==0)
{
printf("%d\t",i);
num/=i;
}
i++;
}
}
int main()
{
int num;
printf("Enter no.:");
scanf("%d",&num);
divisors(num);
}
12.
#include<stdio.h>
#include<stdlib.h>
float mean(int *arr,int n)
{
int sum=0,i;
for(i=0;i<n;i++)
sum+=*(arr+i);
return (sum/n);
}
int main()
{
int n,i;
printf("Enter no. of elements:");
scanf("%d",&n);
int *arr=(int *)malloc(n*sizeof(int));
printf("Enter elements:");
for(i=0;i<n;i++)
{
scanf("%d",arr+i);
}
float avg mean(arr,n);
for(i=0;i<n;i++)
{
if(*(arr+i)>avg)
printf("%d\t",*(arr+i));
}
}
13.
#include<stdio.h>
#include<stdlib.h>
void display(int **arr,int n,int m)
{
int i,j;
for(i=0;i<n;i++)
for(j=0;j<m;j++)
printf("%d",*(*(arr+i)+j)+2);
}
int main()
{
int n,m,i,j;
printf("Enter no. of rows:");
scanf("%d",&n);
printf("Enter no. of columns:");
scanf("%d",&m);
int *arr[n];
for(i=0;i<n;i++)
{
arr[i]=(int *)malloc(m*sizeof(int));
for(j=0;j<m;j++)
scanf("%d",*(arr+i)+j);
}
display(arr,n,m);
}
14.
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int palindrome(char *string)
{
 int i,j,n=strlen(string),count=0;
printf("%d\n",n);
for(i=0,j=n-2;i<=j;i++,j--)
if(string[i]==string[j])
count++;
if(count==(n)/2)
return 1;
return 0;
}
int main()
{
char *string=(char *)malloc(100*sizeof(char));
fgets(string,100,stdin);
if(palindrome(string))
printf("String is palindrome.");
else
printf("String is not a palindome.");
}
15.
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
int palindrome(char *string1,char *string2)
{
int i,j,n1=strlen(string1),n2=strlen(string2),count=0;
for(i=0,j=0;i<n1-1&&j<n2-1;i++,j++)
if(string1[i]==string2[j])
count++;
 if(n1==n2&&count==n1-1)
return 1;
return 0;
}
int main()
{
char *string1=(char *)malloc(100*sizeof(char));
char *string2=(char *)malloc(100*sizeof(char));
printf("Enter string 1:");
fgets(string1,100,stdin);
printf("Enter string 2:");
fgets(string2,100,stdin);
if(palindrome(string1,string2))
printf("String1 and string2 are same.");
else
printf("String1 and string2 are not same.");
}
21)
#include <stdio.h>
int main() {
int m, n, c, d, first[10][10], second[10][10];
printf("Enter the number of rows and columns of matrix\n");
scanf("%d%d", &m, &n);
printf("Enter the elements of first matrix\n");
for (c = 0; c < m; c++)
for (d = 0; d < n; d++)
scanf("%d", &first[c][d]);
printf("Enter the elements of second matrix\n");
for (c = 0; c < m; c++)
for (d = 0 ; d < n; d++)
scanf("%d", &second[c][d]);
printf("Sum of entered matrices:-\n");
for (c = 0; c < m; c++)
{
for (d = 0 ; d < n; d++)
{
first[c][d] = first[c][d] + second[c][d];
printf("%d\t", first[c][d]);
}
printf("\n");
}
return 0;
}

22)
#include <stdio.h>
int main() {
int m, n, c, arr[50];
printf("Enter the number of elements\n");
scanf("%d", &m);
printf("Enter the elements \n");
for (c = 0; c < m; c++)
scanf("%d", &arr[c]);
for (c = 0; c < m-1; c++)
{
if(arr[c]<arr[c+1])
n = arr[c+1];
}
printf("%d\t", n);
}
printf("\n");
}
return 0;
}

23)
#include <stdio.h>
#include <string.h>
int main()
{
char str[100];
inti, j, k;
printf("\n Please Enter any String : ");
gets(str);
for(i = 0; i<strlen(str); i++)
{
for(j = i + 1; str[j] != '\0'; j++)
 {
if(str[j] == str[i])
{
for(k = j; str[k] != '\0'; k++)
{
str[k] = str[k + 1];
}
}
}
}
printf("\n The Final String after Removing All Duplicates = %s ",
str);
return 0;
}

24)

#include <stdio.h>
int main() {
intarr[100], freq[100]; int size, i, j, count;
printf("Enter size of array: ");
scanf("%d", &size);
printf("Enter elements in array: ");
for(i=0; i<size; i++) {
scanf("%d", &arr[i]);
freq[i] = -1;
}
for(i=0; i<size; i++) {
count = 1;
for(j=i+1; j<size; j++) {
if(arr[i]==arr[j]) {
count++;
freq[j] = 0;
}}
if(freq[i] != 0) { freq[i] = count;
}}
printf("\nFrequency of all elements of array : \n");
for(i=0; i<size; i++) {
if(freq[i] != 0) {
printf("%d occurs %d times\n", arr[i], freq[i]);
}}
return 0;
}

25)
#include <stdio.h>
#include <string.h>
void count(char str[]);
int main() {
char text[80];
printf("Enter a string : ");
gets(text);
count(text);
return 0;
}
void count(char str[]) {
inti, j, count;
for (i = 0; str[i] != '\0'; i++)
{
count = 0;
for (j = 0; str[j] != '\0'; j++)
{
if (str[j] == str[i])
{
count++;
}}
printf("%c : %d\n", str[i], count);
}}

26-- #include <stdio.h>

#include <string.h>

void reverse(char [], int, int);

int main()
{
char str1[20];
int size;

printf("Enter a string to reverse: ");

scanf("%s", str1);
size = strlen(str1);
reverse(str1, 0, size - 1);
printf("The string after reversing is: %s\n", str1);
return 0;
}

void reverse(char str1[], int index, int size)

{
char temp;
temp = str1[index];
str1[index] = str1[size - index];
str1[size - index] = temp;
if (index == size / 2)
{
return;
}
reverse(str1, index + 1, size);
}
27-#include<stdio.h>
Intchecksym(int a[10][10],int b[10][10]);
int main()
{
int m, n, c, d, matrix[10][10], transpose[10][10];

printf("Enter the number of rows and columns of matrix\n");

scanf("%d%d", &m, &n);
printf("Enter elements of the matrix\n");

for (c = 0; c < m; c++)

for (d = 0; d < n; d++)
scanf("%d", &matrix[c][d]);

for (c = 0; c < m; c++)

for (d = 0; d < n; d++)
transpose[d][c] = matrix[c][d];
checksym(matrix ,transpose) ;
}
Int checksym(a[10][10],b[10][10])
{
Int m,c,d,n ;
if (m == n)
{
for (c = 0; c < m; c++)
{
for (d = 0; d < m; d++)
{
if (a[c][d] = b[c][d])
}}}

printf("The matrix is symmetric.\n");

else
printf("The matrix isn't symmetric.\n");
return 0;
}

29- -#include<stdio.h>
Intnewmat(int a[10][10]);
intmain()
{
int m, n, c, matrix[10][10];

printf("Enter the number of rows and columns of matrix\n");

scanf("%d%d", &m, &n);
printf("Enter elements of the matrix\n");
for (c = 0; c < m; c++)
for (d = 0; d < n; d++)
scanf("%d", &matrix[c][d]);
printf(after multiply by -2 the matrix is"%d",newmat(matrix));
}
Intnewmat(a[10][10])
{
intc,d,m,n;
for (c = 0; c < m; c++)
for (d = 0; d < n; d++)
new[c][d] =-2*matrix[c][d] ;
for (c = 0; c < m; c++)
for (d = 0; d < n; d++)
printf("%d",new[c][d]);
return 0;
}

30--#include<stdio.h>
Intnewmat(int a[10][10]);
intmain()
{
int m, n, c, matrix[10][10];

printf("Enter the number of rows and columns of matrix\n");

scanf("%d%d", &m, &n);
printf("Enter elements of the matrix\n");

for (c = 0; c < m; c++)

for (d = 0; d < n; d++)
scanf("%d", &matrix[c][d]);
printf(after squar the elements of matrix is the matrix
is"%d",newmat(matrix));
}
Intnewmat(a[10][10])
{
intc,d,m,n;
for (c = 0; c < m; c++)
for (d = 0; d < n; d++)
new[c][d] =matrix[c][d]*matrix[c][d] ;
for (c = 0; c < m; c++)
for (d = 0; d < n; d++)
printf("%d",new[c][d]);
return 0;
}
33)
#include<stdio.h>
main()
{
inti,j;
for(i=1;i<=9;i++)
{
for(j=1;j<=i;j++)
printf("%d",i);
printf("\n");
}
}

34)
#include<stdio.h>
main()
{
inti,j;
for(i=1;i<=9;i++)
{
for(j=1;j<=i;j++)
printf("%d",j);
printf("\n");
}
}

35)
#include<stdio.h>
main()
{
inti,j,k,l;
for(i=1;i<=5;i++)
{
for(j=1;j<=i;j++)
printf("%d",j);
printf("\n");
}
for(k=4;k>=1;k--)
{
#include<stdio.h>
main()
{
inti,j,k,l;
for(i=1;i<=5;i++)
{
for(j=1;j<=i;j++)
printf("%d",j);
36)
#include<stdio.h>
main()
{
inti,j,k,l;
for(i=1;i<=7;i++)
{
for(j=7;j>=i;j--)
printf(" ");
for(k=1;k<=i;k++)
printf("%d",k);
for(l=2;j<=i;j++)
printf("%d",l);
printf("\n");
}
}
38-
#include<stdio.h>
int main(){
int i,j,k;
for(i=1;i<=7;i++){
for(k=7-i;k>=0;k--)
printf(" ");
for(j=1;j<=i;j++)
printf("%d", j);
printf("\n");
}
}
39-
#include<stdio.h>
int main(){
int i,j,k,m;
for(i=1;i<=9;i++){
for(j=9-i;j>=0;j--)
printf (" ");
for(k=1;k<=i;k++)
printf("%d", k);
for(m=i-1;m>=1;m--)
printf("%d", m);
printf("\n");
}
return 0;}
40-
#include<stdio.h>
int main(){
int i,j,k,m;
for(i=9;i>=1;i--){
for(j=9-i;j<=8;j++)
printf(" ");
for(k=1;k<=i;k++)
printf("%d", k);
for(m=i-1;m>=1;m--)
printf("%d", m);
printf("\n");
}return 0;}
41-
#include<stdio.h>
int main(){
int i,j,m,k;
for(i=1;i<=4;i++){
for(j=1;j<=i*2-1;j++)
printf("*");
for(m=9;m>=0;m=m-2)
printf(" ");
for(k=1;k<=i*2-1;k++)
printf("*");

printf("\n");
}
return 0;}
Qn43
#include<stdio.h>
int main(){
int i,j,d;
for(i=0;i<9;i++){
 for(j=0;j<9;j++){
if(((j<=i&&j<=8-i)||j>=i&&j>=8-i)&&(j+i)%2==0){
printf("*");}
else
printf(" ");
}
printf("\n");
}

return 0;
}

Qn44
#include<stdio.h>
int main(){
int i,j,d;
for(i=0;i<9;i++){
for(j=0;j<9;j++){
if(((i>=j&&i>=8-j)||i<=j&&i<=8-j)&&(j+i)%2==0){
printf("*");}
else
printf(" ");
}
printf("\n");
}

return 0;
}