Amy P

[aphunk]

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 Structures are objects that are described by their methods and behaviors, and not by their implementation.
Describe a Stack	A stack is a data structure for which its elements can only be accessed in last in, first out order.
What are the 5 methods in Stack and what does each do?	1. Initialize - creates a new stack; 2. Push - adds to the top of the stack; 3. Pop - removes from the top; 4. Empty - determines whether the stack is empty or not; 5. to_s - presents the data in the stack as a string
Describe a Queue	A queue is a data structure in which operates in a first in, first out order.
What are the 5 methods in Queue and what does each do?	1. Initialize - creates a new queue; 2. Enqueue - adds to the back of the queue; 3. Dequeue - removes and returns the element from the front of the queue; 4. is_empty - determines whether the queue is empty or not; 5. to_s - presents the data in the queue as a string
What is the difference between implementing something and using something?	To implement something is involves applying the behaviors and patterns for that thing; to use something involves the utilization of those behaviors and patterns.

OPTIONAL JobSimulation

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

[CheezItMan]

Overall a lot of promise there with some issues. You did pretty well with the circular buffer and almost had the matching parentheses problem.

Take a look at my comments and let me know what questions you have.

[CheezItMan]

Should that be values or keys?

[CheezItMan]

love the name

[CheezItMan]

Really good!

[CheezItMan]

This is a little expensive way to do this. Maybe instead just do some math.

[CheezItMan]

What if the rear has wrapped around?

Maybe instead you could do until i == @rear