Computer Science · Compiler Design
A compiler uses a directed acyclic graph (DAG) representation within a basic block to generate three-address code for: x = (a + b) * (a + b) Which optimization will it most likely apply?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1Dead code elimination
- 2Common subexpression elimination✓
- 3Loop unrolling
- 4Strength reduction
Correct answer
Common subexpression elimination
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Compiler Design MCQs →Want more practice questions on Compiler Design?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Compiler Design