Skip to main content

Stack Implementation using C

The following two programs for the stack implementation using Array and Linked List, the readers are requested to report if there are any errors (syntax or semantic)

//STACK IMPLEMENTATION USING ARRAYS\\

#include<stdio.h>

#include<conio.h>

void create(void);

void push(0void);

void pop(void);

void display(void);

void topelement(void);

int a[25];

int top;

void create()

{

int i;

printf("Enter the number of elements in the stack \n");

scanf("%d",&top);

printf("Enter the elements \n");

for(i=0;i<top;++i)

{

scanf("%d",&a[i]);

}

return;

}

void display()

{

int i;

if((top!=0) && (top!=25))

{

printf("The elements in the stack are \n");

for(i=top-1;i>=0;--i)

printf("%d",a[i]);

getch();

}

}

void push()

{

if(top==25)

{

printf("The stack is full \n");

}

else

{

printf("Enter the element \n");

scanf("%d",&a[top]);

top++;

}

return;

}

void pop()

{

if(top==0)

{

printf("the stack is empty \n");

}

else

{

printf("The popped element is %d",a[--top]);

}

return;

}

void topelement()

{

int t;

if(top==0)

{

printf("There is no top element \n");

}

else

{

t=top-1;

printf("The top element is %d\n",a[t]);

}

return;

}

void main()

{

int ch;

clrscr();

create();

display();

do{

clrscr();

printf("Stack operations \n");

printf("----------------\n");

printf("1. PUSH \n");

printf("2. POP \n");

printf("3. TOP ELEMENT \n");

printf("4. Displaying the stack \n");

printf("5. Quit \n");

printf("Enter your choice \n");

scanf("%d\n",&ch);

switch(ch)

{

case 1: push();

display();

break;

case 2: pop();

display();

break;

case 3: topelement();

// display();

break;

case 4: display();

break;

case 5: printf("END \n");

break;

default: printf("Invalid Entry \n");

}

getch();

}while(ch !=5);

}

Sample output:

Enter the number of elements in the stack

4

Enter the elements

1

2

3

4

The elements in the stack are

4321

Stack operations

----------------

1. PUSH

2. POP

3. TOP ELEMENT

4. Displaying the stack

5. Quit

Enter your choice

1

0

Enter the element

The elements in the stack are

04321

Enter your choice

3

The top element is 0

Enter your choice

2

The popped element is 0

Enter your choice

1

Enter the element

1

The elements in the stack are

14321

Enter your choice

5

END

 

STACK USING LINKED LIST

#include<stdio.h>

#include<conio.h>

#include<stdlib.h>

typedef struct node

{

int data;

struct node *next;

}stack;

int size();

void view();

int isFull();

int isEmpty();

void displayMenu();

int push(int value);

int pop(int *value);

int peek(int *value);

stack *getNode();

void releaseNode(stack *newnode);

stack *topstk=NULL;

void main()

{

int data,status,choice;

displayMenu();

while(1)

{

printf("\n\n ?");

scanf("%d",&choice);

switch(choice)

{

case 1:

printf("\nenter the element:");

fflush(stdin);

scanf("%d",&data);

status=push(data);

if(status == -1)

printf("\n memory is not available.....");

break;

case 2:

status=pop(&data);

if(status == -1)

printf("\nstack is underflow on pop");

else

printf("\n the popped elementis %d",data);

break;

case 3:

status=peek(&data);

if(status == -1)

printf("\nstack is empty!!!");

else

printf("\n the top element is %d",data);

break;

case 4:

printf("\ncurrent stack element = %d",size());

break;

case 5:

view();

break;

default:

printf("\n end of run program");

exit(0);

}

}

}

void displayMenu()

{

printf("\nrepresentation of stack using single linked list");

printf("\n\t1.push");

printf("\n\t2.pop");

printf("\n\t3.peek");

printf("\n\t4.size");

printf("\n\t5.view");

printf("\n\t6.exit");

}

stack *getNode()

{

return((stack *)malloc(sizeof(stack)));

}

void releaseNode(stack *newnode)

{

free(newnode);

}

int push(int value)

{

extern stack *topstk;

stack *newptr;

if(isFull())

return -1;

newptr=getNode();

newptr->data=value;

newptr->next=topstk;

topstk=newptr;

return 0;

}

int pop(int *value)

{

extern stack *topstk;

stack *temp;

if(isEmpty())

return -1;

temp=topstk;

topstk=topstk->next;

*value=temp->data;

releaseNode(temp);

return 0;

}

int peek(int *value)

{

extern stack *topstk;

stack *temp;

if(isEmpty())

return -1;

temp=topstk;

*value=temp->data;

return 0;

}

int isEmpty()

{

extern stack *topstk;

if(topstk==NULL)

return 1;

else

return 0;

}

int isFull()

{

extern stack *topstk;

stack *temp;

temp=getNode();

if(temp==NULL)

return 1;

else

{

releaseNode(temp);

return 0;

}

}

int size()

{

extern stack *topstk;

stack *top;

int count=0;

for(top=topstk;top!=NULL;top=top->next)

count++;

return count;

}

void view()

{

extern stack *topstk;

stack *top;

if(isEmpty())

{

printf("\nthe stack is empty!!!");

return;

}

printf("\n the content of the stack is......TOP");

for(top=topstk;top!=NULL;top=top->next)

printf("-->%d",top->data);

}

Sample output:

Representation of stack using linked list

1. Push

2. Pop

3. Peek

4. Size

5. View

6. Exit

?2

stack underflow on POP

?3

stack is empty

?4

stack is elements=0

?1

enter the element:11

?1

enter the element:22

?5

the content of the stack is……TOPà22à11

?4

stack elements=2

?2

the popped value is 22

?6

end of run of your program

Comments

  1. Sir, i am regular reader of this site. Very usefull information for college assignments

    ReplyDelete
  2. yeah, welcome, also visit http://www.acadprojects.com

    ReplyDelete

Post a Comment

Popular posts from this blog

Installation of NS2 (ns-2.35) in Ubuntu 20.04

Installation of NS2 (ns-2.35) in Ubuntu 20.04 LTS Step 1: Install the basic libraries like      $] sudo apt install build-essential autoconf automake libxmu-dev Step 2: install gcc-4.8 and g++-4.8 open the file using sudo mode $] sudo nano /etc/apt/sources.list Include the following line deb http://in.archive.ubuntu.com/ubuntu bionic main universe $] sudo apt update $] sudo apt install gcc-4.8 g++-4.8 Step 3:  Unzip the ns2 packages to home folder $] tar zxvf ns-allinone-2.35.tar.gz $] cd ns-allinone-2.35/ns-2.35 Modify the following make files. ~ns-2.35/Makefile.in Change @CC@ to gcc-4.8 change @CXX@ to g++-4.8 ~nam-1.15/Makefile.in ~xgraph-12.2/Makefile.in ~otcl-1.14/Makefile.in Change in all places  @CC@ to gcc-4.8 @CPP@ or @CXX@ to g++-4.8 open the file: ~ns-2.35/linkstate/ls.h Change at the Line no 137  void eraseAll() { erase(baseMap::begin(), baseMap::end()); } to This void eraseAll() { this->erase(baseMap::begin(), baseMap::end()); } All changes made Step 4: Open a new termi

Installing ns-3.34 in Ubuntu 20.04

This post shows how to install ns 3.34 in Ubuntu 20.04 LTS Prerequisites: Fresh installation of Ubuntu Version 20.04 LTS  ns3.34 can be downloaded from here Follow the video link for complete step by step instructions on the installation.  This version fixes the compilation issues of vanet-routing-compare.cc (bug in ns3.33)  Issue the following commands after opening a terminal  $ sudo apt update $ sudo apt install g++ python3 python3-dev python-dev pkg-config sqlite3 python3-setuptools git qt5-default gir1.2-goocanvas-2.0 python3-gi python3-gi-cairo python3-pygraphviz gir1.2-gtk-3.0 ipython3 openmpi-bin openmpi-common openmpi-doc libopenmpi-dev autoconf cvs bzr unrar openmpi-bin openmpi-common openmpi-doc libopenmpi-dev tcpdump wireshark libxml2 libxml2-dev Unzip or untar the ns-allinone-3.34.tar.bz2 in the home folder (in my case its /home/pradeepkumar) $ cd ns-allinone-3.34/ $ ./build.py --enable-examples --enable-tests  Once the installation is completed, you may get an output show

Installation of ns3 in Windows 10 and Windows 11 OS using WSL (Windows Subsystem for Linux)

This post shows how to install ns-3.33 in Windows 10 through WSL (Windows Subsystem for Linux) This posts works for Windows 11 also (I have tested it on a Windows 11 ISO and it works the Same way as mentioned in the following post.) This post will work for ns-3.3x version. Prerequisites : Install Windows Subsystem for Linux with GUI: Please refer the following video  System Information: OS used: Windows 10 and WSL (Ubuntu 20.04) GUI: XServer for Windows NS3 Version: ns-3.33 See the following complete video on how to install ns3 in Windows 10 Step 0 : Open XLaunch Step 1 :  Open WSL using PowerShell and open it as Administrator Command:/  wsl $ xfce4-session The GUI of Ubuntu Opens within Windows 10 OS. Step 2 : Download ns3 from nsnam.org website through Mozilla Firefox browser Step 3: Open a Terminal  $ sudo apt update $ sudo apt install build-essential autoconf automake libxmu-dev python3-pygraphviz cvs mercurial bzr git cmake p7zip-full python3-matplotlib python-tk python3-dev qt5-q