Week 13 Possible Quiz Questions



Download 33.08 Kb.
Page1/2
Date27.05.2022
Size33.08 Kb.
#58893
  1   2
7062108

This quiz covers, readings from “Blown to Bits” (3 questions) and NetLogo general programming with specific focus on week 13.
This quiz consists of 10 multiple choice questions and has a time limit of 25 minutes. Note: Blackboard will show that the quiz is 3 hours. This, however, is for special cases. Baring special circumstance, the time limit is 25 minutes which will be enforced by the exam proctor. This quiz must be taken in a single sitting. Note: students with IEPs accommodations that include extended exam time should arrange to take the exam during a single time block that is sufficient to accommodate the student’s needs.
Each student may use a non-electronic English and/or English/other language dictionary. Note that this must be a non-electronic dictionary as electronic dictionaries (i.e. the Internet) grants access to far too many resources well beyond a traditional dictionary.
Each student may use one 8.5x11 sheet of hand written notes (both sides).
Students may NOT use cell phones, smart phones, textbooks, NetLogo, Internet (other then to access the exam itself in Blackboard Learn), or neighbors.
Once a question has been answered, the student may not return to the question (this is enforced by the Blackboard Learn software).
Password: AgentPower


Week 13 Possible Quiz Questions:

1) Consider the NetLogo statement:


if (random 1000 < 10)
[ myProcedure
]



  1. myProcedure is always called.

  2. myProcedure is never called.

  3. myProcedure is called about 10% of the time.

  4. ***myProcedure is called about 1% of the time.

  5. myProcedure is called about 10 times.

2) Suppose we build a model of fish eating (patch-based) plankton. When the model is run, at first the fish population greatly increases and the plankton population drops to near zero. Then, the fish population falls to zero (all the fish die of starvation). Which change is most likely to make the fish and plankton populations more stable?



  1. Make the newly born fish stay near their parents.

  2. Decrease the growth rate of plankton.

  3. ***Decrease the birth rate of fish.

  4. Increase the movement speed of fish.

  5. Decrease the energy fish use when they move.

3. In chapter 3 of Blown to Bits, the authors Lewis, Ledeen and Abelson, claim that a photograph is_________:



  1. only exactly like the real-world original when an analog process is used.

  2. only exactly like the real-world original when lossless compression is used.

  3. only exactly like the real-world original when a digital process is used.

  4. only exactly like the real-world original when the image is NOT digitally edited (no “Photoshopping” of the image is allowed).

  5. ****a model of the real-world and all models are abstractions.

4. Which of the following is true about image compression as discussed in chapter 3 of Blown to Bits?
a) All methods of digital image compression greatly reduce the quality of an image so that the image takes up less digital storage space.
b) All methods of digital image compression reduce the quality of an image, but some only sacrifice a small amount of quality.
c) **** Some methods of digital image compression have zero loss of image quality.
d) Large amounts of digital image compression can cause damage to the computer components.
e) In the United States, digital images that have been compressed are not admissible in a court of law.
5) In chapter 3 of Blown to Bits, the authors Lewis, Ledeen and Abelson, claim that inside the computer, digital images, movies, text and sound ______



  1. ****are all streams of 0s and 1s.

  2. are each stored in different types of memory (i.e. the video card, the graphics card and the sound card).

  3. are stored as miniaturized copies of the originals.

  4. are each stored in different analog formats.

  5. each are stored in unique symbols particular to the type of media.

6 Within a NetLogo procedure, the code



Download 33.08 Kb.

Share with your friends:
  1   2




The database is protected by copyright ©ininet.org 2024
send message

    Main page