Skip to content

Latest commit

 

History

History
executable file
·
146 lines (84 loc) · 12.4 KB

README.md

File metadata and controls

executable file
·
146 lines (84 loc) · 12.4 KB

Homework 6 | CS 61A Spring 2024

Homework 6: OOP, Linked Lists

Due by 11:59pm on Thursday, March 14

Instructions

Download hw06.zip. Inside the archive, you will find a file called hw06.py, along with a copy of the ok autograder.

Submission: When you are done, submit the assignment by uploading all code files you've edited to Gradescope. You may submit more than once before the deadline; only the final submission will be scored. Check that you have successfully submitted your code on Gradescope. See Lab 0 for more instructions on submitting assignments.

Using Ok: If you have any questions about using Ok, please refer to this guide.

Grading: Homework is graded based on correctness. Each incorrect problem will decrease the total score by one point. This homework is out of 2 points.

Required Questions

Getting Started Videos

These videos may provide some helpful direction for tackling the coding problems on this assignment.

To see these videos, you should be logged into your berkeley.edu email.

YouTube link

Midsemester Survey

Q1: Mid-Semester Feedback

As part of this homework, fill out the Mid-Semester Feedback form.

Confidentiality: Your responses to the survey are confidential, and only the instructors will be able to see this data unanonymized. More specifics on confidentiality can be found on the survey itself.

Once you finish the survey, you will be presented with a passphrase (if you miss it, it should also be at the bottom of the confirmation email you receive). Put this passphrase, as a string, on the line that says passphrase = '*** PASSPHRASE HERE ***' in the Python file for this assignment.

Use Ok to test your code:

python3 ok -q midsem_survey

OOP

Q2: Vending Machine

In this question you'll create a vending machine that sells a single product and provides change when needed.

Create a class called VendingMachine that represents a vending machine for some product. A VendingMachine object returns strings describing its interactions. Make sure your output exactly matches the strings in the doctests including punctuation and spacing!

You may find Python's formatted string literals, or f-strings useful. A quick example:

>>> feeling = 'love'>>> course = '61A!'>>> f'I {feeling} {course}''I love 61A!'

Fill in the VendingMachine class, adding attributes and methods as appropriate, such that its behavior matches the following doctests:

class VendingMachine:    """A vending machine that vends some product for some price.    >>> v = VendingMachine('candy', 10)    >>> v.vend()    'Nothing left to vend. Please restock.'    >>> v.add_funds(15)    'Nothing left to vend. Please restock. Here is your $15.'    >>> v.restock(2)    'Current candy stock: 2'    >>> v.vend()    'Please add $10 more funds.'    >>> v.add_funds(7)    'Current balance: $7'    >>> v.vend()    'Please add $3 more funds.'    >>> v.add_funds(5)    'Current balance: $12'    >>> v.vend()    'Here is your candy and $2 change.'    >>> v.add_funds(10)    'Current balance: $10'    >>> v.vend()    'Here is your candy.'    >>> v.add_funds(15)    'Nothing left to vend. Please restock. Here is your $15.'    >>> w = VendingMachine('soda', 2)    >>> w.restock(3)    'Current soda stock: 3'    >>> w.restock(3)    'Current soda stock: 6'    >>> w.add_funds(2)    'Current balance: $2'    >>> w.vend()    'Here is your soda.'    """    "*** YOUR CODE HERE ***"

Use Ok to test your code:

python3 ok -q VendingMachine

Check Your Score Locally

You can locally check your score on each question of this assignment by running

python3 ok --score

This does NOT submit the assignment! When you are satisfied with your score, submit the assignment to Gradescope to receive credit for it.

Submit

Submit this assignment by uploading any files you've edited to the appropriate Gradescope assignment. Lab 00 has detailed instructions.

In addition, all students who are not in the mega lab must complete this attendance form. Submit this form each week, whether you attend lab or missed it for a good reason. The attendance form is not required for mega section students.

Optional Questions

Q3: Store Digits

Write a function store_digits that takes in an integer n and returns a linked list where each element of the list is a digit of n.

Important: Do not use any string manipulation functions like str and reversed.

def store_digits(n):    """Stores the digits of a positive number n in a linked list.    >>> s = store_digits(1)    >>> s    Link(1)    >>> store_digits(2345)    Link(2, Link(3, Link(4, Link(5))))    >>> store_digits(876)    Link(8, Link(7, Link(6)))    >>> store_digits(2450)    Link(2, Link(4, Link(5, Link(0))))    >>> # a check for restricted functions    >>> import inspect, re    >>> cleaned = re.sub(r"#.*\\n", '', re.sub(r'"{3}[\s\S]*?"{3}', '', inspect.getsource(store_digits)))    >>> print("Do not use str or reversed!") if any([r in cleaned for r in ["str", "reversed"]]) else None    """    "*** YOUR CODE HERE ***"

Use Ok to test your code:

python3 ok -q store_digits

Q4: Mutable Mapping

Implement deep_map_mut(func, link), which applies a function func onto all elements in the given linked list lnk. If an element is itself a linked list, apply func to each of its elements, and so on.

Your implementation should mutate the original linked list. Do not create any new linked lists.

Hint: The built-in isinstance function may be useful.

>>> s = Link(1, Link(2, Link(3, Link(4))))>>> isinstance(s, Link)True>>> isinstance(s, int)False

Construct Check: The last doctest of this question ensures that you do not create new linked lists. If you are failing this doctest, ensure that you are not creating link lists by calling the constructor, i.e.

s = Link(1)
def deep_map_mut(func, lnk):    """Mutates a deep link lnk by replacing each item found with the    result of calling func on the item. Does NOT create new Links (so    no use of Link's constructor).    Does not return the modified Link object.    >>> link1 = Link(3, Link(Link(4), Link(5, Link(6))))    >>> print(link1)    <3 <4> 5 6>    >>> # Disallow the use of making new Links before calling deep_map_mut    >>> Link.__init__, hold = lambda *args: print("Do not create any new Links."), Link.__init__    >>> try:    ...     deep_map_mut(lambda x: x * x, link1)    ... finally:    ...     Link.__init__ = hold    >>> print(link1)    <9 <16> 25 36>    """    "*** YOUR CODE HERE ***"

Use Ok to test your code:

python3 ok -q deep_map_mut

Q5: Two List

Implement a function two_list that takes in two lists and returns a linked list. The first list contains the values that we want to put in the linked list, and the second list contains the number of each corresponding value. Assume both lists are the same size and have a length of 1 or greater. Assume all elements in the second list are greater than 0.

def two_list(vals, counts):    """    Returns a linked list according to the two lists that were passed in. Assume    vals and counts are the same size. Elements in vals represent the value, and the    corresponding element in counts represents the number of this value desired in the    final linked list. Assume all elements in counts are greater than 0. Assume both    lists have at least one element.    >>> a = [1, 3]    >>> b = [1, 1]    >>> c = two_list(a, b)    >>> c    Link(1, Link(3))    >>> a = [1, 3, 2]    >>> b = [2, 2, 1]    >>> c = two_list(a, b)    >>> c    Link(1, Link(1, Link(3, Link(3, Link(2)))))    """    "*** YOUR CODE HERE ***"

Use Ok to test your code:

python3 ok -q two_list

Exam Practice

Homework assignments will also contain prior exam questions for you to try. These questions have no submission component; feel free to attempt them if you'd like some practice!

Object-Oriented Programming

  1. Spring 2022 MT2 Q8: CS61A Presents The Game of Hoop.
  2. Fall 2020 MT2 Q3: Sparse Lists
  3. Fall 2019 MT2 Q7: Version 2.0

Linked Lists

  1. Fall 2020 Final Q3: College Party
  2. Fall 2018 MT2 Q6: Dr. Frankenlink
  3. Spring 2017 MT1 Q5: Insert