Professional Documents
Culture Documents
Course Code-PCC-CS(AIML)391
1. #include<stdio.h>
int main()
int ar[20],pos,len,i,element;
scanf("%d",&len);
for(i=0;i<len;i++)
scanf("\n %d",&ar[i]);
printf("ar[%d]=%d",i,ar[i]);
scanf("%d",&pos);
scanf("%d",&element);
//inserting element------------------
for(i=len;i>=pos;i--)
if(i!=pos)
ar[i]=ar[i-1];
else
ar[pos]=element;
for(i=0;i<=len;i++)
printf("\n %d",ar[i]);
OUTPUT:
enter length of the array:5
Enter elements:78
ar[0]=78
90
ar[1]=90
4576
ar[2]=4576
45
ar[3]=45
23
ar[4]=23
enter the position to be inserted:3
78
90
4576
-90
45
23
2. #include<stdio.h>
int main()
int ar[10],n,pos,i;
scanf("%d",&n);
scanf("%d",&pos);
for(i=0;i<n;i++)
scanf("%d",&ar[i]);
printf("\n ar[%d]=%d",i,ar[i]);
printf("\n");
for(i=pos;i<n-1;i++)
ar[i]=ar[i+1];
n--;
for(i=0;i<n;i++)
printf("\n ar[%d]=%d",i,ar[i]);
OUTPUT:
Enter the number of elements:5
ar[0]=0
1
ar[1]=1
2
ar[2]=2
3
ar[3]=3
4
ar[4]=4
ar[0]=0
ar[1]=1
ar[2]=3
ar[3]=4
3. #include<stdio.h>
int main()
int ar[10],i,l;
scanf("%d",&l);
//creating the array and printing it----------------
for (i=0;i<l;i++)
scanf("\n %d",&ar[i]);
printf("\n ar[%d]=%d",i,ar[i]);
for(i=l-1;i>=0;i--)
printf("\n ar[%d]=%d",i,ar[i]);
return 0;
OUTPUT:
Enter the length of the array: 5
ar[0]=0
1
ar[1]=1
2
ar[2]=2
3
ar[3]=3
4
ar[4]=4
ar[4]=4
ar[3]=3
ar[2]=2
ar[1]=1
ar[0]=0
4. #include<stdio.h>
int size=10;
int stack[20];
int top=-1;
int isEmpty()
if(top==-1)
return 1;
else
{
return 0;
int isFull()
if(top==size-1)
return 1;
else
return 0;
int pop()
int element;
if(isEmpty())
else
element=stack[top];
top--;
return element;
}
if(isFull())
else
top++;
stack[top]=item;
int main()
int i,dlt;
push(10);
push(20);
push(30);
push(40);
push(50);
push(60);
push(70);
push(80);
push(90);
push(100);
for(i=top;i>=0;i--)
printf("\n %d",stack[i]);
dlt=pop();
for(i=top;i>=0;i--)
printf("\n %d",stack[i]);
return 0;
OUTPUT:
Stack elements before pop operation:
100
90
80
70
60
50
40
30
20
10
The deleted item of the Stack=100
Stack after pop operation:
90
80
70
60
50
40
30
20
10
-----------------X----------------