Presentation is loading. Please wait.

Presentation is loading. Please wait.

CMPUT 101 Lab # 2 September 17, 2007 14:00 – 16:50.

Similar presentations


Presentation on theme: "CMPUT 101 Lab # 2 September 17, 2007 14:00 – 16:50."— Presentation transcript:

1 CMPUT 101 Lab # 2 September 17, 2007 14:00 – 16:50

2 Recap Lab # 1: Guido World (.wld) Robot [ave] [street] [direction] [# of beeper] Robot 3 2 E 1 Wall [ave] [street] [direction] [length] Wall 3 4 S 2 Beepers [ave] [street] [# of beeper] Beepers 1 4 6

3 Recap Lab # 1: Guido Program (.gvr) move, turnleft, pickbeeper, putbeeper, turnoff All “define” instructions have to be at the beginning of the file.

4 Conditionals conditional branching if : if front_is_clear: move indicates a set of instructions within the same indent. All conditions you can use are listed in Step08 guide

5 Iteration while loop while : while front_is_clear: move While do until the test condition is false.

6 Iteration Do do : do 5: move

7 Part a Step09: use do, and if instructions Guido will shut down if asked to pick up a beeper and there is not one there, which conditional to use? check if wall reached. Which conditional will be used to check if wall reached? Read Step08 first

8 Step08 robot 1 2 E Beepers 3 2 1 Beepers 4 2 1 Beepers 6 2 1 Beepers 8 2 1 Beepers 9 2 1 Beepers 10 2 1 Beepers 12 2 1 Wall 12 2 E

9 Part b use while instead of do, street can be any length, wall at the end

10 Part c check for multiple beepers, do we know how many? which conditional? while more beepers, keep picking up

11 Part d traverse each row, pick up beepers, until North East corner reached. Drop beepers, how would you check if any are in the bag? See figures for example

12 Part e Consider the map --- see figure Use the program in part d but run in the new world No need to write a new program Answer the questions verbally

13 Keep in mind use block structures (routines) to simplify the code e.g. turnNorth, turnEast, sweepOneRow, etc. students can work in teams of two, or three (if there is an odd number of students), or can also work individually test with both sample worlds provided


Download ppt "CMPUT 101 Lab # 2 September 17, 2007 14:00 – 16:50."

Similar presentations


Ads by Google