Program to do Matrix Multiplication

void main()
{
int a[10][10],b[10][10],c[10][10];
int i,j,k,r1,c1,r2,c2;
clrscr();
printf("\n how many rows n columns are in matrix a");
scanf("%d%d",&r1,&c1);
printf("\n Enter the elements of matrix a");
for(i=0;i

{

for(j=0;j {

scanf("%d",&a[i][j]);

}

printf("\n");

}

printf("\n how many rows n columns are in matrix b");
scanf("%d%d",&r2,&c2);
printf("\n Enter the elemnts of matrix b");
for(i=0;i {

for(j=0;j {

scanf("%d",&b[i][j]);

}

printf("\n");

}

if(c1!=r2)
{
printf("\n matrix mul is nt possible");
exit();
}
printf("\n result is :\n");
for(i=0;i {
for(j=0;j {
c[i][j]=0;
for(k=0;k

{
c[i][j]=c[i][j]+a[i][k]*b[k][j];
}//for k
}
}

printf("\n result is \n");
for(i=0;i

{

for(j=0;j

{

printf("\t%d",c[i][j]);

}

printf("\n");

}

Program to implement Operations of Queue

void main()
{
int a[10],front,rear,item,ch,i;
clrscr();
front=-1;
rear=-1;
while(1)
{
printf("\n\t\t****MENU****\n");
printf("\n 1.Insert\n 2.Delete\n 3.Display \n 4.Exit");
printf("\n\n Enter your Choice :");
scanf("%d",&ch);
switch(ch)
{
case 1:
if(rear==9)
{
printf("\nQueue is full\n");
}
else
{
rear=rear+1;
printf("\n Enter the item you want to insert:");
scanf("%d",&item);
a[rear]=item;
}
break;
case 2:
if(front==rear)
{
printf("\n queue is empty\n");
}
else
{
front++;
printf("\n Deleted:%d",a[front]);

}

break;
case 3:
for(i=front+1;i<=rear;i++)
{
printf("\n %d",a[i]);
}
break;
case 4:
exit();
}//switch
}//while
}//main