→ Week 9 Workshop 6 Linear Data Structures – Part 2 Applications → Comece a aprender / Download de MP3 Flashcards

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

Week 9 Workshop 6 Linear Data Structures – Part 2 Applications