Questions

The quiz itself will be similar in difficulty to these practice questions. In addition to these questions, you should review all of your lesson responses on Gradescope. The kinds of questions you responded to on Gradescope could also be on the quiz.

Solutions for each problem can be found at the bottom of this page. (But if you’re unsure, before looking up the solution, try figuring it out on your own or testing it out in Visual Studio!)

Memory Diagrams

Make sure to practice the memory diagrams through “While loops” on the practice page. (You will not have to do diagrams for functions and importing for this quiz.)

While Loops

1. Produce a memory diagram for the following code snippet, being sure to include its stack and output.

    WORD: str = "happy"
    l1_idx: int = 0
    l2_idx: int = 0
    t1: str = ""
    t2: str = ""
    n_appearances: int = 0
   
    while l1_idx < len(WORD):
        t1 = WORD[l1_idx]
        n_appearances = 1
        l2_idx = 0
   
        while l2_idx < len(WORD):
            t2 = WORD[l2_idx]
   
            if (t1 == t2) and (l1_idx != l2_idx):
                n_appearances = n_appearances + 1
            l2_idx = l2_idx + 1
        print(f"{WORD[l1_idx]} appears {n_appearances} times.")
        l1_idx = l1_idx + 1

1.1 What would happen if while l1_idx < len(WORD) in line 8 was replaced with while l1_idx < len(WORD) - 1? Why?

1.2 What would happen if l2_idx=0 was moved to inside the second while loop? In other words, what if lines 11-13 were changed to:

while l2_idx < len(WORD):
    l2_idx = 0

1.3 What would happen if, in line 16, if (t1 == t2) and (l1_idx != l2_idx): was replaced with if (t1 == t2):? Why?

1.4 What would happen if line 18 (l2_idx = l2_idx + 1) was removed? Why?

1.5. What would happen if the < symbol in line 8 was replaced with <=? (In other words, what if it was changed to while l1_idx <= len(WORD):)? Why?

Solutions

Functions

1. The following questions will be in reference to this code block:

    def greet(name: str, friendly: bool) -> str:
        print(f"Hello {name}!")
        if friendly:
            return f"I'm so happy to see you {name}!" 
        else:
            return "Bye!"
    
    def main():
        greet("Lizzie", True)
    
    if __name__ = "__main__":
        main()

1a. On what line(s) is there a return type declaration?

1b. On what line(s) is there a signature?

1c. On what line(s) are there arguments?

1d. On what line(s) are there parameters?

1e. On what line(s) is something returned?

1f. On what line(s) is something printed?

Solutions

2. The following questions will have you practice signature writing.

2a. Write the signature for a function called name_eval that takes as input someone’s name as a string and returns True if the name has an even amount of letters and False if it has an odd amount of letters.

2b. Write the signature for a function called name_size that takes as input someone’s name as a string and returns the length of their name as an integer.

2c. Write the signature for a function called gcd that takes two floats as input and returns the integer that is their greatest common divisor.

Solutions

Solutions

While Loops Solutions

1. 

(We do not require that you write out all interim values as long as the initial and final values are correct like in the solution below. However, writing the interim values will help for practice purposes and to avoid mistakes!)

Here’s a link to a video of the solution!

1.1 “y appears 1 times.” would not print. This is because l1_idx will not enter the while loop for l1_idx = 4. (For more practice, it’d be good to diagram this instance out to see how it would impact the final values of other variables.)

1.2 An infinite loop would occur because l2_idx would always equal 1 when returning to the top of the loop, and therefore l2_idx < len(WORD) will always be True.

1.3 If l1_idx != l2_idx is no longer required, this means that each letter can count itself twice. For example, WORD[0] == WORD[0] is true, so n_appearances for "h" would increase to 2.

1.4 There would be an infinite loop because l2_idx will never increase, and therefore l2_idx < len(WORD) will always be True.

1.5 There would be an index error because there would be the case where l1_idx = 5, so on line 9 WORD[5] would be searching for the element at index 5 in "happy", when the indexes only go up to 4.

Functions Solutions

1a. 1 (optional: 8)

1b. 1, 8

1c. 9 (optional: 12)

1d. 1 (optional: 8)

1e. 4, 6

1f. 2

2a. def name_eval(id: str) -> bool:

(Note that I chose to call the parameter id, but you could’ve chosen any valid name!)

2b. def name_size(id: str) -> int:

(Note that I chose to call the parameter id, but you could’ve chosen any valid name!)

2c. def gcd(number_a: float, number_b: float) -> int:

(Note that I chose to call the parameters number_a and number_b, but you could’ve chosen any valid name!)