Collegeboard Final Blog

Total score 44/50

Question 2

The correct answer is a group of cookies stored by the user's Web browser because the cookies that are stored by the user and can be used to track the users that visit the site. Used to collect user information.

Question 14

The correct answer is purchasing a single-user copy of photo editing software and installing it on all the computers in a computer lab because single user copy software is meant for only one person not multiple people which can be used by various people that did not purchase the software.

Question 15

Putting all government forms on the city website is the correct answer because it still would not allow for people to access the site when they don't have access to the internet.

Question 21

"The conclusion is incorrect; using the test case [0, 1, 4, 5] is not sufficient to conclude the program is correct." This is the correct answer because the variable sum is initialized to store the value of the first element of numList, and because the iteration block is a FOR EACH loop, the value of the first element is added to sum twice. Since the first element of the list is 0, adding this number to the sum does not affect the sum. A non-zero first element would give an incorrect result. In general, a single test case is not sufficient to confirm that a program works as intended.

Question 29

The fourth statement assigns the value of (NOT (a OR b)) AND c to a. Since a OR b is true, NOT (a OR b) is false, so (NOT (a OR b)) AND c is false. The fifth statement assigns the value of c AND a to c. Since a is now false, c AND a is false. The last three statements display the values of the variables.

Question 50

Algorithm A is correct because the size of the list grows, the number of steps needed to sort the list grows at a linear rate, as the number of steps is equal to 10n for a list of size n. This is an example of a polynomial efficiency and indicates that the algorithm runs in a reasonable amount of time.

Algorithm D is correct because The number of steps for this algorithm is equal to the length of the list squared, as the number of steps is equal to n2 for a list of size n. This is an example of a polynomial efficiency and indicates that the algorithm runs in a reasonable amount of time.