Graphical representation of StackDocument Transcript
MINI PROJECT CSE205TOPIC:Graphical reperesntation of stackSubmitted by:SANJAY KUMAR CHAKRAVARTIROLL:A28SEC:K2R13 Submitted to: Miss.Deepika sukhija Dept. cse Lpu,phagwara
AcknowledgementApart from the efforts of me, the success of this project depends largely on theencouragement and guidelines of many others. I take this opportunity to expressmy gratitude to the people who have been instrumental in the successfulcompletion of this project.I would like to show my greatest appreciation to Miss. Deepika sukhija I can’t saythank you enough for his tremendous support and help. I feel motivated andencouraged every time I attend his meeting. Without his encouragement andguidance this project would not have materialized.The guidance and support received from all the team members including Mr.sanjeev kumar and Mr. Abhay kumar who contributed and are contributing to thisproject, was vital for the success of the project. I am grateful for their constantsupport and help.
ABSTRACTThis project was very important for me. In this project I haveshow a graphical view of stacks for better understanding. It willgives you many features as listed below: 1. Graphical view 2. Simple programming language 3. Source code contains comments line where needed 4. A best approach with graphics programming
INTRODUCTIONThe Stack is a Memory Area where you can store data there and can getback them again. In computer science, a stack is a last in, first out(LIFO) abstract data type and linear data structure . A stack can haveany abstract data type as an element , but is characterized by twofundamental operations, called PUSH and POP. The push operation addsa new item to the top of the stack, or initializes the stack if it is empty. Ifthe stack is full and does not contain enough space to accept the givenitem, the stack is then considered to be in an overflow state. The popoperation removes an item from the top of the stack. A pop eitherreveals previously concealed items, or results in an empty stack, but ifthe stack is empty then it goes into underflow state (It means no itemsare present in stack to be removed). A stack is a restricted datastructure , because only a small number of operations are performed onit. The nature of the pop and push operations also means that stackelements have a natural order. Elements are removed from the stack inthe reverse order to the order of their addition: therefore, the lowerelements are those that have been on the stack the longest.