Earth - Sophie

[steve-messing]

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 hides the inner structure and design of a data type, and is defined by its behavior for the user
Describe a Stack	Last in first out like a stack of plates
What are the 5 methods in Stack and what does each do?	initialize, push, pop, empty?, to_s
Describe a Queue	first in, first out like a line at the grocery store
What are the 5 methods in Queue and what does each do?	initialize, enqueue, dequeue, front, size, empty?, to_s
What is the difference between implementing something and using something?	we can use stacks and queues because they are built in data types. It's unusual to have to implement them from scratch

OPTIONAL JobSimulation

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

[CheezItMan]

I gave feedback on the matching parens problem. The Queue wasn't done with a circular buffer so it really isn't what was asked. Otherwise well done.

[CheezItMan]

Maybe set up a dictionary where the keys are the close markers ), }, ] and the values are the matching open characters. Then you can do if the current character isn't a key in the hash you can push it onto the stack, if it IS a close character, you can then compare

return false if char_hash[char]  != stack.pop()

[CheezItMan]

The Queue is supposed to be done with a circular buffer so...

[CheezItMan]

👍