Complete the code to identify the global optimization technique that removes unreachable code.
The optimization technique that removes code which can never be executed is called [1].Dead Code Elimination removes code that will never run, improving efficiency.
Complete the code to name the optimization technique that replaces variables with known constant values.
Replacing expressions with constant values during compilation is called [1].
Constant Folding evaluates constant expressions at compile time to simplify code.
Fix the error in the statement describing a global optimization technique.
The technique that duplicates loop bodies to reduce loop overhead is called [1].Loop Unrolling duplicates the loop body multiple times to reduce the number of iterations and overhead.
Fill both blanks to complete the dictionary that maps optimization techniques to their descriptions.
optimizations = {"Dead Code Elimination": "Removes [1] code", "Loop Unrolling": "Duplicates [2] bodies"}Dead Code Elimination removes unreachable code, and Loop Unrolling duplicates loop bodies.
Fill all three blanks to complete the dictionary comprehension that filters optimizations based on a condition.
filtered = {k: v for k, v in optimizations.items() if k [1] "Loop Unrolling" or v [2] "Removes" and k [3] "Dead Code Elimination"}The comprehension filters optimizations where the key is not equal to "Loop Unrolling", the value starts with "Removes", and the key equals "Dead Code Elimination".