DOC PREVIEW
Berkeley CS 61A - Fall 2011 Online (with BYOB) Midterm

This preview shows page 1 out of 2 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 2 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

CS10 Practice With-BYOB Midterm Below are screenshots of the first four iterations of a beautiful fractal. Write code that generates the fractal (you don’t have to match our exact placement on the screen as), and name it FractalYourfirstnameYourlastname.ypr (e.g., FractalBarackObama.ypr). Also, save a screenshot of the fifth iteration (right-mouse-click on the stage and choose “save picture of stage...”) and name the resulting GIF similarly, i.e., FractalBarackObama.gif). Submit both as attachments. Though this may look daunting at first, it really isn’t that bad. Remember, every fractal has a base case (n = 0) and recursive case. We’ve drawn the fractal with bold lines to indicate the parts of the drawing that will recurse; the other parts of the drawing at n = 1 are just lines. (You don’t have to copy our bold-vs-normal technique.) Look at how the single L shape at n=0 transforms into the n=1 case -- this happens for every bold L when it goes to the next level. n = 0 n = 1 n = 2 n =


View Full Document

Berkeley CS 61A - Fall 2011 Online (with BYOB) Midterm

Download Fall 2011 Online (with BYOB) Midterm
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Fall 2011 Online (with BYOB) Midterm and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Fall 2011 Online (with BYOB) Midterm 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?