CS 1025 Computational Modeling and Simulation

Quiz One Study Guide - Fall 2011
Monday, October 17th

  1. In NetLog, show what the output would look like for the following:
  2. 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
         cro 8
         ask turtles [    
             fd 5
             fd 5
             fd 2
             fd 2
             fd 2
  3. Same question as above. Show the output of ExampleTwo procedure.
  4. 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
        CRT 8
        ask turtles 
            FD 8
  5. Modeling terms and definitions - Vensim Stocks, Flows, Converters, Sources and Sinks.
    Review and study the SIX questions from the Vensim tutorial that were due on September 30th. (Roman numerals questions).

    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.

  6. Vensim and Andrew Ford homework: 025ModelingTheEnvironment1.html has the magnificent 7 study questions that were due on Friday, September 30th.

    The PREFACE to the Andrew Ford book on Systems Dynamics modeling (Vensim approach).

  7. With regard to the world of NetLogo, what is a TORUS setting for the grid of patches? Looking at some output, be able to describe whether the world was a TORUS, or wrapped just horizontally, or if it wrapped just vertically. Recall in class how a sheet of paper could demonstrate a grid world wrapping vertically OR wrapping horizontally, but its hard to show it doing both..
  8. Show the output (generally what it would look like). This question tests one of your old assignment questions, the one where the EVEN and the ODD turtles did different things .

    SHOW THE OUTPUT, roughly what it would look like when stagger is done.

  9. to stagger
        cro 8
        ask turtles [ifelse remainder who 2 = 0  [ fd 5  wait 0.2] 
                                                 [ fd 10 wait 0.2] ]
  10. SHOW THE OUTPUT, roughly what it would look like when stagger3 is done.

    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.

  11. to stagger3
       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 

  12. Study Page for Flash bouncing ball model is the ONE NEW ITEM ON FLASH is added here. WE WILL DO THIS Adobe Flash bouncing ball model AGAIN ON Monday, OCTOBER 10th in class. See the application with the two bouncing balls. RED uses Ease In and Ease Out to be a better model and simulation. GREEN does NOT use any easing in or easing out. Ball moves at a constant speed.

    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?

  13. Netlogo Models Library - File menu > Models Library > Cellular Automota > LIFE

    The NetLogo oneline model of the Game of Life. The rules for the Game of Life are:

  14. 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.
        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.