International Journal of Exploring Emerging Trends in Engineering (IJEETE)

Vol. 02, Issue 05, SEPT- OCT, 2015 Pg. 224-229 WWW.IJEETE.COM

THE REVIEW ON IMPLEMENTATION OF CIRCULAR STACK DATA STRUCTURE

POONAM KATYARE1, MS. NIKITA AWATI2

1
Assistant Professor, MCA Department
Pimpri Chinchwad College of Engineering, University of Pune, India.
2
Research Scholar, MCA Department
Pimpri Chinchwad College of Engineering, University of Pune, India.

ABSTRACT structure is a structured set of variables associated

This paper presents concepts of data structures and
its use. As new trend in computers have made it
possible to handle complex problems.
Requirements of users are also becoming large and
complex and to solve these problems basic data
types are not sufficient. Thus there is a need for
“Data structure”, which gives more “structure” to
data. These data structures may be a combination
or collection of basic data types, with specific
properties and operations. This paper also describes
one of data structure that is stack which provides
push and pop operations with the usual semantics
also the working of the single stack and multiple
stack and its applications. It mainly focuses on a
new implementation technique on data structure
called Circular stack. This is an amazing concept
where the single stack works as multiple stacks in
circular form.
KEYWORD
Data Structure, Stack, Circular stack
1. INTRODUCTION
The data structure represents the way of
organization of data. Once data is stored it can be
retrieved in many ways. The way of retrieving data
is also provided by data structure.Data structures
plays an important role in programming languages
because the particular means to represent an
abstract relationship can have an effect upon the
efficiency and ease with which elements may be
stored, retrieved, and manipulated.[1] A data
with one another in different ways, cooperatively
defining components in the system and capable of
being operated upon in the program. Data
structures are use to identify and develop useful
mathematical entities and operations and to find out
which type of problems can be solved using these
entities and operations. They are also used to find
representations for the abstract entities such that
their logical relationship is maintained and
implement operations on those entities in a
concrete manner.
Advantages of data structure includes allowing
information storage on hard disks, provide mean
for management of large dataset such as databases,
use for designing efficient algorithms, allowing
data usage and processing data.[3] Only the
problem with data structures is only advance users
can make changes to data structure that is any
problem involving data structure will need experts
help. There are various types of data structures
which include linear and non-linear, static and
dynamic in which the linear data structure include
arrays, stack and queues.
A stack is one of the linear data structures where
collection of an ordered list of items is found. Stack
is an abstract data type which supports semantic
way of insertion and deletion. Items are added to
the list at the top called as Push function and items
are removed from the top that is Pop Function.
Since the last item added to the list is the first
removed from the list, stacks are also known as
“Last In First Out” (LIFO) lists. A stack is easily
implemented in an array, requiring only a pointer

ISSN – 2394-0573 All Rights Reserved © 2015 IJEETE Page 224

 International Journal of Exploring Emerging Trends in Engineering (IJEETE)
Vol. 02, Issue 05, SEPT- OCT, 2015 Pg. 224-229 WWW.IJEETE.COM
variable to point to the position of the top element
of the stack.
Stack can mostly used to manage the function
calls. There are various applications of stack like
recursion interrupt handling, inter conversion
between prefix, infix, and postfix expressions,
matching parenthesis in an expression etc.[2] But
the stack has the restriction of insertion and
removal of elements from stack that is in LIFO
manner. But this can be overcome by using the
concept of multiple stacks data structure.
Circular stack has a super-power on the push and
pop of the elements in both sides, it mean the front
and back (element should pop at the side where it
was actually pushed). The implementation of stack
is behaves in circular manner. Imagine the
operation will flow as a circular queue but without
compromising the stack behaviour.
Diagrammatically representation of circular stack is
as shown:
In the proposed structure since a circular stack
actually contains a single collection that then acts
as two stacks by the name Front Stack and Back
Stack. This means that the array stack occupies the
entire front stack or the back stack or any
composition of both stacks represented as
ISSN – 2394-0573 All Rights Reserved © 2015 IJEETE
2. DATA STRUCTURE THROUGH STACK
Structure of stack may be internal stack and
external stack. Generally stack is used for storing
internal function calls in memory In memory
internally stack of return address of function calls is
mentioned. It is also used to pass parameters to
functions. There may be a one stack supported by
instruction set called as Single Stack computers.
This stack is used for arithmetic expression
evaluation, expression conversion, storing return
addresses, checking matching parenthesis of
expression.[5] This type of stack is very easily
implemented in memory with one block of
memory. But the disadvantaged of this stack is to
mention parameter list while function calls for each
process leads to overhead of maintaining multiple
stacks in memory.
Circular stack concept used to create stacks
one after the other as per instruction set. This type
of stack is used in all applications of single stack as
storing return addresses, fetching parameters,
expression evaluation and expression conversion
where parameter stack is maintained separately
than address stack. One of the example or
application of circular stack which has two stack
named front stack and back stack working parallel
as single stack. This multiple stack contains some
variables as
Root: This is the first element which will be
pointing to the front stack.
Peak: This is the item pointing to the front stack
that is about to pop.
Deep: This is the item pointing to the back stack
that is about to pop.
The operations involved in circular stack are
Push in Front: That Pushes an item onto the front
stack that may be a top side
Push in Back: That Pushes an item onto back stack
that may be the other side
Pop in Front: This function Pops an item from the
front stack
Pop in Back: This function Pops an item from the
back stack
Page 225
 International Journal of Exploring Emerging Trends in Engineering (IJEETE)
Vol. 02, Issue 05, SEPT- OCT, 2015 Pg. 224-229 WWW.IJEETE.COM

3. IMPLEMENTATION OF CIRCULAR Empty else Print Message: Back Empty and

STACK return null

As stack is the data structure which performs the 4. FUNCTIONS CODE:

insertion and deletion of data from same side as
LIFO manner whereas multi stack is the concept
where the data is inserted (push) and removed
(deleted) from both the ends. Multi stack contains
multiple stacks working together as single stack. As
the circular stack contains two stacks that are front
stack and back stack which provides the push and
pop operations from both ends increasing the
speed.
According to the operations the functions required
in multiple stacks are:
Function of Push Front:
In this function if the Root is less than Space
Length and Deep is less than Space Length Then
loop up to before Deep. Shift item to one place
ahead. Place item on top.
Increment Root and Deep else Print Message: Full
Considering the are array of length as Space[5]
which will have a integer data which is stored using
three integer variables named Root, Peak, Deep
assigning Root and Peak to -1 and Deep as 0
1. 4.1.PUSH FRONT FUNCTION
Here while pushing an element in front stack it
checks whether the Root value (first element of
front stack) and the Deep (element in back stack
that is about to pop) is less than the array size. The
element is added in the reverse order as per the
stack rule so that it will also display the elements
according to stack concept. Diagrammatically stack
looks like

Function Push Back

In this function if the Root is less than Space

Length and Deep is less than Space Length Then
Place the item in the Space at Deep and Increment
Root and Deep else Print Message: Full

Function Pop Front

In this function if Deep is greater than -1 and Root

is not equal to -1 then Top item is the popped item Algorithm for Push Front:
1. Start
of Loop up to Deep element
2. If Root and Deep not less than Space Length

Place space element one step before Empty deep then go to step 9
3. Assign deep-1 to i
space element then Decrement Deep and root and
return popped Item else if Deep - 1 is not equal to //shift data to right next data
4. Assign Space[i] to Space[i+1]
Root. Then Print Message: Front Empty else Print
5. Decrease i by 1
Message: Empty and return null
6. if i>=0 then go to step 4
7. Assign item to Space[0] i.e. shift item to one
Function Pop Back
place ahead
8. Increase Root and Deep by 1
In this function if Deep has value -1 that is less
9. Display “Stack is Full”
than Space Length And Deep as -1 that is greater
10. Stop
than Root then Deep item is the popped items.
Then make the space empty at deep and
decrement deep and return popped Item else if the
value of Root is equals -1 then Print Message:

ISSN – 2394-0573 All Rights Reserved © 2015 IJEETE Page 226

 International Journal of Exploring Emerging Trends in Engineering (IJEETE)
Vol. 02, Issue 05, SEPT- OCT, 2015 Pg. 224-229 WWW.IJEETE.COM

Code for Push Front: Code for Push Back:

void Push Front() void Pushback()
{ {
if (Root < 5 && Deep < 5) if(Root == Deep)
{ {
for (int i = Deep - 1; i >= 0; i--) Deep++;
{ }
Space[i + 1] = Space[i]; if (Root < 5 && Deep < 5)
} {
Space[0] = item; Space[Deep] = item;
Root++; Deep++;
Deep++; }
} else
else {
{ cout<<"Full";
cout<<"Full"; }
} }
}

4.2. PUSH BACK FUNCTION

In push back function elements are inserted

from the back side. Initially the location of Deep
and Root is same. As the elements are being
inserted location or the address of Deep goes on
increasing up to the certain limit.

4.3 POP FRONT FUNCTION

This is the function in which element from the

front stack is removed (popped).After the
removal of element from front stack, Root and
Deep location is decreased by one and space in
increased.
Algorithm for Pop Front
Algorithm for Push Back: 1. Start
1. Start 2. If Deep > -1 && Root != -1 then goto 3
2. If Root and Deep not equal then go to step 9 else goto 11
3. Increase Deep by 1 3. Assign Space[0] to popedItem
4. Assign deep-1 to i 4. Assign 0 to i
5. If Root and Deep not less than Space //shift data
Length then goto step 8 5. Assign Space[i+1] to Space[i]
6. Assign item to Space[Deep] 6. Decrease i by 1
7. Increase Deep by 1 7. if i<Deep-1 then goto step 4
8. Display “Stack is Full” 8. Assign 0 to Space[Deep-1]
9. Stop 9. Decrease Root and Deep by 1
10. Display the popped element

ISSN – 2394-0573 All Rights Reserved © 2015 IJEETE Page 227

 International Journal of Exploring Emerging Trends in Engineering (IJEETE)
Vol. 02, Issue 05, SEPT- OCT, 2015 Pg. 224-229 WWW.IJEETE.COM

11. if (Deep - 1 != Root) then Display “Front Code for Pop Back
Empty” void PopBack()
else {
Display “Empty” if (Deep -1 < 5 && Deep -1 > Root)
12. Stop {
int popedItem = Space[Deep-1];
Code for Pop Front Space[Deep -1] = 0;
void Pop Front() Deep--;
{ cout<<"\nPoped data="<<popedItem;
if ( Deep > -1 && Root != -1) }
{ else
int popedItem = Space[0]; {
for (int i = 0; i < Deep-1; i++) if (Root == -1)
{ {
Space[i] = Space[i + 1]; cout<<"Empty";
} }
Space[Deep-1] = 0; else
Root--; {
Deep--; cout<<"BackEmpty";
cout<<"\ndata poped="<<popedItem; }
}
} }
else
{
if (Deep - 1 != Root)
{
cout<<"FrontEmpty";
}
else
{
cout<<"Empty";
}
}
}

4.4 POP BACK FUNCTION 5. APPLICATIONS

Depending upon the various types, applications of
Algorithm for Pop Back data structures has been observed. It includes
1. Start queue management, CPU scheduling, Dictionary
2. If Deep -1 < 5 && Deep -1 > Root then in real life scenario. As discussed about the stack
goto 3 else goto 7 its applications include Base conversions,
3. Assign Space[Deep-1] to popped item Evaluation and Conversion of Polish notations,
4. Assign 0 to Space[Deep-1] and Non recursive functions for traversals of
5. Decrease Deep by 1 binary trees [3]. Other than this stack can be used
6. Display popped item in stock market application in which the federal
7. Check if root = -1 then tax laws require investor to compute the profit
Display “Empty” and loss on a LIFO basis, i.e., the most recently
else purchased shares are sold first. The classic Tower
Display “Back Empty” of Hanoi problem is solved by using recursion
concept. An interesting problem is to print out all

ISSN – 2394-0573 All Rights Reserved © 2015 IJEETE Page 228

 International Journal of Exploring Emerging Trends in Engineering (IJEETE)
Vol. 02, Issue 05, SEPT- OCT, 2015 Pg. 224-229 WWW.IJEETE.COM
the anagrams of a given word. That is, given an
N-letter word with all letters different, print all
the "words" you can form using each letter once,
regardless of whether they are actual words in
some language. The number of such
rearrangements is N-factorial where N is the
number of letters. The problem can be solved in
several different ways, one of which uses stack. A
simple technique for implementing Or-parallelism
and And-parallelism on distributed machines is
solved by stack splitting concept. Stack-splitting
naturally incorporates efficient scheduling and
reduced communication between processors.
[7].The multi stack implemented using circular
way as circular stack, as data-path chips such as
microprocessors and RISC chips become more
complex, stacks of data-path macros are required
to implement the entire data-path. [4] The
physical decomposition of a chip into a single
data-path stack, and control logic of random logic
as in the past is not always feasible therefore
special multi-stack structure is used optimization
techniques and algorithms to partition, place and
wire the data-path macros in the form of the
multi-stack structure, taking into account the
connectivity of the entire chip logic (data-path,
control logic, chip drivers, on-chip memory).
Secondly, a novel multi-stack CMOS device
structure is proposed, the operation of the
structure is fully analyzed for high power CMOS
switch design. The structure is also implemented
in a standard 0.18-um triple-well CMOS process,
and its performance is fully characterized. The
proposed switch device incorporates multi-stack
NMOS switches, one of which has a switch at the
bulk and the others of which have a connection
between the bulk and the source in order to
provide high power handling capability to the
transmit switch side[8].
CONCLUSION
We have given an overview the concept of
circular stack data structure. We tried to focus on
the issues related to the design of single data
structures. Our overview clearly illustrates that
the design of circular data structures provides
significant usage of data from multiple ends.
Paper mainly focuses on implementation of
circular stack with all its operations. Circular
stack overcomes memory problems which
ISSN – 2394-0573 All Rights Reserved © 2015 IJEETE
occurred in linear stack. Various applications
where circular stack is used is discussed in this
paper.
REFERENCES
1. James Basile. Implementing Data Structures in
FORTH, The Journal of Forth Application and
Research Vol. I . Number 2. Dec. 1983.
2. Dinesh P. Mehta, Sartaj Sahni, Handbook of
DATA STRUCTURES and
APPLICATIONS, ,pages 2-1 to 2-13,
CHAPMAN & HALL/CRC,2005
3. Joachim Hammer, Markus Schneider, Data
Structures for Databases, pages 60-1 to 60-21,
2001 by CRC Press, LLC
4. B. K. Tripathy and S. S. Gantayat, On the
implementation of data structures through
theory of lists, IJITCS, Vol.2, No.4, August
2012
5. Philiph Koopman, Stack Computers the new
wave, Mountain view press, 1989
6. Yan Wang, Implementation of Protocol
Stacks, Technical Report IDE0746, June 2007
7. Gopal Gupta, Enrico Pontelli, stack splitting:
A simple technique for implementing Or-
parallelism and And-parallelism on distributed
machines
8. Mark Sherman, Andy Hisgen, Jonathan
Rosenberg, Davis Alex Lamb, Functions
Returning values of Dynamic Size, Feb 1984,
Technical Report PCS-TR86-125
AUTHOR’S BIBLOGRAPHY
Poonam Katyare is Assistant
Professor at MCA department,
Pimpri Chinchwad College of
Engineering, Akurdi Savitribai
Phule Pune University, India. She
obtained her M.C.A degree from North
Maharashtra, Kolhapur (2006).She is currently
doing research in Data Mining and Knowledge
Discovery. She has published research papers in
various journals and conferences.
Nikita Awati is a student of MCA
department, Pimpri Chinchwad
College of Engineering, Akurdi
Savitribai Phule Pune University,
India. She is currently doing
research in data structure.
Page 229