Paper- Saejin #57
Open
Paper- Saejin #57
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
CheezItMan
reviewed
Jan 28, 2022
Comment on lines
19
to
+32
| def enqueue(self, element): | ||
| """ Adds an element to the Queue | ||
| Raises a QueueFullException if all elements | ||
| In the store are occupied | ||
| returns None | ||
| """ | ||
| pass | ||
|
|
||
| if (self.rear + 1) % self.buffer_size == self.front: | ||
| raise QueueFullException() | ||
|
|
||
| elif self.empty(): | ||
| self.front = 0 | ||
| self.rear = 0 | ||
|
|
||
| self.store[self.rear] = element | ||
| self.rear = (self.rear + 1) % self.buffer_size | ||
| self.size +=1 | ||
|
|
||
| return None |
Comment on lines
34
to
+46
| def dequeue(self): | ||
| """ Removes and returns an element from the Queue | ||
| Raises a QueueEmptyException if | ||
| The Queue is empty. | ||
| """ | ||
| pass | ||
| if self.empty(): | ||
| raise QueueEmptyException() | ||
|
|
||
| element = self.store[self.front] | ||
| self.front = (self.front+1)%self.buffer_size | ||
| self.size-=1 | ||
|
|
||
| return element |
Comment on lines
49
to
+56
| def front(self): | ||
| """ Returns an element from the front | ||
| of the Queue and None if the Queue | ||
| is empty. Does not remove anything. | ||
| """ | ||
| pass | ||
| if self.isEmpty(): | ||
| return -1 | ||
| return self.store[self.front] |
| pass | ||
| if self.isEmpty(): | ||
| return -1 | ||
| return self.store[self.front] | ||
|
|
||
|
|
||
| def size(self): |
|
|
||
|
|
||
| def size(self): | ||
| """ Returns the number of elements in | ||
| The Queue | ||
| """ | ||
| pass | ||
| return self.size | ||
|
|
||
| def empty(self): |
Comment on lines
71
to
+83
| def __str__(self): | ||
| """ Returns the Queue in String form like: | ||
| [3, 4, 7] | ||
| Starting with the front of the Queue and | ||
| ending with the rear of the Queue. | ||
| """ | ||
| pass | ||
| arr = [] | ||
|
|
||
| for i in range(self.front, self.rear, 1): | ||
| if self.store[i]: | ||
| arr.append(self.store[i]) | ||
|
|
||
| return str(arr) |
There was a problem hiding this comment.
| @@ -12,7 +12,8 @@ def push(self, element): | |||
| """ Adds an element to the top of the Stack. | |||
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Stacks and Queues
Thanks for doing some brain yoga. You are now submitting this assignment!
Comprehension Questions
OPTIONAL JobSimulation