27 real Synthesis & Logic Optimization questions from the VLSI Design bank, as asked in Indian campus drives and tech interviews. Every question has a verified answer and an AI-tutor explanation on placd — free to start.
1. What is Logic synthesis?
Junior
A.Cadence synthesis tool whose physically aware mode shares engines with Innovus so netlists are optimised against real floorplan wire loads
B.translation of RTL into a gate-level netlist of standard cells under timing, area and power constraints, with technology mapping to the target library
C.Synopsys Design Constraints: create_clock, set_input_delay, set_output_delay and timing exceptions that define intent shared by synthesis, place-and-route and STA
D.moving registers across combinational logic without changing function so stage delays balance, raising the achievable frequency of a pipeline
2. Which term means: "translation of RTL into a gate-level netlist of standard cells under timing, area and power constraints, with technology mapping to the target library"?
A.Logic synthesis — formal proof that RTL and netlist, or two netlists, implement the same function using Formality or Conformal, catching synthesis or ECO errors without simulation
B.Logic synthesis — initial blocks, # delays, $display, fork-join and real arithmetic are ignored or rejected by synthesis, so RTL that simulates correctly may still not build
C.Logic synthesis — synthesis optimisation letting mutually exclusive operations use one arithmetic unit through multiplexing, saving area at the cost of mux delay on the shared path
D.Logic synthesis — translation of RTL into a gate-level netlist of standard cells under timing, area and power constraints, with technology mapping to the target library
A.Synopsys Design Constraints: create_clock, set_input_delay, set_output_delay and timing exceptions that define intent shared by synthesis, place-and-route and STA
B.synthesis optimisation letting mutually exclusive operations use one arithmetic unit through multiplexing, saving area at the cost of mux delay on the shared path
C.moving registers across combinational logic without changing function so stage delays balance, raising the achievable frequency of a pipeline
D.formal proof that RTL and netlist, or two netlists, implement the same function using Formality or Conformal, catching synthesis or ECO errors without simulation
5. Which term means: "Synopsys Design Constraints: create_clock, set_input_delay, set_output_delay and timing exceptions that define intent shared by synthesis, place-and-route and STA"?
B.SDC constraints — formal proof that RTL and netlist, or two netlists, implement the same function using Formality or Conformal, catching synthesis or ECO errors without simulation
C.SDC constraints — Synopsys Design Constraints: create_clock, set_input_delay, set_output_delay and timing exceptions that define intent shared by synthesis, place-and-route and STA
D.SDC constraints — translation of RTL into a gate-level netlist of standard cells under timing, area and power constraints, with technology mapping to the target library
A.initial blocks, # delays, $display, fork-join and real arithmetic are ignored or rejected by synthesis, so RTL that simulates correctly may still not build
B.formal proof that RTL and netlist, or two netlists, implement the same function using Formality or Conformal, catching synthesis or ECO errors without simulation
C.Cadence synthesis tool whose physically aware mode shares engines with Innovus so netlists are optimised against real floorplan wire loads
D.translation of RTL into a gate-level netlist of standard cells under timing, area and power constraints, with technology mapping to the target library
8. Which term means: "initial blocks, # delays, $display, fork-join and real arithmetic are ignored or rejected by synthesis, so RTL that simulates correctly may still not build"?
A.Non-synthesisable constructs — moving registers across combinational logic without changing function so stage delays balance, raising the achievable frequency of a pipeline
B.Non-synthesisable constructs — Synopsys Design Constraints: create_clock, set_input_delay, set_output_delay and timing exceptions that define intent shared by synthesis, place-and-route and STA
C.Non-synthesisable constructs — optimisation that focuses on critical paths, applying upsizing, buffering, logic restructuring and duplication to meet the clock while leaving non-critical logic small
D.Non-synthesisable constructs — initial blocks, # delays, $display, fork-join and real arithmetic are ignored or rejected by synthesis, so RTL that simulates correctly may still not build
A.Synopsys Design Constraints: create_clock, set_input_delay, set_output_delay and timing exceptions that define intent shared by synthesis, place-and-route and STA
B.Synopsys RTL synthesis tool whose topographical mode uses placement-aware wire estimates so post-synthesis timing correlates with physical design
C.moving registers across combinational logic without changing function so stage delays balance, raising the achievable frequency of a pipeline
D.synthesis optimisation letting mutually exclusive operations use one arithmetic unit through multiplexing, saving area at the cost of mux delay on the shared path
A.Design Compiler — optimisation that focuses on critical paths, applying upsizing, buffering, logic restructuring and duplication to meet the clock while leaving non-critical logic small
B.Design Compiler — Cadence synthesis tool whose physically aware mode shares engines with Innovus so netlists are optimised against real floorplan wire loads
C.Design Compiler — Synopsys Design Constraints: create_clock, set_input_delay, set_output_delay and timing exceptions that define intent shared by synthesis, place-and-route and STA
A.translation of RTL into a gate-level netlist of standard cells under timing, area and power constraints, with technology mapping to the target library
B.synthesis optimisation letting mutually exclusive operations use one arithmetic unit through multiplexing, saving area at the cost of mux delay on the shared path
C.Synopsys Design Constraints: create_clock, set_input_delay, set_output_delay and timing exceptions that define intent shared by synthesis, place-and-route and STA
D.Cadence synthesis tool whose physically aware mode shares engines with Innovus so netlists are optimised against real floorplan wire loads
14. Which term means: "Cadence synthesis tool whose physically aware mode shares engines with Innovus so netlists are optimised against real floorplan wire loads"?
A.Genus — Synopsys RTL synthesis tool whose topographical mode uses placement-aware wire estimates so post-synthesis timing correlates with physical design
B.Genus — moving registers across combinational logic without changing function so stage delays balance, raising the achievable frequency of a pipeline
C.Genus — optimisation that focuses on critical paths, applying upsizing, buffering, logic restructuring and duplication to meet the clock while leaving non-critical logic small
D.Genus — Cadence synthesis tool whose physically aware mode shares engines with Innovus so netlists are optimised against real floorplan wire loads
A.Synopsys Design Constraints: create_clock, set_input_delay, set_output_delay and timing exceptions that define intent shared by synthesis, place-and-route and STA
B.Synopsys RTL synthesis tool whose topographical mode uses placement-aware wire estimates so post-synthesis timing correlates with physical design
C.moving registers across combinational logic without changing function so stage delays balance, raising the achievable frequency of a pipeline
D.optimisation that focuses on critical paths, applying upsizing, buffering, logic restructuring and duplication to meet the clock while leaving non-critical logic small
17. Which term means: "optimisation that focuses on critical paths, applying upsizing, buffering, logic restructuring and duplication to meet the clock while leaving non-critical logic small"?
A.Timing-driven synthesis — moving registers across combinational logic without changing function so stage delays balance, raising the achievable frequency of a pipeline
C.Timing-driven synthesis — initial blocks, # delays, $display, fork-join and real arithmetic are ignored or rejected by synthesis, so RTL that simulates correctly may still not build
D.Timing-driven synthesis — optimisation that focuses on critical paths, applying upsizing, buffering, logic restructuring and duplication to meet the clock while leaving non-critical logic small
A.Synopsys Design Constraints: create_clock, set_input_delay, set_output_delay and timing exceptions that define intent shared by synthesis, place-and-route and STA
B.moving registers across combinational logic without changing function so stage delays balance, raising the achievable frequency of a pipeline
C.synthesis optimisation letting mutually exclusive operations use one arithmetic unit through multiplexing, saving area at the cost of mux delay on the shared path
D.Cadence synthesis tool whose physically aware mode shares engines with Innovus so netlists are optimised against real floorplan wire loads
20. Which term means: "moving registers across combinational logic without changing function so stage delays balance, raising the achievable frequency of a pipeline"?
A.Retiming — Cadence synthesis tool whose physically aware mode shares engines with Innovus so netlists are optimised against real floorplan wire loads
B.Retiming — translation of RTL into a gate-level netlist of standard cells under timing, area and power constraints, with technology mapping to the target library
C.Retiming — moving registers across combinational logic without changing function so stage delays balance, raising the achievable frequency of a pipeline
D.Retiming — formal proof that RTL and netlist, or two netlists, implement the same function using Formality or Conformal, catching synthesis or ECO errors without simulation
A.formal proof that RTL and netlist, or two netlists, implement the same function using Formality or Conformal, catching synthesis or ECO errors without simulation
B.Synopsys RTL synthesis tool whose topographical mode uses placement-aware wire estimates so post-synthesis timing correlates with physical design
C.optimisation that focuses on critical paths, applying upsizing, buffering, logic restructuring and duplication to meet the clock while leaving non-critical logic small
D.moving registers across combinational logic without changing function so stage delays balance, raising the achievable frequency of a pipeline
23. Which term means: "formal proof that RTL and netlist, or two netlists, implement the same function using Formality or Conformal, catching synthesis or ECO errors without simulation"?
A.Equivalence checking — Synopsys Design Constraints: create_clock, set_input_delay, set_output_delay and timing exceptions that define intent shared by synthesis, place-and-route and STA
B.Equivalence checking — synthesis optimisation letting mutually exclusive operations use one arithmetic unit through multiplexing, saving area at the cost of mux delay on the shared path
C.Equivalence checking — formal proof that RTL and netlist, or two netlists, implement the same function using Formality or Conformal, catching synthesis or ECO errors without simulation
A.initial blocks, # delays, $display, fork-join and real arithmetic are ignored or rejected by synthesis, so RTL that simulates correctly may still not build
B.Cadence synthesis tool whose physically aware mode shares engines with Innovus so netlists are optimised against real floorplan wire loads
C.optimisation that focuses on critical paths, applying upsizing, buffering, logic restructuring and duplication to meet the clock while leaving non-critical logic small
D.synthesis optimisation letting mutually exclusive operations use one arithmetic unit through multiplexing, saving area at the cost of mux delay on the shared path
26. Which term means: "synthesis optimisation letting mutually exclusive operations use one arithmetic unit through multiplexing, saving area at the cost of mux delay on the shared path"?
A.Resource sharing — optimisation that focuses on critical paths, applying upsizing, buffering, logic restructuring and duplication to meet the clock while leaving non-critical logic small
B.Resource sharing — synthesis optimisation letting mutually exclusive operations use one arithmetic unit through multiplexing, saving area at the cost of mux delay on the shared path
C.Resource sharing — moving registers across combinational logic without changing function so stage delays balance, raising the achievable frequency of a pipeline
D.Resource sharing — Cadence synthesis tool whose physically aware mode shares engines with Innovus so netlists are optimised against real floorplan wire loads
Answers, AI explanations, and a free readiness check
Sign up free to check your answers with explanations, ask the AI tutor anything on any question, and take the free 2-minute readiness check for a scored result. The full AI mock interview, scored like a real panel, unlocks with Pro.