Q. 1
Electronics Engineering
Difficulty: easy
(1 Mark)
What is the fundamental building block used to implement arbitrary combinational Boolean logic functions in modern FPGAs?
💡
Step-by-Step Explanation & Concept Rationale
Modern FPGAs implement combinational logic using $k$-input Look-Up Tables (LUTs, typically 4-LUT or 6-LUT), which store truth tables in small SRAM cells addressed by input logic lines.
Q. 2
Electronics Engineering
Difficulty: medium
(1 Mark)
How many distinct Boolean logic functions of $K$ variables can be implemented by a single $K$-input Look-Up Table ($K$-LUT)?
💡
Step-by-Step Explanation & Concept Rationale
A $K$-input LUT contains $2^K$ configuration memory bits. Since each bit can be independently programmed to 0 or 1, the total number of realizable Boolean functions is $2^{2^K}$ (e.g., $2^{2^4} = 65,536$ for a 4-LUT; $2^{64} \approx 1.84 \times 10^{19}$ for a 6-LUT).
Q. 3
Electronics Engineering
Difficulty: medium
(1 Mark)
What is the primary architectural difference between an FPGA and a CPLD (Complex Programmable Logic Device)?
💡
Step-by-Step Explanation & Concept Rationale
CPLDs feature non-volatile memory (instant-on, no boot EEPROM needed) and predictable, deterministic timing due to centralized switch matrices, whereas FPGAs provide massively higher logic capacity, BRAMs, and DSPs with segmented interconnect routing.
Q. 4
Electronics Engineering
Difficulty: easy
(1 Mark)
In FPGA architecture, what components are typically contained within a Configurable Logic Block (CLB) or Logic Array Block (LAB)?
💡
Step-by-Step Explanation & Concept Rationale
A CLB (e.g., Xilinx Slice or Intel ALM) groups several LUTs with dedicated registers/flip-flops, high-speed carry lookahead chains for multi-bit addition, and fast multiplexer routing.
Q. 5
Electronics Engineering
Difficulty: medium
(1 Mark)
What is the difference between 'Distributed RAM' and 'Block RAM' (BRAM) in an FPGA?
💡
Step-by-Step Explanation & Concept Rationale
Distributed RAM re-purposes LUT logic memory for small distributed tables (e.g., shallow FIFOs or shift registers), whereas dedicated BRAM columns provide megabits of high-density, dual-port static RAM without consuming logic LUTs.
Q. 6
Electronics Engineering
Difficulty: easy
(1 Mark)
What dedicated mathematical function is performed by hardware 'DSP Slices' (e.g., Xilinx DSP48E1/E2) embedded in modern FPGAs?
💡
Step-by-Step Explanation & Concept Rationale
Hardware DSP slices contain dedicated hardened high-speed multipliers (e.g., $18\times 25$ or $27\times 18$ bits) combined with 48-bit accumulators, enabling high-performance FIR filters, FFTs, and matrix math without burning generic logic fabric.
Q. 7
Electronics Engineering
Difficulty: easy
(1 Mark)
What is the mathematical definition of 'Setup Time' ($t_{su}$) for a digital Flip-Flop?
💡
Step-by-Step Explanation & Concept Rationale
Setup time $t_{su}$ is the required stability window prior to the clock edge to allow the internal master latch feedback loop to capture the incoming logic state reliably.
Q. 8
Electronics Engineering
Difficulty: easy
(1 Mark)
What is the mathematical definition of 'Hold Time' ($t_h$) for a digital Flip-Flop?
💡
Step-by-Step Explanation & Concept Rationale
Hold time $t_h$ guarantees that data does not change too soon after the clock edge, preventing the new data from blowing through the master latch while the latch is in the process of closing.
Q. 9
Electronics Engineering
Difficulty: easy
(1 Mark)
In synchronous digital design, what is 'Metastability'?
💡
Step-by-Step Explanation & Concept Rationale
When an asynchronous input transitions within the setup/hold aperture ($t_{su}/t_h$), the internal bistable feedback cannot resolve instantaneously, causing output hovering/oscillation that resolves after an unpredictable duration.
Q. 10
Electronics Engineering
Difficulty: medium
(1 Mark)
What is the standard hardware circuit used to mitigate metastability when synchronizing an asynchronous 1-bit control signal into a clock domain?
💡
Step-by-Step Explanation & Concept Rationale
Cascading two D-flip-flops in series gives the first flip-flop an entire clock cycle $T_{clk}$ to resolve its metastable state before the stable resolved logic level is sampled by the second register.
Q. 11
Electronics Engineering
Difficulty: hard
(1 Mark)
What is the formula for the Mean Time Between Failures (MTBF) of a two-stage flip-flop synchronizer?
💡
Step-by-Step Explanation & Concept Rationale
MTBF increases exponentially with available resolution time $t_r = T_{clk} - t_{su}$. At higher clock frequencies $f_{clk}$, adding a third synchronizer stage is often required to maintain MTBF in thousands of years.
Q. 12
Electronics Engineering
Difficulty: hard
(1 Mark)
In Static Timing Analysis (STA), what is the formula for 'Setup Slack' along a register-to-register path?
💡
Step-by-Step Explanation & Concept Rationale
For setup timing to pass without violation, the data arrival time ($t_{co} + t_{comb(max)}$) plus required setup time ($t_{su}$) must not exceed the data required time ($T_{clk} + t_{skew}$), yielding a non-negative Setup Slack.
Q. 13
Electronics Engineering
Difficulty: hard
(1 Mark)
In Static Timing Analysis (STA), what is the formula for 'Hold Slack' along a register-to-register path?
💡
Step-by-Step Explanation & Concept Rationale
Hold timing checks the fastest possible data propagation path ($t_{co(min)} + t_{comb(min)}$): it must arrive AFTER the hold time window ($t_h + t_{skew}$). Hold slack is independent of clock period $T_{clk}$ and cannot be fixed by lowering clock frequency!
Q. 14
Electronics Engineering
Difficulty: medium
(1 Mark)
Why is a 'Hold Time Violation' considered more severe than a 'Setup Time Violation' in fabricated ASIC and FPGA silicon?
💡
Step-by-Step Explanation & Concept Rationale
Because the hold condition $t_{co(min)} + t_{comb(min)} \ge t_h + t_{skew}$ does not contain $T_{clk}$, slowing down the system clock does NOT fix a hold violation; extra delay buffers must be physically inserted into the data path.
Q. 15
Electronics Engineering
Difficulty: easy
(1 Mark)
What is 'Pipelining' in digital circuit design, and what is its primary effect on system performance?
💡
Step-by-Step Explanation & Concept Rationale
By subdividing a long combinational path of delay $T$ into $N$ equal stages separated by registers, the new clock period becomes $T/N + t_{co} + t_{su}$, nearly multiplying maximum clock frequency by $N$ with $N$ clock cycles of latency.
Q. 16
Electronics Engineering
Difficulty: medium
(1 Mark)
What is 'Clock Skew' ($t_{skew}$) in synchronous digital systems?
💡
Step-by-Step Explanation & Concept Rationale
Clock skew is spatial timing variation caused by differences in clock tree wire routing lengths and buffer delays across the silicon die; positive skew helps setup time but harms hold time.
Q. 17
Electronics Engineering
Difficulty: medium
(1 Mark)
What is 'Clock Jitter' in digital electronics?
💡
Step-by-Step Explanation & Concept Rationale
Jitter is short-term temporal variation in clock period or phase caused by thermal noise, power supply ripple, and substrate crosstalk, reducing the effective usable clock period for timing closure.
Q. 18
Electronics Engineering
Difficulty: medium
(1 Mark)
What is a Mixed-Mode Clock Manager (MMCM) or Phase-Locked Loop (PLL) inside an FPGA used for?
💡
Step-by-Step Explanation & Concept Rationale
MMCMs/PLLs lock internal feedback clocks to external reference oscillators, generating multiple synchronized phase-shifted and frequency-scaled system clocks while virtually eliminating internal clock tree insertion delay.
Q. 19
Electronics Engineering
Difficulty: easy
(1 Mark)
What is the difference between a 'Moore' and a 'Mealy' Finite State Machine (FSM)?
💡
Step-by-Step Explanation & Concept Rationale
Moore outputs change synchronously only when state registers update on clock edges (glitch-free). Mealy outputs can change immediately in response to input changes within the clock cycle, which may introduce combinational glitches.
Q. 20
Electronics Engineering
Difficulty: medium
(1 Mark)
What are the characteristics of 'One-Hot' State Encoding in FPGA FSM implementation?
💡
Step-by-Step Explanation & Concept Rationale
FPGAs are rich in registers/flip-flops; One-Hot encoding uses $N$ flip-flops for $N$ states, eliminating complex multi-level decoding gates and yielding extremely fast next-state transition logic ($f_{max}$).
Q. 21
Electronics Engineering
Difficulty: hard
(1 Mark)
What is 'Gray Code' state and counter encoding, and why is it mandatory for asynchronous FIFO read/write pointer crossing?
💡
Step-by-Step Explanation & Concept Rationale
In binary counters, transitions like `0111` $\to$ `1000` toggle 4 bits simultaneously; if sampled across clock domains, bit skew causes transient invalid intermediate codes (e.g. `1111`). Gray code changes only 1 bit, guaranteeing sampled values are either old or new.
Q. 22
Electronics Engineering
Difficulty: hard
(1 Mark)
In an Asynchronous FIFO design, how are the 'FIFO Full' and 'FIFO Empty' status flags generated reliably?
💡
Step-by-Step Explanation & Concept Rationale
Empty flag is evaluated in the read clock domain comparing read pointer to synchronized write pointer; Full flag is evaluated in write clock domain comparing write pointer to synchronized read pointer (with MSB inversions for wrap-around detection).
Q. 23
Electronics Engineering
Difficulty: easy
(1 Mark)
In Verilog HDL, what is the critical behavioral difference between a 'Blocking Assignment' (`=`) and a 'Non-Blocking Assignment' (`<=`)?
💡
Step-by-Step Explanation & Concept Rationale
In Verilog RTL design, non-blocking assignments (`<=`) MUST be used in sequential `always @(posedge clk)` blocks to accurately model simultaneous hardware register updates without simulation race conditions.
Q. 24
Electronics Engineering
Difficulty: easy
(1 Mark)
What synthesis defect is created in Verilog when an `always @(*)` combinational block leaves some output signals unassigned in certain `if-else` or `case` branches?
💡
Step-by-Step Explanation & Concept Rationale
In combinational logic, if a signal is not assigned a value in all possible execution branches, the synthesizer is forced to create a physical latch to hold the signal's previous value, degrading timing and causing glitches.
Q. 25
Electronics Engineering
Difficulty: medium
(1 Mark)
In VHDL, what is the difference between a `SIGNAL` and a `VARIABLE`?
💡
Step-by-Step Explanation & Concept Rationale
Signals represent inter-block interconnects and registered state evaluated concurrently across the architecture, while variables are sequential scratchpad holders scoped exclusively within a `process`, `function`, or `procedure`.
Study Stream Progress:
Showing 25 of 61 Questions (41%)
Jump to:
Ready to Test Your Retention & Speed?
Now that you have reviewed the study questions and rationales, test yourself in our interactive 1-by-1 practice engine or take the full official timed mock exam.