CSc 120 (Fall 26): Assignment 2

This assignment aims to work on more complex Python data structures, in particular focusing on dictionaries.

General Requirements

1. For the long problem, your code should follow the style guidelines for the class.
2. You may not use material not yet covered in class. See the Restrictions section below. If you don't know what any of those Python contructs are, don't worry, because you can't use them accidentally.
3. Use of any restricted material will result in a -20 point deduction.

Restrictions

You may not use concepts and/or short-hand syntax not yet covered in class. The restrictions include the following:
• dictionary or list comprehensions, e.g., [n * 2 for i in range(10)]
• with open (explicitly open and close the file instead)
• the ternary operator (use an if instead)
• nested functions (using def within a function to define another function)
• exceptions (try/except)
• type annotations
• lambda expressions
• map/filter
• generators and user defined iterators
• default arguments
• decorators
• importing libraries (unless a library is explicitly mentioned in the specification)

Short Problems (Due 7:00pm Thu Sep 10)

(20 points)

The problems below must be solved and submitted to the PA-02-Shorts folder on Gradescope. Please follow this guide for turning in your short problems: Guide to submitting the short problems

The short problems for this assignment are the following:

1. Sum a CSV string

2. Convert a list of lists to a dictionary

3. Shuffle a dictionary

4. Invert a dictionary

5. Update a 2-level dictionary

Long Problem (Due 7:00pm Tue Sep 15)

(80 points)

1. Pokemon data analysis