→ Week 9 Workshop 6 Linear Data Structures – Part 2 Applications → Start Lernen / Flashcards Herunterladen MP3

Lernen beginnen

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

Week 9 Workshop 6 Linear Data Structures – Part 2 Applications