tracing
in which you will answer Tasks A-1 through A-6 (export as a PDF before handing in)hw7_code.py
in which you will run the code as instructed in Task-4. You will not hand this in.test_hw7.py
which contains your tests (add import pytest
at the top of this file)Honey Beester is going shopping with his family to decorate his snazzy new college dorm! When shopping, he has to keep track of all his family members' orders and the items that they are ordering. In this homework, you will keep track of these orders through memory diagrams.
This assignment mostly has you working with memory diagrams, which we cover to help you understand what your code actually does when updating data. The last part gives you some practice with dictionaries, which you will need for the final project.
Learning Goals:
For tasks involving memory diagrams (Task A-2 and Task A-5), use this template as a starting point. To edit it, make a copy (File -> Make a copy). This is the same template that you saw in Lab 10 – refer to that lab for an example of how to fill out a memory diagram.
To turn in your final memory diagrams, take a screenshot of each diagram and insert it into a single file called tracing.pdf
. Clearly mark which image goes with which memory point. Your final submission for this section should contain your memory diagrams alongside your written answers (see the note at the bottom of this section for full hand-in instructions). Do not submit the spreadsheet itself.
Bee-low is part of a program for managing orders in an online store. There is a data structure for the Items
for sale, as well as a catalog of all items. There is a data structure for Orders
, which capture the name of a customer and a list of items that the customer wants to buy. There are also two versions of a function to update the price of an item in the catalog.
At the bottom of the file is a sequence of expressions to evaluate.
Task A-1: Without running the program or drawing a memory diagram, predict what will be in each of k_order
, m_order
, and catalog
(items and their prices) after the four expressions evaluate. Write down your answers.
Note: You will not lose points for an inaccurate prediction. The point of the question is to help you calibrate your understanding of memory as you work through the problem.
Note: In the code, there is a line that says global catalog
. This just means that the function is going to update the value of catalog
which was defined outside the function.
Task A-2: There are four comments in the code marked "Memory point." Show the contents of memory (variables and heap) at each of these four points. Make sure to include a different memory diagram for each memory point (you should have 4 distinct diagrams). Remember to use the template for your memory diagrams.
Task A-3: Based on your memory diagram, predict what will be in each of k_order
, m_order
, and catalog
(items and their prices) after the four expressions evaluate. Write down your answers.
Note: You will not lose points for an inaccurate answer for this task (as long as you appeared to take the problem seriously)
Task A-4: Now, copy and run the code and compare the final contents of k_order
, m_order
, and catalog
to your answer to the previous task. If they differ, that is an indication that you have a mistake in your memory diagram.
We will show an example of this in class on Friday. Add a pass
statement at the end of this code, and add a breakpoint (click to the left of the pass
statement's line number, so that a red dot appears).
Run the debugger (Run -> Debug) and observe what the contents of k_order
, m_order
, and catalog
are on the left side of the screen.
Task A-5: Revise your memory diagrams from Task A-2 as needed and write down your final answers for each of the four memory points.
You can add breakpoints in other parts of your code and step through to check if the values each variable takes on are the same as you put in the memory diagram at each step. Refer back to Lab 9 and the 11/17 lecture for instructions on using the debugger.
Task A-6: Reflect on your process: were your predictions correct? If yes, write down one way you approached the tasks that you feel was particularly helpful in your thinking. If no, write down a conceptual misconception (not just a wrong answer, but where you think you had a mistake in your thinking) you had and fixed.
Note: Your final file should include:
Remember to check the Handin section for more details!
For this section, create a file called test_hw7.py
. We will ask you to create test data and write assertions for functions that we will describe but not provide, meaning that you will not be running your testing file. The point of this section is to show that you understand how you would set up data for testing under mutation!
Say you were given a function discount_order(ord : Order) -> None
that goes through every Item
in the provided order and takes $1 off the price of each item that costs more than $10.
Task B-1: Write a function called test_discount_order
that sets up at least two Order
s (similar to how k_order
and m_order
were set up above, but you should make your own) and tests that discount_order
behaves as intended. You are only writing a test function for this question. You are NOT writing code for discount_order
itself.
You will be graded on what your Order
s look like (think back to the things you learned about writing comprehensive test examples in Pyret – what sorts of Orders
would be helpful for testing that discount_order
works?). You will also be graded on the correctness of the assertions you write and whether they correctly test the effects of the discount_order
function as described.
Recall that, when testing under mutation, we follow a template where we set up data, call the mutating function, and then test the side-effects of the mutation.
Your function will need to set up some data (items and orders), make one or more calls to discount_order
, then run a series of assertions to check the impacts of the discount_order
call on the data. The general form of your function should be as follows:
Now let's assume that someone wants to use a dict
from strings to floats, instead of a list of Item
s, to keep track of the catalog. For example, the catalog in part A, rewritten in this format, would look like
You're given a function update_cat_dict(cat_dict : dict, itm : Item)
that adds a key-value pair of itm
's description and price to the given dictionary if and only if a key of the given description doesn't already exist in cat_dict
(for example, calling update_cat_dict(catalog, Item("Radio", 8))
would have no effect whereas update_cat_dict(catalog, Item("Phone", 540)
would add the key-value pair "Phone": 540
to catalog
).
Task B-2: Let's assume that someone has given us the update_cat_dict
function and data to test with. Fill in the assertion parts of the following testing function. Think back to the beginning of the November 13th lecture for an example of how we reason about writing tests when we don't know exactly what our testing data looks like. Think about the assumptions you can and cannot make about test_cat_dict
and what it will look like after each call of update_cat_dict
. Just like we did in class, you can create variable(s) to help you in your assertions.
You will be submitting two separate files to Gradescope under Homework 7 – note that you're not submitting a code file!
tracing.pdf
with your answers to the "Memory Tracing" section exercisestest_hw7.py
, which will contain the testing function from the "Testing Under Mutation" sectionBrown University CSCI 0111 (Fall 2024)