week-15x
Download as DOC, PDF0 likes295 views
This document contains C code to implement a stack using arrays and pointers. It defines functions for push, pop, and display operations on the stack. The main function provides a menu for testing these stack operations and switches between the array and pointer implementations. The push function inserts elements into the stack, pop removes and returns elements, and display prints out the current stack contents.
![/* Write C programs that implement stack (its operations) using i) Arrays */
#include<stdio.h>
#include<conio.h>
int st_arr[20];
int t=-1;
void push_ele(int ele);
int pop_ele();
void display_ele();
void main()
{
char choice,num1=0,num2=0;
while(1)
{
clrscr();
printf("======================================");
printf("ntt MENU ");
printf("n======================================");
printf("n[1] Using Push Function");
printf("n[2] Using Pop Function");
printf("n[3] Elements present in Stack");](https://image.slidesharecdn.com/6846231/85/week-15x-1-320.jpg)
![printf("n[4] Exitn");
printf("ntEnter your choice: ");
fflush(stdin);
scanf("%c",&choice);
switch(choice-'0')
{
case 1:
{
printf("ntElement to be pushed: ");
scanf("%d",&num1);
push_ele(num1);
break;
}
case 2:
{
num2=pop_ele(1);
printf("ntElement to be popped: %dnt",num2);
getch();
break;
}](https://image.slidesharecdn.com/6846231/85/week-15x-2-320.jpg)
![getch();
exit(1);
}
st_arr[++t]=ele;
}
/*Implementing the pop() function. */
int pop_ele()
{
int ele1;
if(t==-1)
{
printf("ntSTACK is Empty.n");
getch();
exit(1);
}
return(st_arr[t--]);
}
/*Implementing display() function. */
void display_ele()
{
int k;
printf("ntElements present in the stack are:nt");](https://image.slidesharecdn.com/6846231/85/week-15x-4-320.jpg)
![for(k=0;k<=t;k++)
printf("%dt",st_arr[k]);
}
/* Write C programs that implement stack (its operations) using ii) Pointers */
#include<stdio.h>
#include<conio.h>
struct st_point
{
int ele;
struct st_point *l;
}
*t;
int i;
void push_ele(int j);
int pop_ele();
void display_ele();
void main()
{](https://image.slidesharecdn.com/6846231/85/week-15x-5-320.jpg)
![char choice,num1=0,num2=0;
int i;
while(1)
{
clrscr();
printf("======================================");
printf("ntt MENU ");
printf("n======================================");
printf("n[1] Using Push Function");
printf("n[2] Using Pop Function");
printf("n[3] Elements present in Stack");
printf("n[4] Exitn");
printf("ntEnter your choice: ");
fflush(stdin);
scanf("%c",&choice);
switch(choice-'0')
{
case 1:
{
printf("ntElement to be pushed:");
scanf("%d",&num1);
push_ele(num1);
break;](https://image.slidesharecdn.com/6846231/85/week-15x-6-320.jpg)
week-15x
- 1. /* Write C programs that implement stack (its operations) using i) Arrays */ #include<stdio.h> #include<conio.h> int st_arr[20]; int t=-1; void push_ele(int ele); int pop_ele(); void display_ele(); void main() { char choice,num1=0,num2=0; while(1) { clrscr(); printf("======================================"); printf("ntt MENU "); printf("n======================================"); printf("n[1] Using Push Function"); printf("n[2] Using Pop Function"); printf("n[3] Elements present in Stack");
- 2. printf("n[4] Exitn"); printf("ntEnter your choice: "); fflush(stdin); scanf("%c",&choice); switch(choice-'0') { case 1: { printf("ntElement to be pushed: "); scanf("%d",&num1); push_ele(num1); break; } case 2: { num2=pop_ele(1); printf("ntElement to be popped: %dnt",num2); getch(); break; }
- 3. case 3: { display_ele(); getch(); break; } case 4: exit(1); break; default: printf("nYour choice is invalid.n"); break; } } } /*Implementing the push() function. */ void push_ele(int ele) { if(t==99) { printf("STACK is Full.n");
- 4. getch(); exit(1); } st_arr[++t]=ele; } /*Implementing the pop() function. */ int pop_ele() { int ele1; if(t==-1) { printf("ntSTACK is Empty.n"); getch(); exit(1); } return(st_arr[t--]); } /*Implementing display() function. */ void display_ele() { int k; printf("ntElements present in the stack are:nt");
- 5. for(k=0;k<=t;k++) printf("%dt",st_arr[k]); } /* Write C programs that implement stack (its operations) using ii) Pointers */ #include<stdio.h> #include<conio.h> struct st_point { int ele; struct st_point *l; } *t; int i; void push_ele(int j); int pop_ele(); void display_ele(); void main() {
- 6. char choice,num1=0,num2=0; int i; while(1) { clrscr(); printf("======================================"); printf("ntt MENU "); printf("n======================================"); printf("n[1] Using Push Function"); printf("n[2] Using Pop Function"); printf("n[3] Elements present in Stack"); printf("n[4] Exitn"); printf("ntEnter your choice: "); fflush(stdin); scanf("%c",&choice); switch(choice-'0') { case 1: { printf("ntElement to be pushed:"); scanf("%d",&num1); push_ele(num1); break;
- 7. } case 2: { num2=pop_ele(1); printf("ntElement to be popped: %dnt",num2); getch(); break; } case 3: { printf("ntElements present in the stack are:nt"); display_ele(); getch(); break; } case 4: exit(1); break; default: printf("nYour choice is invalid.n");
- 8. break; } } } /*Inserting the elements using push function*/ void push_ele(int j) { struct st_point *m; m=(struct st_point*)malloc(sizeof(struct st_point)); m->ele=j; m->l=t; t=m; return; } /*Removing the elements using pop function*/ int pop_ele() { if(t==NULL) { printf("nSTACK is Empty."); getch(); exit(1);
- 9. } else { int i=t->ele; t=t->l; return (i); } return 0; } /*Displaying the elements */ void display_ele() { struct st_point *pointer=NULL; pointer=t; while(pointer!=NULL) { printf("%dt",pointer->ele); pointer=pointer->l; } }