Queues - Andrea Valliere - Stacks and Queues JobSimulation

[avalliere]

Stacks and Queues

Thanks for doing some brain yoga. You are now submitting this assignment!

Comprehension Questions

Question	Answer
What is an ADT?	ADT stands for Abstract Data Type and encompasses different ways to store data in accordance with behavior
Describe a Stack	A Stack follows 'last in, first out' behavior. Only the most recently added item can be removed.
What are the 5 methods in Stack and what does each do?	A 'push(e)' adds an item to the top, a 'pop()' takes out (or returns) the top item, 'empty?()' tells you if there's any data in the Stack, 'top()' will give you the top item, and 'size()' will state how many items are in the Stack.
Describe a Queue	A Queue follows the 'first in, first out' behavior. An item must go all the way through to come out, much like a line of traffic.
What are the 5 methods in Queue and what does each do?	'Enqueue(e)' adds an item to the back, 'dequeue()' takes out an item from the front, 'front()' will tell you the front item, 'empty?()' will tell you if the Queue holds any data, and 'size()' will tell you how many items are in the Queue.
What is the difference between implementing something and using something?	Implementing implies defining parts of code while using is calling on or accessing parts of code.

OPTIONAL JobSimulation

Question	Answer
Did you include a sample run of your code as a comment?	No

[sudocrystal]

Stacks and Queues

What We're Looking For

Feature	Feedback
Implementation of Stack looks complete	yes
Implementation of Queue looks complete	yes

looks good