Mini Quiz 3
Due by 11:59pm on Friday, 4/8 (optional)
Complete the quiz and submit it before 11:59pm on Friday, 4/8 (optional). You must work alone. You may use any course materials, including an interpreter, course videos, slides, and readings. Please do not discuss these specific questions with your classmates, and do not scour the web for answers or post your answers online.
Your submission will be graded automatically for correctness.
Asking Questions: If you believe you need clarification on a question, make a private post on Piazza. Please do not post publicly about the quiz contents. If the staff discovers a problem with the quiz or needs to clarify a question, we will email the class via Piazza. You can also come to office hours to ask questions about the quiz or any other course material, but no answers or hints will be provided in office hours.
ok program helps you test your code and track your progress.
The first time you run the autograder, you will be asked to log in with your
@berkeley.edu account using your web browser. Please do so. Each time you run
ok, it will back up your work and progress on our servers.
You can run all the unlocking tests with the following command:
python3 ok -u
If you want to see how you did on all tests, you can use the
python3 ok -v
If you do not want to send your progress to our server or you have any
problems logging in, add the
--local flag to block all
python3 ok --local
Submission: You may submit more than once before the deadline; only the final submission will be scored.
When you are ready to submit, run
ok with the
python3 ok --submit
Readings: You might find the following references useful:
This "Mini-Quiz" is completely optional. Do as much or as little as you want.
To begin the quiz, use the following ok command:
python3 ok -u
Run-length encoding is a very simple data compression technique, whereby runs of data are compressed and stored as a single value. A run is defined to be a contiguous sequence of the same number. For example, in the (finite) sequence
1, 1, 1, 1, 1, 6, 6, 6, 6, 2, 5, 5, 5
there are four runs: one each of 1, 6, 2, and 5. We can represent the same sequence as a sequence of two-element lists:
(1 5), (6 4), (2 1), (5 3)
Notice that the first element of each list is the number of times a particular number appears in a run, and the second element is the number in the run.
We will extend this idea to (possibly infinite) streams. Write a
rle that takes in a stream of data, and returns a
corresponding stream of two-element lists, which represents the run-length
encoded version of the stream. You do not have to consider compressing
(define (rle s) 'YOUR-CODE-HERE )