| s.no |
question |
Answer |
time |
link |
| 1) |
find the smallest integers |
#include
int main()
{
int i, num[5], smallest = 0, stop = 0;
while( stop != -1)
{
printf("Enter 5 integers separated by a space: ");
for(i=0;i <=4;i++)
scanf_s("%d", &num[i]);
smallest = num[0];
for(i=1;i<=4;i++)
if(num[i] < smallest)
smallest = num[i];
printf("The smallest number among ");
for(i=0;i <=4;i++)
printf("%d ", num[i]);
printf("is %d\n", smallest);
printf("\nMore data? -1 to stop, others to continue: ");
scanf_s("%d", &stop);
}
return 0;
}
|
15min |
|
| 2 |
Accessing Array Elements |
#include
int main ()
{
int n[ 10 ];
int i,j;
for ( i = 0; i < 10; i++ )
{
n[ i ] = i + 100;
}
for (j = 0; j < 10; j++ )
{
printf("Element[%d] = %d\n", j, n[j] );
}
return 0;
}
|
15 min |
|
| 3) |
dynamic implementation |
#include
#define ROW 10
#define COL 12
int sum(int *a[]);
main()
{
int **array;
int i,j;
array = (int **) malloc(ROW * sizeof(int *));
for (i = 0; i < ROW; i++)
for (i = 0; i < ROW; i++)
for (j = 0; j < COL; j++)
array[i][j] = i*j;
printf("sum = %d\n", sum(array));
}
int sum(int *a[])
{
int i, j;
int sum = 0;
for (i = 0; i < ROW; i++)
{
for (j = 0; j < COL; j++)
{
sum += a[i][j];
printf("%4d", a[i][j]);
printf("\n");
}
return 0;
} |
5min |
|
| 4) |
calculating the factorial of
an integer number |
#include
int factorial( int num );
main()
{
int n;
printf("Enter an integer: ");
scanf("%d", &n);
printf("%d! = %d\n", n, factorial(n));
}
int factorial( int num )
{
int i, result = 1;
for (i = 2; i <= num; i++)
result *= i;
return 0;
} |
15min |
|
| 5) |
Sort n values using insertion sort method |
#include < stdio.h >
#include < conio.h >
void main()
{
int a[50],n;
clrscr();
printf("\nEnter n:");
scanf("%d",&n);
insert_sort(a,n);
printf("\n%d values after sorting are ",n);
print_data(a,n);
}
int insert_sort(int a[],int n)
{
int bottom,i,j,t;
bottom=-1;
for(j=0;j < n;j++)
{
printf("\nData :");
scanf("%d",&t);
i=bottom;
while(a[i]>t && i!=-1)
{
a[i+1]=a[i];
i--;
}
a[i+1]=t;
bottom++;
}
return;
}
int print_data(int a[],int n)
{
int i;
for(i=0;i < n;i++)
{
printf("%4d",a[i]);
}
return;
} |
15min |
|
| 6) |
Insert and delete operations are performed on circular queue |
# include < stdio.h >
# include < conio.h >
# define max 10
void main()
{
int cqueue[max], data;
int front, rear, reply, option;
clrscr();
front = rear = 0;
do
{
printf("\n C Language program to implement basic operations on a Circular Queue \n");
printf("\n 1. Insert number in a Circular Queue");
printf("\n 2 .Delete number from Circular Queue");
printf("\n 3. Exit \n");
printf("\n Select proper option ( 1 / 2 / 3 ) : ");
scanf("%d", &option);
switch(option)
{
case 1 :
printf("\n Enter number: ");
scanf("%d", &data);
reply = insq(cqueue, &front, &rear, &data);
if(reply == -1)
printf("\n Circular Queue is Full \n");
else
printf("\n Number %d is inserted in a Circular Queue \n", data);
break;
case 2 :
reply = delq(cqueue, &front, &rear,&data);
if(reply == -1)
printf("\n Circular Queue is Empty \n");
else
printf("\n %d is deleted from Circular Queue \n", data);
printf("\n");
break;
case 3 : exit(0);
}
}while(1);
}
int insq(int cqueue[max], int *front, int *rear, int *data)
{
if((*rear + 1) % max == *front)
return(-1);
else
{
*rear = (*rear + 1) % max;
cqueue[*rear] = *data;
return(1);
}
}
int delq(int cqueue[max], int *front, int *rear, int *data)
{
if(*front == *rear)
return(-1);
else
{
*front = (*front + 1) % max;
*data = cqueue[*front];
return(1);
}
}
|
5min |
|
| 7) |
Pointers to read long number and split it into odd and even |
#include < stdio.h >
#include < conio.h >
#include < alloc.h >
void main()
{
long *n,*n1,*n2,*m1,*m2,r;
clrscr();
n=(long*)malloc(sizeof(long));
n1=(long*)malloc(sizeof(long));
n2=(long*)malloc(sizeof(long));
m1=(long*)malloc(sizeof(long));
m2=(long*)malloc(sizeof(long));
printf("\n Enter n:");
scanf("%ld",n);
*n1=*n2=0;
*m1=*m2=1;
while(*n!=0)
{
r=*n % 10;
*n=*n / 10;
if(r % 2 ==0)
{
r=r * *m2;
*n2=*n2 + r;
*m2=*m2 * 10;
}
else
{
r=r* *m1;
*n1=*n1 + r;
*m1=*m1 * 10;
}
}
printf("\n n1=%ld n2=%ld",*n1,*n2);
} |
5min |
|
| 8) |
Simple Sort method |
#include < stdio.h >
#include < conio.h >
void main()
{
int a[20], i, n;
clrscr();
printf("\n C Language Program to implement a Simple Sort method on a Numeric Array \n");
printf("\n Enter How Many Numbers [ i.e. Size of Array (n) ] : ");
scanf("%d", &n);
printf("\n Enter %d values \n",n);
for(i = 0; i < n; i++)
scanf("%d", &a[i]);
printf("\n%d Values Before Sorting are \n",n);
printf("\n");
for(i = 0; i < n; i++)
printf("%5d", a[i]);
printf("\n");
simple_sort(a,n);
printf("\n%d Values After Sorting are \n",n);
printf("\n");
for(i = 0; i < n; i++)
printf("%5d", a[i]);
printf("\n");
}
int simple_sort(int a[], int n)
{
int i, j, t;
for(i = 0; i < n-1; i++)
{
for(j = i+1; j < n; j++)
{
if( a[i] > a[j] )
{
t = a[i];
a[i] = a[j];
a[j] = t;
}
}
}
return;
} |
5min |
|
|
C PROGRAM