Practical DSUC
Practical DSUC
Practical DSUC
// Inser on in Array...
#include<stdio.h>
for(int i=0;i<n;i++)
prin ("%d\t",arr[i]);
prin ("\n");
void arrInser on(int arr[], int size, int element, int index){
for(int i=size-1;i>=index;i--)
arr[i+1]=arr[i];
arr[index]=element;
int main(){
int size=5;
int element=6;
int index=1;
arrInser on(arr,size,element,index);
size=size+1;
display(arr,size);
}
Q.NO2. Write a program to delete an element from an array.
// Dele on in Array...
#include<stdio.h>
for(int i=0;i<n;i++)
prin ("%d\t",arr[i]);
prin ("\n");
for(int i=index;i<size;i++)
arr[i]=arr[i+1];
int main(){
int size=5;
int index=2;
arrInser on(arr,size,index);
size=size-1;
display(arr,size);
}
Q.NO3. Write a program to implement stack using array.
#include <stdio.h>
int stack[100],i,j,choice=0,n,top=-1;
void push();
void pop();
void show();
void main ()
scanf("%d",&n);
prin ("\n----------------------------------------------\n");
while(choice != 4)
prin ("\n1.Push\n2.Pop\n3.Show\n4.Exit");
scanf("%d",&choice);
switch(choice)
case 1:
push();
break;
case 2:
{
pop();
break;
case 3:
show();
break;
case 4:
break;
default:
};
void push ()
int val;
if (top == n )
else
scanf("%d",&val);
top = top +1;
stack[top] = val;
void pop ()
if(top == -1)
prin ("Underflow");
else
void show()
for (i=top;i>=0;i--)
prin ("%d\n",stack[i]);
if(top == -1)