Data Structure Using C_Sample
Data Structure Using C_Sample
Sample Program
1. Write a program for declaring and utilizing an array.
#include <stdio.h>
int main() {
int numbers[5]; // Declares an integer array with a size of 5 elements
return 0;
}
Output:
Values in the array: 10 20 30 40 50
Output
Enter the number to check prime:56
Number is not prime
#include<stdio.h>
int main()
int n,r,sum=0,temp;
scanf("%d",&n);
temp=n;
while(n>0)
r=n%10;
sum=(sum*10)+r;
n=n/10;
if(temp==sum)
else
printf("not palindrome");
return 0;
Output
#include<stdio.h>
#include<stdlib.h>
int main(){
int a[10][10],b[10][10],mul[10][10],r,c,i,j,k;
system("cls");
scanf("%d",&r);
scanf("%d",&c);
for(i=0;i<r;i++)
{
for(j=0;j<c;j++)
scanf("%d",&a[i][j]);
for(i=0;i<r;i++)
for(j=0;j<c;j++)
scanf("%d",&b[i][j]);
for(i=0;i<r;i++)
for(j=0;j<c;j++)
mul[i][j]=0;
for(k=0;k<c;k++)
mul[i][j]+=a[i][k]*b[k][j];
for(i=0;i<r;i++)
for(j=0;j<c;j++)
{
printf("%d\t",mul[i][j]);
printf("\n");
return 0;
Output