Alex

[alexandria7]

Stacks and Queues

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

Comprehension Questions

Question	Answer
What is an ADT?	An abstract data type is a data type that is characterized not by what it is made of but rather the operations it performs and rules it follows. It describes the implementation of whatever data type you use.
Describe a Stack	An abstract data type that is characterized by its push and pop methods and its following of "last in, first out", i.e. when you remove or "pop" an element from a stack, what is removed is the last thing that was added or "pushed" to it.
What are the 5 methods in Stack and what does each do?	pop => removes the item from the top of the stack i.e. the last item added; push => takes a value and adds it to the top of the stack; peek => looks at whatever the value is at the top of the stack and returns it; empty? => returns true if the stack is empty, false if it is not; initialize => creates access to whatever data type you will be utilizing for the stack
Describe a Queue	An abstract data type that is characterized by its enqueue and dequeue methods and its following of "first in first out", i.e. when you dequeue an element from the queue it begins with whatever was added to it first.
What are the 5 methods in Queue and what does each do?	enqueue => takes an element and adds it to the queue; dequeue => removes an element from the queue, starting with the item that was added first; empty? => returns true if the stack is empty, false if it is not; initialize => creates access to whatever data type you will be utilizing for the queue; front/peek => returns the element at the beginning/front of the queue
What is the difference between implementing something and using something?	Implementing something means taking something to infer or define functionality, while using something implies just producing a result.

OPTIONAL JobSimulation

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

[CheezItMan]

Overall nice work, you hit the learning goals here. Take a look at my comments and let me know if you have any questions.

[CheezItMan]

Nice use of a hash!

[CheezItMan]

An array of arrays?

[alexandria7]

WHOOPS! totally a mistake

[CheezItMan]

This is a little bit less efficient than if you started at the front and counted through until you found the rear, or better yet calculated the size.

[CheezItMan]

If the rear wraps around the array, the output here wouldn't be quite right.