Angele Z.

[geli-gel]

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 of a list type of data structure with a first-in, last-out working.
What are the 5 methods in Stack and what does each do?	Stack has initialize (to create a linked list), push (to add to the end of the list), pop (to remove from the end of the list), empty? (to check if the list is empty), and to_s (to traverse and print the info from the linked list)
Describe a Queue	An ADT of a list type of data structure with a first-in, first-out working.
What are the 5 methods in Queue and what does each do?	initialize (to create an array of a fixed size), enqueue (to add to the array), dequeue( to remove from the array), front (to show what is at the front (next to be dequeued) of the array, and size (to return the length of the queue that isn't empty - from the front pointer to the back pointer)
What is the difference between implementing something and using something?	Implementing something means using basic structures to make it work a certain way (like using arrays to form a system of a first in, last out sort of queue) and using is just calling the methods that have already been implemented.

OPTIONAL JobSimulation

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

[CheezItMan]

Well you have most of the Stack class working, with one error, otherwise nice work. If you add any methods to Queue and want me to look over it, ping me in Slack and I'll give additional feedback.

I would have liked to see at least dequeue attempted.

[CheezItMan]

👍

[CheezItMan]

This should probably be:

Suggested change

	return @store ? true : false
	return @store.empty?

Because @store is an instance of LinkedList and won't be nil.

[CheezItMan]

Just noting dequeue and size are not implemented