Author: admin

//TRAVERSING OF ARRAY// #include<stdio.h> #include<conio.h> void main() { int n,i,k,LB,UB,A[10]; clrscr(); printf(“Enter the total number of elements of array:”); scanf(“%d”,&n); printf(“Enter the elements in the array:\n”); for(i=1;i<=n;i++) { printf(“Element number …

/*PROGRAM TO PERFORM PUSH OPERATION ON STACK USING ARRAY*/ #include<conio.h> #include<stdio.h> #include<stdlib.h> #define MAX 5 void main() { int top=0,n,a[MAX],i; char ch; clrscr(); //PUSH OPERATION printf(“Pushing elements into the stack: …

/*PROGRAM TO PERFORM POP OPERATION ON STACK USING ARRAY*/ #include<conio.h> #include<stdio.h> #define MAX 5 void main() { int maxstk,top=-1,n,a[MAX],i; char ch; clrscr(); //PUSH OPERATION printf(“Pushing elements into the stack: \n”); …

/*PROGRAM TO MERGE TWO ARRAYS*/ #include<conio.h> #include<stdio.h> #define MAX1 10 #define MAX2 5 void main() { int n1=0,n2=0,a[MAX1],b[MAX2],num,i,j; char ch; clrscr(); printf(“Enter elements in the first array:  \n”); do { …

/*PROGRAM TO INSERT AN ELEMENT AT POSITION K IN THE ARRAY*/ #include<stdio.h> #include<conio.h> #define MAX 10 void main() { int p,i,a[MAX]={2,3,4,5},n=4,num; char ch; clrscr(); printf(“Currently elements in the array are: …

//TO FIND AN ELEMENT USING BINARY SEARCH// #include<stdio.h> #include<conio.h> void main() { int n,i,k,ptr,lb,ub,beg,end,mid,loc,item,temp,A[10]; clrscr(); printf(“Enter the total number of elements of the array: “); scanf(“%d”,&n); printf(“Enter the elements in …

/*PROGRAM TO DELETE AN ELEMENT FROM Kth POSITION IN THE ARRAY*/ #include<conio.h> #include<stdio.h> #define MAX 10 void main() { int p,i,a[MAX],n=0,num; char ch; clrscr(); printf(“Inserting elements in the array:”); do …

/*PROGRAM TO IMPLEMENT PUSH OPERATION ON STACK USING LINKED LIST*/ #include<conio.h> #include<stdio.h> struct node { int data; struct node *link; }; void main() { struct node *top=NULL,*ptr,*temp; int num; char …

/*PROGRAM TO IMPLEMENT POP OPERATION ON STACK USING LINKED LIST*/ #include<conio.h> #include<stdio.h> #include<stdlib.h> struct node { int data; struct node *link; }; void main() { struct node *top=NULL,*ptr,*temp; int num; …