Time - Olga

[olgapatrakova]

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, defines a way it should function, not inner implementation
Describe a Stack	An abstract data type that serves as a collection of elements, with two main principal operations: push, which adds an element to the collection, and pop, which removes the most recently added element that was not yet removed.
What are the 5 methods in Stack and what does each do?	push - adds a new element on top; pop - removes most recent/first element; empty? - checks if the stack has no elements; initialize - initializes a new object of a class Stack; to_s - returns stack elements as a string
Describe a Queue	A queue is an abstract data type of entities that are maintained in a sequence and can be modified by the addition of entities at one end of the sequence and the removal of entities from the other end of the sequence
What are the 5 methods in Queue and what does each do?	enqueue - add to the rear; dequeue - remove the element which was added first; front - shows the first element without dequeueing it; size - return how many elements there are in the Queue; empty? - checks if the queue is empty
What is the difference between implementing something and using something?	Implementing is when you describe an algorithm of how a data structure works. Using is when you call methods of a data structure without knowing the algorithm of its implementation.

OPTIONAL JobSimulation

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

[CheezItMan]

Nice work Olga, you hit all the learning goals here. Well done.

[CheezItMan]

👍

[CheezItMan]

I love the use of a hash here!

[CheezItMan]

👍

[CheezItMan]

👍 , Well done, good work implementing a circular buffer!