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

Pine-Alma #44

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

Pine-Alma #44

wants to merge 1 commit into from

Conversation

abecerrilsalas
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? abstract data type.
Describe a Stack Is an abstract data type which stores data Last-in-first-out order.
What are the 5 methods in Stack and what does each do? 1. push(item)-this adds an item to top of stack. 2. pop- removes and returns the item at the top of stack. 3. is_empty- returns true if stack is empty. 4. peek- returns without removing the item at the top of stack. 5. size- returns the number of items on the stack.
Describe a Queue an abstract data type that stores data in a first-in-first-out order.
What are the 5 methods in Queue and what does each do? 1. enqueue- puts item into the back of queue. 2. dequeue- removes and returns the item at the front of queue. 3. is_empty - returns true is queue is empty. 4. front- gets the item from the front of queue. 5. rear- gets the last item from queue
What is the difference between implementing something and using something? Implementing is the actual creation of the methods/ classes.

OPTIONAL JobSimulation

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

Copy link

@kyra-patton kyra-patton left a comment

Choose a reason for hiding this comment

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

✨😎 Nice work Alma. Looks like you hit all the learning goals. Let me know what questions you have.

🟢

@@ -15,47 +15,81 @@ 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.rear = (self.rear + 1) % self.buffer_size
self.store[self.rear] = element
self.size += 1


def dequeue(self):

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 None
else:
return 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
return self.size

def empty(self):

Choose a reason for hiding this comment

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

pass
if self.size == 0:
return True
return False

def __str__(self):

Choose a reason for hiding this comment

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

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

Choose a reason for hiding this comment

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

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

def pop(self):

Choose a reason for hiding this comment

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

if self.store.head is None:
raise StackEmptyException
return self.store.remove_first()


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 Stack is empty
And False otherwise
"""
pass
return self.store.empty()

def __str__(self):

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