Leaves - Dominique

[dtaylor73]

Stacks and Queues

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

Comprehension Questions

Question	Answer
What is an ADT?	It is a type of object which is described by the methods it has and how they perform. Implementation details are not included
Describe a Stack	A Stack is a data structure which stores a list of data and only provides access in a Last-In-First-Out (LIFO) order.
What are the 5 methods in Stack and what does each do?	Push (put data on the top of the stack), pop (delete data from the top of the stack), is_empty? (returns true if the stack is empty)
Describe a Queue	A queue unlike a stack operates in a first-in-first out order. Like a line of people at a concert, the first element to enter the queue is the first element removed.
What are the 5 methods in Queue and what does each do?	Enqueue (adds data to the back of the queue), dequeue (removes data from the front of the queue), front (returns the data at the front of the queue), size (returns the length of the queue), empty (returns true if the queue is empty)
What is the difference between implementing something and using something?	A queue using an array, but the array is doing the implementation.

OPTIONAL JobSimulation

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

[CheezItMan]

Nice work, you hit the learning goals here. Well done. Take a look at my comments and let me know if you have questions.

[CheezItMan]

Data?

[CheezItMan]

👍

[CheezItMan]

👍

[CheezItMan]

👍

[CheezItMan]

This only gives the size of the internal array size, not the number of elements in the Queue.

[CheezItMan]

Suggested change

	return true if @front == @back
	return false
	return @front == @back