Time - Sharon

[sharonkeikei]

Stacks and Queues

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

Comprehension Questions

Question	Answer
What is an ADT?	An Abstract Data Type is a data type which specifies an external interface without prescribing a specific implementation.
Describe a Stack	A Stack is an Abstract Data Type which stores data and allows access in a Last-In-First-Out order (LIFO)
What are the 5 methods in Stack and what does each do?	1. push - Add an element to the top of the stack 2.pop - Remove & return the element from the top 3. is_empty - returns true if the stack is empty 4. size - return the size of the stack 5. last - return the last element of the stack
Describe a Queue	A Queue is an Abstract Data Structure which stores data and allows access in a First-In-First-Out order (FIFO)
What are the 5 methods in Queue and what does each do?	1.enqueue - add an element to the rear of the queue 2. dequeue - Remove & return the element from the front 3. is_empty - returns true if the queue is empty 4. size - return the size of the stack 5. front - returning the first element of the queue
What is the difference between implementing something and using something?	Implementation puts importance on how it works and using something puts importance on whether it works or not.

OPTIONAL JobSimulation

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

[CheezItMan]

Well done Sharon, you hit all the learning goals here. Take a look at my comments and let me know what questions you have.

[CheezItMan]

👍 Instead of using the case statements, you could instead use a hash where the keys are the close braces and the values are the matching open braces.

[CheezItMan]

👍
You can make @rear go to the next index with @rear = (@rear + 1) % size

[CheezItMan]

You can adjust @front the same way rear can change (See above).

[CheezItMan]

👍

[CheezItMan]

👍