→ Week 9 Workshop 6 Linear Data Structures – Part 2 Applications →学習を始める /ダウンロードMP3フラッシュカード

学び始める

質問		答え
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