Quiz One Study Guide - Fall 2011
Monday, October 17th
What is the output you would see on the NetLogo grid after running the ExampleOne procedure? (Draw a rough picture of about what it would look like). TO ExampleOne ca cro 8 ask turtles [ fd 5 pd fd 5 pu fd 2 pd fd 2 pu fd 2 ] END
Show what the screen or the NetLogo grid would probably look like AFTER the following procedure ExampleTwo finishes. (Note: there may be many possible drawings that get full credit for this question. You will NOT be told this on the exam, but you are being told this for this study guide). CRO versus CRT - VIP to know! TO ExampleTwo CA CRT 8 ask turtles [ PD FD 8 ] END
NetLogo Agents, Decentralization concept questions from the Resnick book on Turtles, Termites and Traffic Jams... also the SIX questions from assignment two Resnick readings.
Fill in the blank with the term, matching, or short answer/definition
of the term of user interface element.
The PREFACE to the Andrew Ford book on Systems Dynamics modeling (Vensim approach).
SHOW THE OUTPUT, roughly what it would look like when stagger is done.
to stagger ca cro 8 ask turtles [ifelse remainder who 2 = 0 [ fd 5 wait 0.2] [ fd 10 wait 0.2] ] end
Just draw a picture of what the NetLogo window would look like after execution of stagger3 is done.
Copy and Paste the NetLogo code into your NetLogo if you want to see what the output looks like and verify you figured it out.
to stagger3 ca cro 15 ask turtles [ ifelse remainder who 3 = 0 [ fd 5 wait 0.1] ; the remainder was 0 [ ifelse remainder who 3 = 1 ; remainder was NOT 0 [fd 10 wait 0.1] ; the remainder was = 1 [fd 15 wait 0.1] ; the remainder was = 2 ] ] end
Example: The Flash bouncing ball with Ease In and Ease Out and without Ease In and Ease Out (not easing). What does the graph look like for EASE IN? For EASE OUT?
The NetLogo oneline model of the Game of Life. The rules for the Game of Life are:
This particular cellular automaton is called The Game of Life. Each cell checks the state of itself and its eight surrounding neighbors and then sets itself to either alive or dead. If there are less than two alive neighbors, then the cell dies. If there are more than three alive neighbors, the cell dies. If there are 2 alive neighbors, the cell remains in the state it is in. If there are exactly three alive neighbors, the cell becomes alive. This is done in parallel and continues forever. HERE IS ANOTHER EXPLANATION OF THE SAME RULES: For a space that is 'populated': Each cell with one or no neighbors dies, as if by loneliness. Each cell with four or more neighbors dies, as if by overpopulation. Each cell with two or three neighbors survives. For a space that is 'empty' or 'unpopulated' Each cell with three neighbors becomes populated.