Why optimization improves program performance in Compiler Design - Challenge Your Understanding

Challenge - 5 Problems

🧠 Conceptual

intermediate

How does optimization reduce program execution time?

Which of the following best explains why optimization reduces the time a program takes to run?

A Optimization changes the program to use slower memory to save space.

B Optimization increases the number of instructions to make the program more detailed.

C Optimization removes unnecessary instructions, so the CPU does less work.

D Optimization adds extra checks to make the program safer but slower.

💡 Hint

Think about how fewer instructions affect the CPU workload.

Optimization removes or simplifies instructions that do not affect the final result, so the CPU executes fewer steps, making the program faster.

📋 Factual

intermediate

What is a common effect of loop unrolling in optimization?

Loop unrolling is a common optimization technique. What is its main effect on program performance?

A It replaces loops with recursive function calls to save memory.

B It increases the number of loops to make the program easier to read.

C It adds extra checks inside loops to prevent errors.

D It decreases the number of loop control instructions, reducing overhead.

💡 Hint

Consider how loop control instructions affect the speed of repeated tasks.

Loop unrolling reduces the number of times the program checks loop conditions, which lowers overhead and speeds up execution.

🔍 Analysis

advanced

Analyzing the impact of dead code elimination

Consider a program with some code that never runs (dead code). How does removing this dead code improve performance?

A It reduces the program size and avoids executing useless instructions, saving time and memory.

B It makes the program run slower because it removes important checks.

C It increases the number of instructions to handle dead code separately.

D It has no effect on performance but improves readability.

💡 Hint

Think about what happens if the CPU executes instructions that do nothing useful.

Removing dead code means the CPU skips instructions that do not affect the program, reducing execution time and memory use.

❓ Comparison

advanced

Comparing inlining functions vs. function calls

Why does inlining a small function often improve program performance compared to calling the function normally?

A Inlining replaces the function call with the function code, avoiding call overhead.

B Inlining makes the program larger and slower by duplicating code everywhere.

C Inlining delays execution by adding extra jumps to the function code.

D Inlining removes the function code completely, causing errors.

💡 Hint

Consider what happens each time a function is called.

Inlining inserts the function's code directly where it is called, so the program avoids the time spent jumping to and returning from the function.

❓ Reasoning

expert

Why does register allocation improve program speed?

Register allocation is an optimization that assigns variables to CPU registers instead of memory. Why does this improve program speed?

A Registers increase the program size, making it slower to load but faster to run.

B Registers are faster to access than memory, so using them reduces instruction time.

C Registers slow down the CPU because they require extra management instructions.

D Registers store variables permanently, which can cause errors if changed.

💡 Hint

Think about the difference in speed between CPU registers and main memory.

CPU registers are the fastest storage locations for data. Using them reduces the time needed to read or write variables, speeding up the program.