stack and queue done tests re passing

[Bitaman]

Stacks and Queues

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

Comprehension Questions

Question	Answer
What is an ADT?	It is a type of object which is described by the method it has and how they perform. Implementation methods are not included.
Describe a Stack	A data structure that stores a list of data and only allows access in a last in fist out order(LIFO)
What are the 5 methods in Stack and what does each do?	Push: push an item into the stack at the top. Pop: removes and return an item from the top. Is_empty: returns true if the stack is empty and false if it's not. Peek: returns but not removes the item on top of the stack. Size: returns the number of items in the stack.
Describe a Queue	A data structure that stores a list of data and only allows access in the first in first out order(FIFO)
What are the 5 methods in Queue and what does each do?	enqueue: puts an item in the back of the queue. dequeue: removes an item from the front of the queue. is_empty: returns true if the queue is empty and false if it is not.
What is the difference between implementing something and using something?	Implementing is writing the methods that describe the behavior, and using is using the behaviors that already exists.

OPTIONAL JobSimulation

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

[CheezItMan]

There's nothing here for me to review. Did you forget to commit something?