code done and passes specs

[ssamant]

Stacks and Queues

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

Comprehension Questions

Question	Answer
What is an ADT?	Abstract Data Type
Describe a Stack	a collection of items that get stacked on top of each other like a pile of books. You can only get to the book on top (last in, first out)
What are the 5 methods in Stack and what does each do?	push -- adds item to top of stack, pop -- removes and returns top item, size -- returns length of stack, top -- returns the last item added (doesn't remove it), empty? tells you if there is anything in the stack
Describe a Queue	a collection of items that form a line. first item added to the queue is the first to be removed. (FIFO)
What are the 5 methods in Queue and what does each do?	enqueue -- add an element to back of queue, dequeue -- remove and return element from front of queue, size -- how long is queue, empty? is there anything in the queue, front -- what is the first thing waiting at front of queues (doesn't remove it)
What is the difference between implementing something and using something?	hmm...implementing something is writing it up in code (like def method); using something is calling it in a program -- assigning it to a variable, for ex.

OPTIONAL JobSimulation

Question	Answer
Did you include a sample run of your code as a comment?	I am going to do a new commit with that. I only wrote the code (no tests)

[sudocrystal]

Stacks and Queues

What We're Looking For

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

OPTIONAL JobSimulation

Extension	Feedback
Does the code solve the problem to specification?	yes
Is the code easy to follow?	yes
Does the output look good?	yes
Were provided variables and methods used appropriately and not altered in name or definition?	yes
Were any new variables and/or methods made private to the class?	n/a

Looks really good!