→ Week 9 Workshop 6 Linear Data Structures – Part 2 Applications → Začnite sa učiť / Stiahnite si MP3 Flashcards

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

Week 9 Workshop 6 Linear Data Structures – Part 2 Applications