→ Week 9 Workshop 6 Linear Data Structures – Part 2 Applications →开始学习 /下载MP3 Flashcards

开始学习

问题		答案
What is a stack? 开始学习		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? 开始学习		Matching brackets in arithmetic expressions, Recursive algorithms, Evaluating arithmetic expressions.
what are the 5 methods supported by Stack ADTs 开始学习		Push, Pop, Peek, Empty, Full
What is push? 开始学习		add an item to the stack
what is pop? 开始学习		Remove an item from the top of the stack
what is peek 开始学习		Peek Examine item at the top of the stack,
what is empty 开始学习		Empty Determine if the stack is empty,
what is full? 开始学习		Full Determine if the stack is full.
what 3 situations will cause a stack to throw an error when a method is enacted? 开始学习		push operation is requested on a full stack, pop operation is requested on an empty stack.
what is a queue? 开始学习		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? 开始学习		Enqueue, Dequeue, Full, Empty, First

Week 9 Workshop 6 Linear Data Structures – Part 2 Applications