Question
Linus Torvalds compared one of these programs, called GCC, to a “sloth… dropped on the head as a baby.” For 10 points each:
[10e] Name these programs that translate source code into machine-executable code. Unlike interpreters, these programs do not immediately execute the input code.
ANSWER: compilers
[10m] GCC supports this optimization, which replaces a loop with repeated sequences of instructions to remove overhead from control instructions.
ANSWER: loop unrolling [or loop unwinding]
[10h] Torvalds also criticized GCC for applying this process to a constant. When there are not enough registers for all live variables, a compiler may perform this process of moving the content of some variables to main memory.
ANSWER: register spilling
<Other Science>
Summary
| 2024 ACF Regionals @ Berkeley | 01/27/2024 | Y | 3 | 20.00 | 100% | 67% | 33% |
| 2024 ACF Regionals @ Cornell | 01/27/2024 | Y | 3 | 6.67 | 67% | 0% | 0% |
| 2024 ACF Regionals @ JMU | 01/27/2024 | Y | 10 | 12.00 | 80% | 30% | 10% |
| 2024 ACF Regionals @ Minnesota | 01/27/2024 | Y | 2 | 20.00 | 100% | 100% | 0% |
| 2024 ACF Regionals @ Ohio State | 01/27/2024 | Y | 3 | 10.00 | 100% | 0% | 0% |
| 2024 ACF Regionals @ Rutgers | 01/27/2024 | Y | 4 | 15.00 | 100% | 50% | 0% |
| 2024 ACF Regionals @ Imperial | 01/27/2024 | Y | 8 | 12.50 | 100% | 25% | 0% |
| 2024 ACF Regionals @ Vanderbilt | 01/27/2024 | Y | 5 | 10.00 | 60% | 40% | 0% |
| 2024 ACF Regionals @ MIT | 01/27/2024 | Y | 1 | 10.00 | 100% | 0% | 0% |
Data
| Berkeley B | Berkeley C | 10 | 10 | 0 | 20 |
| Stanford A | Stanford C | 10 | 10 | 10 | 30 |
| Stanford B | Berkeley A | 10 | 0 | 0 | 10 |