-
Notifications
You must be signed in to change notification settings - Fork 61
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
C15 - Katrina K #38
base: master
Are you sure you want to change the base?
C15 - Katrina K #38
Conversation
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Nicely done Katrina, you hit the learning goals here. Great work.
|
||
# buffer is full | ||
if self.size == self.buffer_size: | ||
raise QueueFullException | ||
|
||
# buffer is empty and new | ||
if self.front == -1: | ||
print("Imma new buffer!") | ||
self.front = 0 | ||
self.rear = 1 | ||
self.store[self.front] = element | ||
self.size += 1 | ||
return | ||
|
||
self.store[self.rear] = element | ||
self.rear = (self.rear + 1 ) % self.buffer_size | ||
self.size += 1 |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
|
||
self.store[self.rear] = element | ||
self.rear = (self.rear + 1 ) % self.buffer_size | ||
self.size += 1 | ||
|
||
def dequeue(self): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
self.front = (self.front + 1) % self.buffer_size | ||
self.size -= 1 | ||
|
||
return element | ||
|
||
def front(self): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍
if self.size == 0: | ||
return True | ||
|
||
return False | ||
|
||
def __str__(self): |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 Nicely done
if self.size == 0: | ||
return True | ||
|
||
return False |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
if self.size == 0: | |
return True | |
return False | |
return self.size == 0 |
@@ -12,27 +12,34 @@ def push(self, element): | |||
""" Adds an element to the top of the Stack. | |||
Returns None | |||
""" | |||
pass | |||
self.store.add_first(element) |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
👍 The Stack class works
Stacks and Queues
Thanks for doing some brain yoga. You are now submitting this assignment!
Comprehension Questions
OPTIONAL JobSimulation