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

Al Leonard - Completed assignement with all tests passing. #41

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

Conversation

Alli-Oops
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, although the stack was supposed to be made using a LinkedList instead.

@@ -15,48 +14,78 @@ def __init__(self):
self.front = -1
self.rear = -1
self.size = 0


def enqueue(self, element):

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
else:
self.rear = (self.rear + 1) % self.buffer_size
self.store[self.rear] = element

def dequeue(self):

Choose a reason for hiding this comment

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

👍

self.rear = -1
else:
self.front = (self.front + 1) % self.buffer_size
return data

def front(self):

Choose a reason for hiding this comment

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

👍


if self.empty():
return None
return self.store[self.front]

def size(self):

Choose a reason for hiding this comment

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

👍


def size(self):
""" Returns the number of elements in
The Queue
"""
pass
size = self.__str__().count(",") + 1
return size

def empty(self):

Choose a reason for hiding this comment

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

👍


def empty(self):
""" Returns True if the Queue is empty
And False otherwise.
"""
pass
return self.front == -1

def __str__(self):

Choose a reason for hiding this comment

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

👍

@@ -1,18 +1,20 @@
from stacks_queues.linked_list import LinkedList
# from stacks_queues.linked_list import LinkedList

class StackEmptyException(Exception):
pass

class Stack:

Choose a reason for hiding this comment

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

The assignment was to use the LinkedList as the internal data structure for the Stack.

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