DataStructures-Semister project documentation.docx -...

SEMISTER PROJECT
DOCUMENTATION
Application of Stacks in Expression Conversion
, 2021
AWINI IRENE APUSWIN
UGR0201810221

APPLICATION OF STACKS IN EXPRESSION CONVERSION
BY
AWINI IRENE APUSWIN (UGR0201810221)
ICST LEVEL 300 (IT OPTION)
SUPERVISED BY
MR VINCENT AMAKONA (LECTURER)
A PROJECT DOCUMENTATION SUBMITTED TO MR VINCENT
AMANKONA (LECTURE) DEPARTMENT OF ICST. CATHOLIC
UNIVERSITY COLLEGE OF GHANA IN PARTIAL FULFILMENT OF
SEMESTER ASSESSMENT PROJECT ON THE SUBJECT: DATA
STRUCTURES AND ALGORITHM

APPROVAL PAGE
This is to certify that this project documentation is written by Awini Irene Apuswin
with Student Registration Number UGR0201810221 and has been approved by Mr.
Vincent Amankona (Lecturer) CATHOLIC UNIVERSITY COLLEGE OF
GHANA, FIAPRE in partial fulfillment for the semester project
……………………………. ……………….
(Project Supervisor). Date
……………………………. ……………….
External Supervisor Date

Abstract
This is a program that shows expressions can be converted from one form to
another, for example; converting an expression from infix to postfix, infix to
prefix, postfix to infix and prefix to infix. This program will make it easy for users
to arrive at answers easily by inputting the expression that needs to converted and
selecting which type of conversion that needs to be done, and the answer is
displayed to the console.
Acknowledgement
I am grateful to God almighty for the protection and guidance throughout this
work. Also thankful to my Lecturer, Mr. Vincent Amankona for his selfless
support. Not also forgetting my wonderful classmates. God bless you all.

INTRODUCTION
A stack is an abstract data structure. It’s just like the dequeue (double-ended queue)
or the queue. The only difference is you can only add elements into the data
structure from one end, the top.
To visualize what this means, I like to think of it as a tall pile of books. You can
only place one book on top of the other. You can’t add a book to the bottom of the
pile, and adding one into the middle or anywhere else may not be the brightest idea.
Same goes for pulling one out from the bottom of the pile. You might literally get
smacked in the face with some knowledge — don’t do it!
In other words, a stack is a LIFO (last in, first out) data structure. The last book to