Branches - Julia Bouvier

[juliabouv]

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	An ADT where elements are last in first out.
What are the 5 methods in Stack and what does each do?	initialize sets up the internal structure as a linked list, push adds and element to the end of the stack, pop removes an element from the end of the stack, empty checks if the stack is empty, and to_s returns the stack as a string.
Describe a Queue	An ADT where elements are first in first out.
What are the 5 methods in Queue and what does each do?	enqueue adds a value to the back of the queue, dequeue removes the value from the front of the queue, front returns the front value, size returns the length of the queue, and empty checks if the queue is empty.
What is the difference between implementing something and using something?	Implementing is creating something to be used, and using something is well, using that something.

OPTIONAL JobSimulation

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

[CheezItMan]

Overall not bad, some minor issues with your Queue class. Take a look at my comments and let me know any questions you have.

[CheezItMan]

👍

[CheezItMan]

At this point you also need to check to see if @front == @back and if so, the queue is empty now and you need to reset them to -1.

[CheezItMan]

back and front are numbers, how would they have lengths?

[CheezItMan]

👍