Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Mariela Cruz - Scissors #55

Open
wants to merge 1 commit into
base: master
Choose a base branch
from

Conversation

marielaxcruz
Copy link

Stacks and Queues

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

Comprehension Questions

Question Answer
What is an ADT?
Describe a Stack
What are the 5 methods in Stack and what does each do?
Describe a Queue
What are the 5 methods in Queue and what does each do?
What is the difference between implementing something and using something?

OPTIONAL JobSimulation

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

Copy link

@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.

Overall nice work Mariela. I did see a bug in __str__(self):, take a look at my suggestion and let me know what questions you have.

Well done.

Comment on lines +26 to +33
if self.size == self.buffer_size:
raise QueueFullException()
if self.size == 0:
self.front = 0

self.rear = (self.rear + 1) % self.buffer_size
self.size += 1
self.store[self.rear] = element

Choose a reason for hiding this comment

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

👍

Comment on lines +40 to +48
if self.size == 0:
raise QueueEmptyException()
if self.size == 1:
self.rear = -1
self.size -= 1
value = self.store[self.front]
self.store[self.front] = None
self.front = (self.front + 1) % self.buffer_size
return value

Choose a reason for hiding this comment

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

👍

Comment on lines +79 to +81
for i in range(self.front, self. front + self.size):
i &= self.buffer_size
queue.append(self.store[i])

Choose a reason for hiding this comment

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

This is causing an index out of range error.

Suggested change
for i in range(self.front, self. front + self.size):
i &= self.buffer_size
queue.append(self.store[i])
for i in range(self.front, self. front + self.size):
index = i % self.buffer_size
queue.append(self.store[index])

@@ -12,7 +12,7 @@ def push(self, element):
""" Adds an element to the top of the Stack.

Choose a reason for hiding this comment

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

👍 The stack looks good.

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