Skip to content

stacks and queues done#18

Open
dnsrocha wants to merge 1 commit into
Ada-C14:masterfrom
dnsrocha:master
Open

stacks and queues done#18
dnsrocha wants to merge 1 commit into
Ada-C14:masterfrom
dnsrocha:master

Conversation

@dnsrocha
Copy link
Copy Markdown

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 - A type of object which is described by the methods it has and how they perform.
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? New (initializes the stack), push (adds an item to the stack), pop (removes item from stack), empty (checks if stack is empty), to_s (converts stack to string)
Describe a Queue A Queue is a data structure which stores a list of data and only provides access in a First-In-First-Out (FIFO) order.
What are the 5 methods in Queue and what does each do? New (initializes the queue), enqueue (adds an item to the queue), dequeue (removes an item from the queue and provides ice cream), empty (checks if a queue is empty), to_s (converts a queue to string)
What is the difference between implementing something and using something? Implementing is writing the code behind a problem statement or objective, while using is just running it.

OPTIONAL JobSimulation

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

Copy link
Copy Markdown

@CheezItMan CheezItMan left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Well done Denise, you hit the learning goals here. Nice work!

Comment thread lib/queue.rb
@size = 0
end

def enqueue(element)
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment thread lib/queue.rb
end
end

def dequeue
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment thread lib/queue.rb
raise NotImplementedError, "Not yet implemented"
if @size != 0
element = @store[@start]
@start = (@start + 1 ) % 20
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Avoid hardcoding the 20

Suggested change
@start = (@start + 1 ) % 20
@start = (@start + 1 ) % @store.length

Comment thread lib/queue.rb
end
end

def front
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment thread lib/queue.rb
return @store[@start]
end

def size
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment thread lib/queue.rb
return @size
end

def empty?
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment thread lib/queue.rb
return @size == 0
end

def to_s
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Comment thread lib/stack.rb
@@ -1,19 +1,26 @@
class Stack
Copy link
Copy Markdown

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

👍

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

2 participants