ReviewSessionPractice

ReviewSessionPractice - REVIEW SESSION PRACTICE MIDTERM...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
REVIEW SESSION PRACTICE MIDTERM RockClimbingKarel In this problem, you will write a Karel program where Karel climbs a mountain to put a flag at the edge of a cliff. Karel may leave beepers in the process of finding the top, but must clean everything up before it stops. Notice that the cliff can keep growing outwards, but will always grow by one avenue at a time. For example, Karel will transform the world shown below at the left to the world shown below at right: You can assume the following conditions: - The world is at least two by two - There are no beepers on the world - Karel always starts at (1,1) - Flying spiders can leave random webs hanging from the top. Actually, this is just for fun and because it’s 6am as I’m writing this, but the real condition here is that Karel must climb along the edge of the wall to reach the top. Here is the starter code: public class RockClimbingKarel extends SuperKarel { public void run(){ //Your code here } }
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
RandomClickDrag
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/18/2010 for the course CS 106A taught by Professor Sahami,m during the Fall '08 term at Stanford.

Page1 / 4

ReviewSessionPractice - REVIEW SESSION PRACTICE MIDTERM...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online