Test 4 Corrections

• Score
• Corrections
  • Question 26
  • Question 39
  • Question 46
  • Question 50
• Reflection

Score

Corrections

Question 26

I chose option B but it is wrong because no matter if a data file is compressed, it can be restored into its original state. The correct option is D because there are trade-offs involved in choosing a compression technique for storing and transmitting data.

Question 39

I chose option A but it is wrong because the first number displayed must be 1. The second number displayed could be 1 or 2. The third number displayed could be 1, 2, or 3. The last number displayed could be 1, 2, 3, or 4. So 1 1 1 1 is a possible output. The correct option is D because In the second iteration of the loop, i is equal to 2. Thus RANDOM(1, i) returns either 1 or 2. So, the output 1 3 2 4 is not possible.

Question 46

I chose option C but it is wrong because the first call to drawLine draws a line segment with endpoints (1, 5) and (6, 5). The second call to drawLine draws a line segment with endpoints (1, 5) and (8, 7). The third call to drawLine draws a line segment with endpoints (1, 5) and (8, 3). The correct option is B because this code segment draws the three line segments shown in the figure. The first call to drawLine draws a line segment with endpoints (1, 5) and (6, 5). The second call to drawLine draws a line segment with endpoints (1, 5) and (6, 7). The third call to drawLine draws a line segment with endpoints (1, 5) and (6, 3).

Question 50

I chose option C but it is wrong because algorithm I does not work correctly. In algorithm I, if two people are tied for the earliest birthday, they both sit down when they are eventually paired. The correct option is B because algorithm I does not work correctly. In algorithm I, if two people are tied for the earliest birthday, they both sit down when they are eventually paired. Algorithm II works correctly. Because algorithm II allows both people to remain standing when there is a tie, a person with the earliest birthday is not eliminated. Algorithm II continues until all remaining people have the same birthday, which is the earliest birthday. Algorithm III does not work correctly. Algorithm III chooses the person(s) with the earliest day, disregarding the month. For example, algorithm III will incorrectly determine that a person born on February 1 has an earlier birthday than a person born on January 5.

Reflection

Overall, I think I did really well compared to other tests. I worked well with my whole team to really understand and go over each question. Some of the questions had Riggi and I stumped because of how long confusing the questions are. However, some of the coding questions we actually understood because working together with Riggi it was very easy to go through the code together and figure out either the problem or the output. I believe that I am starting to understand more and more about Computer Science. One thing I think I really struggle on though is having to select multiple answers in the question, as I find those questions to be more tricky and confusing for me. But overall I definitely see improvement from past tests.