stack | Student Projects

C program to implement stack operations using array

Drithi — Tue, 05 Jun 2012 09:18:42 +0000

Below is the C program to implement stack operations using array

#include
#include
#include
#define size 100
int top=-1;
int flag=0;
int stack[size];
void push(int *,int);
int pop(int *);
void display(int *);
void push(int s[],int d)
{
    if(top==(size-1))
        flag=0;
    else
    {
        flag=1;
        ++top;
        s[top]=d;
    }
}
int pop(int s[])
{
    int popped_element;
    if(top==-1)
    {
        popped_element=0;
        flag=0;
    }
    else
    {
        flag=1;
        popped_element=s[top];
        --top;
    }
    return(popped_element);
}
void display(int s[])
{
    int i;
    if(top==-1)
    {
        printf("\n stack is empty");
    }
    else
    {
        for(i=top;i>=0;--i)
            printf("\n %d",s[i]);
    }
}
/* this is the main function */
void main()
{
    int data;
    char choice;
    int q=0;
    int top=-1;
    clrscr();
    do
    {
        printf("\n push->i pop->p quit->q:");
        printf("enter your choice");
        do
        {
            choice=getchar();
            choice=tolower(choice);
        }
        while(strchr("ipq",choice)==NULL);
        printf("your choice is %c",choice);
        switch(choice)
        {
        case'i':printf("\n input element to push");
            scanf("%d",&data);
            push(stack,data);
            if(flag)
            {
                printf("\n after inserting ");
                display(stack);
                if(top==(size-1))
                    printf("\n stack is full");
            }
            else
                printf("\n stack is overflown after pushing");
            break;
        case 'p':data=pop(stack);
            if(flag)
            {
                printf("\n data is popped:%d",data);
                printf("\n now the stack is as follows :\n");
                display(stack);
            }
            else
                printf("\n stack is underflown");
            break;
        case'q':q=1;
        }
    }
    while(!q);
}

The post C program to implement stack operations using array first appeared on Student Projects.

C Program which performs stack operations

Drithi — Tue, 05 Jun 2012 08:49:00 +0000

Following program performs various stack operations,

 
#include
#include
#include
#include
#define max 20

int top=-1,s[max];
void push(int n)
{
    if(top==max-1)
    {
        puts("stack is over flown");
        return;
    }
    else
    {
        top=top+1;
        s[top]=n;
    }
}
void pop()
{
    int del;
    if(top==-1)
    {
        puts("stack is underflown");
        return;
    }
    else
    {
        del=s[top];
        printf("\n poped element is %d",del);
        top=top-1;
    }
}
void display()
{
    int i;
    if(top==-1)
        puts("stack is empty");
    else
    {
        for(i=top;i>=0;i--)
            printf("\t%d",s[i]);
    }
}
void main()
{
    int opt,n;
    do
    {
        printf("\n 1.push");
        printf("\n 2.pop");
        printf("\n 3.display");
        printf("\n 4.exit");
        printf("enter ur option");
        scanf("%d",&opt);
        switch(opt)
        {
        case1:printf("\n enter any element to push");
            scanf("%d",&n);
            break;
        case2:pop();
            break;
        case3:display();
            break;
        case4:exit(0);
            break;
        }
    }
    while(1);
}

The post C Program which performs stack operations first appeared on Student Projects.

C++ program to implement stack using Linked List

Editorial Team — Thu, 03 Feb 2011 10:50:47 +0000

#include 
template
class Node
{
	friend LinkedStack;
	private:
	T data;
	Node *link;
};
template
class LinkedStack {
	public:
		LinkedStack() {top = 0;}
		~LinkedStack();
		int IsEmpty() const {return top == 0;}
		T Top() const;
		LinkedStack& Add(const T& x);
		LinkedStack& Delete(T& x);
	private:
		Node *top; 
};
	template
LinkedStack::~LinkedStack()
{// Stack destructor..
	Node *next;
	while (top) {
		next = top->link;
		delete top;
		top = next;
	}
}
template
T LinkedStack::Top() const
{// Return top element.
	if (IsEmpty()) cout<<"Stack empty:";
	else
		return top->data;
}
	template
LinkedStack& LinkedStack::Add(const T& x)
{// Add x to stack.
	Node *p = new Node;
	p->data = x;
	p->link = top;
	top = p;
	return *this;
}
	template
LinkedStack& LinkedStack::Delete(T& x)
{// Delete top element and put it in x.
	if (IsEmpty()) 
	{
		cout<<"Stack empty";
		return *this;
	}
	x = top->data;
	Node *p = top;
	top = top->link;
	delete p;
	return *this;
}
void main(void)
{
	int x;
	LinkedStack S;
	S.Add(1).Add(2).Add(3).Add(4);
	cout << "Stack should be 1234" << endl;
	cout << "Stack top is " << S.Top() << endl;
	S.Delete(x);
	cout << "Deleted " << x << endl;
	S.Delete(x);
	cout << "Deleted " << x << endl;
	S.Delete(x);
	cout << "Deleted " << x << endl;
	S.Delete(x);
	cout << "Deleted " << x << endl;
}

The post C++ program to implement stack using Linked List first appeared on Student Projects.

C++ program to implement Stack using Formula Based Representation

Editorial Team — Thu, 03 Feb 2011 10:47:47 +0000

#include
#include
template
class Stack
{
	public:
		Stack(int MaxStackSize);
		~Stack(){delete[] S;}
		int IsEmpty()const{return top==-1;}
		int IsFull()const{return top==MaxTop;}
		T Peek()const;
		void Push(T);
		T Pop();
		void Display();
	private:
		int top; //current top of stack
		int MaxTop; //max val for top
		T *S; //element array
};
	template
Stack::Stack(int MaxStackSize)
{
	//stack constructor
	MaxTop=MaxStackSize-1;
	S=new T[MaxStackSize];
	top=-1;
}
template
T Stack::Peek()const
{
	if(IsEmpty()) //top fails
		return 0;
	else
		return S[top];
}
	template
void Stack::Push(T x)
{
	if(IsFull())
		cout<<"no memory()"; //add fails
	else
	{
		S[++top]=x;
	}
}
	template
T Stack::Pop()
{
	T x;
	if(IsEmpty())
	{
		cout<<"stack is empty\n";
		return -1;
	}
	else
	{
		x=S[top--];
		return x;
	}
}
	template
void Stack::Display()
{
	if(IsEmpty())
		cout<<"out of bounds"; //delete fails
	else
		for(int i=top;i>=0;i--)
		{
			cout<iobj(5);
	int ch,x;
	clrscr();
	do
	{
		menu();
		cout<<"enter the choice\n";
		cin>>ch;
		switch(ch)
		{
			case 1:
				cout<<"enter x value to push into the stack\n";
				cin>>x;
				iobj.Push(x);
				break;
			case 2:
				x=iobj.Pop();
				if(x!=-1)
					cout<<"poped value is \t"<=1&&ch<=4);
	getch();
}

The post C++ program to implement Stack using Formula Based Representation first appeared on Student Projects.

C++ programs to implement the Stack ADT using an array

Editorial Team — Wed, 10 Mar 2010 17:22:49 +0000

/* Write C++ programs to implement the Stack ADT using an array */

#include
#include
#include
using namespace std;
class stack
{
             int stk[5];
             int top;
      public:
             stack()
              {
                top=-1;
               }
             void push(int x)
              {
                 if(top >  4)
                       {
                           cout <<"stack over flow";
                           return;
                       }
                 stk[++top]=x;
                 cout <<"inserted" <=0;i--)
                    cout <> ch;
             switch(ch)
              {
               case 1:  cout <<"enter the element";
                        cin >> ch;
                        st.push(ch);
                        break;
               case 2:  st.pop();  break;
               case 3:  st.display();break;
               case 4:  exit(0);
               }
         }
return (0);
}

OUTPUTS
1.push 2.pop 3.display 4.exit
Enter ur choice2
stack under flow

1.push 2.pop 3.display 4.exit
Enter ur choice1
enter the element2
inserted2

1.push 2.pop 3.display 4.exit
Enter ur choice1
enter the element3
inserted3

1.push 2.pop 3.display 4.exit
Enter ur choice2
deleted3

1.push 2.pop 3.display 4.exit
Enter ur choice1
enter the element5
inserted5

1.push 2.pop 3.display 4.exit
Enter ur choice3
5 2

1.push 2.pop 3.display 4.exit
Enter ur choice4

The post C++ programs to implement the Stack ADT using an array first appeared on Student Projects.

Java program that implements stack ADT

Editorial Team — Fri, 02 Oct 2009 18:13:41 +0000

import java.util.Scanner;
class stack
{
	private final int size;
	private int top;
	private E[] elements;
	public stack()
	{
		this(10);
	}
	public stack(int s)
	{
		size=s>0?s:10;
		top=-1;
		elements=(E[])new Object[size];
	}
	public void push(E x)
	{
		if(top==size-1)
			System.out.println("Overflow");
		elements[++top]=x;
	}
	public E pop()
	{
		if(top==-1)
			System.out.println("Underflow");
		return elements[top--]; 
	}
	public void display()
	{
		if(top==-1)
			System.out.println("Stack is empty");
		else
		{
			for(int i=0;id_stack;
		d_stack=new stack(5);
		Scanner input=new Scanner(System.in);
		do
		{
			System.out.println("Menu is as follows:");
			System.out.println("1.Push\n2.Pop\n3.Display\n4.Exit");
			System.out.println("Enter your choice:");
			ch=input.nextInt();
			switch(ch)
			{
				case 1:	System.out.println("Enter element to push:");
						double item=input.nextInt();
						d_stack.push(item);
						break;
				case 2:	double item1=d_stack.pop();
						System.out.println("Popped item:"+item1);
						break;
				case 3:	d_stack.display();
						break;
				default:	break;
			}
		}while(ch!=4);		
	}
}

Output:
Menu is as follows:
1.Push
2.Pop
3.Display
4.Exit
Enter ur choice:1
Enter element to push :12

Menu is as follows:
1.Push
2.Pop
3.Display
4.Exit
Enter ur choice:1
Enter element to push:13

Menu is as follows:
1.Push
2.Pop
3.Display
4.Exit
Enter ur choice:3
12.0
13.0

Menu is as follows:
1.Push
2.Pop
3.Display
4.Exit
Enter ur choice:2
Popped item:13.0

Menu is as follows:
1.Push
2.Pop
3.Display
4.Exit
Enter ur choice:2
Popped item:12.0

Menu is as follows:
1.Push
2.Pop
3.Display
4.Exit
Enter ur choice:3
Stack is empty

The post Java program that implements stack ADT first appeared on Student Projects.