Learnings and notes:
-
Binary bits: A bit is the smallest unit of data that a computer can process and store. A bit state is represented using 1s and 0s as each bit is always in one of two physical states. Usually, all 8 bits are used. However, in some cases, not all bits are required, as seen in Q49:
-
Internet Protocol (IPv6): The Internet Protocol (IP) is a protocol, or set of rules, for routing and addressing packets of data so that they can travel across networks and arrive at the correct destination. IPv6 is the most recent version of Internet Protocol (IP). It’s designed to supply IP addressing and additional security to support the predicted growth of connected devices in IoT, manufacturing, and emerging areas like autonomous driving.
-
Algorithm run-times: We can categorize the run time of an algorithm according to how the number of steps increases as the input size increases. According to CollegeBoard, accessing elements
2n
times, or2
times per element, is considered reasonable run-time. Also, accessing elementsn^2
times, orn
times per element, is considered reasonable run-time. This is seen in Q50, which I got wrong: -
Q67 - Error in numOccurences procedure: The question is seen below:
Explanation for option A (Correct): Correct. For this code segment, count is increased to 1 the first time “birch” is encountered in the list. However, count is reset to 0 when the code segment moves to the next list element. The last time “birch” is encountered in the list, count is again increased to 1, causing the procedure to return 1 instead of the intended result 2.
Explanation for option B (Correct): Correct. For this code segment, count is increased to 1 the first time “maple” is encountered in the list. However, count is reset to 0 when the code segment moves to the next list element. This causes the procedure to return 0 instead of the intended result 1.
Explanation for option C (Incorrect): Incorrect. Incorrect. For this code segment, count is increased to 1 when “oak” is encountered as the last element of the list. The loop then terminates and the procedure returns the intended result 1.
Explanation for option D (Incorrect): Incorrect. For this code segment, count is initialized to 0. Since “spruce” does not appear in the list, the procedure returns the intended result 0.