This document discusses implementing a stack using a Stack ADT class. It defines a Stack class with common stack methods like push, pop, peek, empty. It stores elements by extending Vector. Sample code shows pushing and popping integers from a stack and catching empty stack exceptions. The lab task involves taking 20 names as input into a stack and performing operations. The home task converts an infix expression to postfix using a stack.
This document discusses implementing a stack using a Stack ADT class. It defines a Stack class with common stack methods like push, pop, peek, empty. It stores elements by extending Vector. Sample code shows pushing and popping integers from a stack and catching empty stack exceptions. The lab task involves taking 20 names as input into a stack and performing operations. The home task converts an infix expression to postfix using a stack.
This document discusses implementing a stack using a Stack ADT class. It defines a Stack class with common stack methods like push, pop, peek, empty. It stores elements by extending Vector. Sample code shows pushing and popping integers from a stack and catching empty stack exceptions. The lab task involves taking 20 names as input into a stack and performing operations. The home task converts an infix expression to postfix using a stack.
This document discusses implementing a stack using a Stack ADT class. It defines a Stack class with common stack methods like push, pop, peek, empty. It stores elements by extending Vector. Sample code shows pushing and popping integers from a stack and catching empty stack exceptions. The lab task involves taking 20 names as input into a stack and performing operations. The home task converts an infix expression to postfix using a stack.
Download as DOCX, PDF, TXT or read online from Scribd
Download as docx, pdf, or txt
You are on page 1/ 3
Lab#10 Stack ADT Implementation SSUET/QR/114
LAB # 10
Stack ADT Implementation
Object Implement Stack by using Stack ADT class.
Theory
Stack is a subclass of Vector that implements a standard last-in, first-out stack.
Stack only defines the default constructor, which creates an empty stack. Stack includes all the methods defined by Vector, and adds several of its own.
Public Class Name: Stack
Constructors Object pop( )
Returns the element on the top of the stack, removing it in the process. Stack( ) Object push(Object element) Pushes element onto the stack. Element is also returned. Responsibilities int search(Object element) Searches for element in the stack
boolean empty() Object peek( )
Returns true if the stack is empty, and false Returns the element on the top of the stack, but does if the stack contains elements. not remove it.
public E push(E item)
Pushes an item onto the top of this stack. This has exactly the same effect as: addElement(item)
Parameters: item - the item to be pushed onto this stack.
SWE-203L Data Structure and Algorithms
Lab#10 Stack ADT Implementation SSUET/QR/114
Returns: the item argument.
public E pop() Removes the object at the top of this stack and returns that object as the value of this function.
Returns: The object at the top of this stack (the last item of the Vector object).
Throws: EmptyStackException - if this stack is empty.
