AP CSP Review

What two numbers do we use in binary?

• -1 & 0

• 2 & 1

• 1 & 0

• 4 & 0

What number does 110 represent in binary?

• 6

• 3

• 8

• 12

How would you represent the number 5 in binary?

• 10

• 100

• 101

• 110

What base is binary in?

• 2

• 4

• 1

• 7

Latency

• The number of bits that are conveyed or processed per unit of time. e.g. 8 bits/sec.

• Time it takes for a bit to travel from its sender to its receiver.

• A set of rules governing the exchange or transmission of data between devices.

• A way of representing information using only two options

Protocol

• A set of rules governing the exchange or transmission of data between devices.

• A number assigned to any item that is connected to the Internet.

• Having multiple backups to ensure reliability during cases of high usage or failure.

• A type of computer that forwards data across a network

What is the 4-bit binary number for the decimal number ten (10)?

• 0010

• 1010

• 0110

• 0101

What is the minimum number of bits you would need to encode the 26 letters of the alphabet plus a space – a total of 27 characters?

• 7 BITS

• 6 BITS

• 5 BITS

• 4 BITS

A video-streaming Web site uses 32-bit integers to count the number of times each video has been played. In anticipation of some videos being played m ore times than can be represented with 32 bits, the Web site is planning to change to 64-bit integers for the counter. Which of the following best describes the result of using 64-bit integers instead of 32-bit integers?

• 2 times as many values can be represented

• 32 times as many values can be represented

• 2^32 times as many values can be represented

• 32^2 times as many values can be represented

A programmer completes the user manual for a video game she has developed and realizes she has reversed the roles of goats and sheep throughout the text. Consider the programmer’s goal of changing all occurrences of “goats” to “sheep” and all occurrences of “sheep” to “goats”. The programmer will use the fact that the word “foxes” does not appear anywhere in the original text.

Which of the following algorithms can be used to accomplish the programmer’s goal?

• First, change all occurrences of “goats” to “sheep”

  Then, change all occurrences of “sheep” to “goats”

• First, change all occurrences of “goats” to “sheep”

  Then, change all occurrences of “sheep” to “goats”

  Last, change all occurrences of “foxes” to “sheep”

• First, change all occurrences of “goats” to “foxes”

  Then, change all occurrences of “sheep” to “goats”

  Last, change all occurrences of “foxes” to “sheep”

• First, change all occurrences of “goats” to “foxes”

  Then, change all occurrences of “foxes” to “sheep”

  Last, change all occurrences of “sheep” to “goats”