Week 9 Workshop 6 Linear Data Structures – Part 2 Applications

 0    11 flashcards    up804653
download mp3 print play test yourself
 
Question English
Answer English

What is a stack?
start learning
A stack is a collection of objects where only the most recently inserted object can be removed at any time. A stack is a linear data structure. Last-In First-Out structure – LIFO.

what are the applications of a stack?
start learning
Matching brackets in arithmetic expressions, Recursive algorithms, Evaluating arithmetic expressions.

what are the 5 methods supported by Stack ADTs
start learning
Push, Pop, Peek, Empty, Full

What is push?
start learning
add an item to the stack

what is pop?
start learning
Remove an item from the top of the stack

what is peek
start learning
Peek Examine item at the top of the stack,

what is empty
start learning
Empty Determine if the stack is empty,

what is full?
start learning
Full Determine if the stack is full.

what 3 situations will cause a stack to throw an error when a method is enacted?
start learning
push operation is requested on a full stack, pop operation is requested on an empty stack.

what is a queue?
start learning
A queue is a collection of objects organised such that the object that has been stored in the queue the longest is the next one removed. A queue is a linear data structure.

what operations does a queue suppoort?
start learning
Enqueue, Dequeue, Full, Empty, First


You must sign in to write a comment