Branches - Emily Ball

[eaball35]

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 - a type of object which is described by the methods it has and how they perform. Public interface is provided but implementation details are private.
Describe a Stack	Data structure, Last in - First out, Like a stack of books
What are the 5 methods in Stack and what does each do?	1. Initialize : creates a new LinkedList, 2. Push: Adds element to top of stack, 3. Pop: Takes last in element off of stack, 4. Empty? - Checks if stack has nothing in it, 5. To_s - Turns implementation into readable format
Describe a Queue	Data structure, First in - First out, Like a line in a store
What are the 5 methods in Queue and what does each do?	1. Initialize : Creates array of specified size, 2. Dequeue: Remove element from queue 3. Enqueue: Adds element into queue 4. Front: Returns the front pointer in circular buffer implementation 5. To_s: Returns implementation in readable format
What is the difference between implementing something and using something?	Implementing is the details in which you choose to make something work. For example using an array or LinkedList. Using something is how you expect the abstraction to perform. For example, when you use the Queue class you expect it to work like a data structure that stores in elements first in, first out and has certain common methods despite implementation.

OPTIONAL JobSimulation

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

[CheezItMan]

You have some minor issues with Queue, but otherwise this is very well done. Nice work! You hit all the major learning goals here. Well done.

[CheezItMan]

👍

[CheezItMan]

👍

[CheezItMan]

👍

[CheezItMan]

Suggested change

	return @front
	return @stores[@front]

[CheezItMan]

I think you have this reversed here.

Suggested change

	return @front - @back if @front > @back
	return @back + (@store.length - @front)
	return @back - @front if @front < @back
	return @back + (@store.length - @front)

[CheezItMan]

👍 This works, but you could do it with just a single loop like while i != @back