Brenna's Stacks & Queues

[bcmdarroch]

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	ADT that follows the rule last in, first out.
What are the 5 methods in Stack and what does each do?	Push adds an element to the top of the stack. Pop removes the most recently added element, or the top of the stack. Top returns the top of the stack. Size returns the total number of elements. Empty? checks if the stack has any elements.
Describe a Queue	ADT that follows the last in, last out.
What are the 5 methods in Queue and what does each do?	Enqueue adds an element to the end of the queue. Dequeue removes the first in the queue. Front returns the element that is first in the queue. Size returns the total number of elements. Empty? checks if the queue has any elements.
What is the difference between implementing something and using something?	Implementing is defining something (as in a class, method, etc). Using something is using it to do something with your code.

OPTIONAL JobSimulation

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

[sudocrystal]

:)

[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