→ Week 9 Workshop 6 Linear Data Structures – Part 2 Applications → Start Learning / Flashcards Téléchargement MP3

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

Week 9 Workshop 6 Linear Data Structures – Part 2 Applications