1In Register Transfer Language (RTL), what does the statement mean?
Register Transfer Language
Easy
A.Contents of are copied into
B. and are added together
C. and are swapped
D.Contents of are copied into
Correct Answer: Contents of are copied into
Explanation:
The arrow points to the destination register. So means the value of the source is transferred into the destination .
Incorrect! Try again.
2Which symbol is used to denote a register transfer operation in RTL?
Register Transfer Language
Easy
A.
B.
C.
D.
Correct Answer:
Explanation:
The replacement/transfer operator indicates that the contents of the source are moved into the destination register.
Incorrect! Try again.
3In the RTL statement , what does represent?
Register Transfer Language
Easy
A.The destination register
B.A control condition that must be true
C.A memory address
D.An arithmetic operation
Correct Answer: A control condition that must be true
Explanation:
The term before the colon is a control function. The transfer occurs only when the control condition equals 1.
Incorrect! Try again.
4What is the main purpose of a common bus in a digital system?
Bus and Memory Transfer
Easy
A.To increase the clock frequency
B.To perform arithmetic operations
C.To store data permanently
D.To share a common path for data transfer among registers
Correct Answer: To share a common path for data transfer among registers
Explanation:
A bus is a shared set of lines that allows data to be transferred between multiple registers using one common path, reducing the number of connections.
Incorrect! Try again.
5In memory transfer, the statement refers to the memory word selected by which register?
Bus and Memory Transfer
Easy
A.The Data Register (DR)
B.The Program Counter (PC)
C.The Accumulator (AC)
D.The Address Register (AR)
Correct Answer: The Address Register (AR)
Explanation:
denotes the memory word located at the address currently held in the Address Register (AR).
Incorrect! Try again.
6Which components are commonly used to construct a bus system?
Bus and Memory Transfer
Easy
A.Flip-flops only
B.Shift registers
C.Adders
D.Multiplexers
Correct Answer: Multiplexers
Explanation:
A bus can be built using multiplexers (or three-state buffers) that select which register's contents are placed on the common lines.
Incorrect! Try again.
7What is the primary function of a shift register?
Shift Registers
Easy
A.To store the memory address
B.To add two binary numbers
C.To shift stored bits left or right
D.To decode instructions
Correct Answer: To shift stored bits left or right
Explanation:
A shift register is made of flip-flops that move (shift) their stored bits one position left or right with each clock pulse.
Incorrect! Try again.
8In a circular (ring) shift, the bit shifted out from one end is:
Shift Registers
Easy
A.Fed back into the other end
B.Replaced with a
C.Discarded completely
D.Replaced with a
Correct Answer: Fed back into the other end
Explanation:
In a circular shift, no bit is lost; the bit leaving one end re-enters at the opposite end, forming a loop.
Incorrect! Try again.
9Which type of shift register accepts data one bit at a time?
Shift Registers
Easy
A.Serial-in shift register
B.Parallel-in shift register
C.Random-access register
D.Content-addressable register
Correct Answer: Serial-in shift register
Explanation:
A serial-in shift register loads data one bit per clock pulse, unlike a parallel-in register that loads all bits simultaneously.
Incorrect! Try again.
10Which of the following is an example of a logic microoperation?
Micro operations (Arithmetic, logic, shift)
Easy
A.AND operation on register contents
B.Adding two registers
C.Circular shift of a register
D.Incrementing a register
Correct Answer: AND operation on register contents
Explanation:
Logic microoperations perform bit-wise operations such as AND, OR, XOR, and complement on register data.
Incorrect! Try again.
11The four basic categories of microoperations are register transfer, arithmetic, logic, and:
Micro operations (Arithmetic, logic, shift)
Easy
A.Decode
B.Fetch
C.Interrupt
D.Shift
Correct Answer: Shift
Explanation:
Microoperations are grouped into register transfer, arithmetic, logic, and shift microoperations.
Incorrect! Try again.
12Which microoperation is represented by ?
Micro operations (Arithmetic, logic, shift)
Easy
A.Complement
B.Clear
C.Decrement
D.Increment
Correct Answer: Increment
Explanation:
Adding to a register's contents is the increment arithmetic microoperation.
Incorrect! Try again.
13A full adder produces which two outputs?
Addition
Easy
A.Product and Carry
B.Quotient and Remainder
C.Sum and Borrow
D.Sum and Carry
Correct Answer: Sum and Carry
Explanation:
A full adder adds three input bits and generates a Sum output and a Carry output.
Incorrect! Try again.
14What is the result of the binary addition in a single-bit adder?
Addition
Easy
A.Sum , Carry
B.Sum , Carry
C.Sum , Carry
D.Sum , Carry
Correct Answer: Sum , Carry
Explanation:
In binary, , which gives a Sum of and a Carry of .
Incorrect! Try again.
15Binary subtraction in computers is commonly performed using:
Subtraction
Easy
A.Direct borrowing only
B.Logical AND operation
C.2's complement addition
D.Repeated left shifts
Correct Answer: 2's complement addition
Explanation:
Computers subtract by adding the 2's complement of the subtrahend, which simplifies the hardware to a single adder circuit.
Incorrect! Try again.
16To find the 2's complement of a binary number, you take its 1's complement and then:
Subtraction
Easy
A.Complement it again
B.Shift it left
C.Subtract
D.Add
Correct Answer: Add
Explanation:
The 2's complement is obtained by inverting all bits (1's complement) and then adding to the result.
Incorrect! Try again.
17Booth's algorithm is used to perform which operation?
Booth Multiplication
Easy
A.Addition of decimal numbers
B.Division of unsigned numbers
C.Logic comparison of registers
D.Multiplication of signed binary numbers
Correct Answer: Multiplication of signed binary numbers
Explanation:
Booth's algorithm efficiently multiplies signed binary numbers represented in 2's complement form.
Incorrect! Try again.
18Booth's multiplication algorithm examines pairs of bits to decide the action. Which bits does it inspect at each step?
Booth Multiplication
Easy
A.The current and previous bit of the multiplier
B.The sign bits of both operands
C.The two least significant bits of the multiplicand
D.The two most significant bits of the product
Correct Answer: The current and previous bit of the multiplier
Explanation:
Booth's algorithm looks at the current multiplier bit and the previously shifted-out bit to decide whether to add, subtract, or only shift.
Incorrect! Try again.
19What does the abbreviation HDL stand for?
Introduction to HDLs: History, Evolution
Easy
A.Hybrid Digital Language
B.Hardware Description Language
C.Hardware Design Logic
D.High-level Data Language
Correct Answer: Hardware Description Language
Explanation:
HDL stands for Hardware Description Language, used to model and describe the behavior and structure of digital circuits.
Incorrect! Try again.
20In an HDL design flow, which step converts the HDL description into an actual gate-level circuit?
Synthesis transforms the HDL code into a gate-level netlist that can be implemented in hardware.
Incorrect! Try again.
21Consider the RTL statement: . Assuming this is executed as a single register transfer controlled by condition , what is the effect?
Register Transfer Language
Medium
A.The contents of and are swapped
B.Both and hold the old value of
C.Both and hold the old value of
D.The transfer is invalid and rejected
Correct Answer: The contents of and are swapped
Explanation:
When two micro-operations are separated by a comma under the same control condition, they occur simultaneously. Both registers latch the old values at the same clock edge, so the contents are exchanged.
Incorrect! Try again.
22In the conditional RTL statement , what does the symbol represent?
Register Transfer Language
Medium
A.A constant added to the register contents
B.The destination register for the data
C.A control function that enables the transfer when
D.A memory address pointer used for indexing
Correct Answer: A control function that enables the transfer when
Explanation:
The term before the colon is a control function (a Boolean condition). The transfer happens only when this control function equals 1.
Incorrect! Try again.
23A common bus is built for 4 registers, each of 8 bits, using multiplexers. How many multiplexers and how many selection lines are required?
Bus and Memory Transfer
Medium
A.4 multiplexers and 2 selection lines
B.2 multiplexers and 4 selection lines
C.8 multiplexers and 2 selection lines
D.8 multiplexers and 3 selection lines
Correct Answer: 8 multiplexers and 2 selection lines
Explanation:
One multiplexer is needed per bit, so 8 MUXes for 8-bit registers. To select among 4 registers, selection lines are required.
Incorrect! Try again.
24The memory read micro-operation is written as . What is the role of in this operation?
Bus and Memory Transfer
Medium
A.It supplies the address of the memory word to be read
B.It counts the number of read cycles performed
C.It holds the instruction to be executed next
D.It stores the data word read from memory
Correct Answer: It supplies the address of the memory word to be read
Explanation:
(Address Register) provides the memory address. The word at is placed into the destination data register .
Incorrect! Try again.
25A 4-bit register holds the value . After one logical left shift with a 0 inserted, what does it contain?
Shift Registers
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
A logical left shift moves each bit one position left, discards the MSB, and inserts 0 at the LSB. .
Incorrect! Try again.
26An 8-bit register contains . After an arithmetic right shift by one position, the result is:
Shift Registers
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
An arithmetic right shift preserves the sign bit (MSB). Since the MSB is 1, it is copied into the vacated position: .
Incorrect! Try again.
27In a circular shift (rotate) left operation on the 4-bit value , what is the result?
Shift Registers
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
In a circular left shift, the MSB that leaves on the left re-enters at the right (LSB). .
Incorrect! Try again.
28Which micro-operation is represented by ?
Micro operations (Arithmetic, logic, shift)
Medium
A.Arithmetic increment of
B.One's complement (bitwise NOT) of
C.Two's complement (negation) of
D.Logical AND of with itself
Correct Answer: One's complement (bitwise NOT) of
Explanation:
The overbar denotes complement. inverts each bit, which is the one's complement micro-operation.
Incorrect! Try again.
29To selectively clear the bits in register wherever the corresponding bits in register are 1, which logic micro-operation is used?
Micro operations (Arithmetic, logic, shift)
Medium
A.
B.
C.
D.
Correct Answer:
Explanation:
ANDing with the complement of forces bits of to 0 wherever has 1, while leaving other bits unchanged. This is the selective-clear operation.
Incorrect! Try again.
30The XOR micro-operation is commonly used to perform which selective bit operation?
Micro operations (Arithmetic, logic, shift)
Medium
A.Selective set of bits in where is 1
B.Masking of bits in where is 0
C.Selective clear of bits in where is 1
D.Selective complement (toggle) of bits in where is 1
Correct Answer: Selective complement (toggle) of bits in where is 1
Explanation:
XOR with 1 inverts a bit and XOR with 0 leaves it unchanged. So toggles exactly the bits of that correspond to 1s in .
Incorrect! Try again.
31Two 4-bit numbers and are added in a signed system. What is the result and does signed overflow occur?
Addition
Medium
A.Result , overflow occurs
B.Result , no overflow
C.Result , no overflow
D.Result , overflow occurs
Correct Answer: Result , overflow occurs
Explanation:
. Adding two positives yielded a negative sign bit, so signed overflow has occurred.
Incorrect! Try again.
32In an -bit adder, signed (two's complement) overflow is detected by:
Addition
Medium
A.Comparing the carry into the sign bit with the carry out of the sign bit
B.Checking whether the final carry-out is 1
C.Checking whether the result equals zero
D.Comparing the MSBs of the two operands only
Correct Answer: Comparing the carry into the sign bit with the carry out of the sign bit
Explanation:
Signed overflow occurs when the carry into the most significant (sign) bit differs from the carry out of it, i.e. .
Incorrect! Try again.
33Using two's complement arithmetic, the subtraction on 4-bit numbers is performed as:
Subtraction
Medium
A., giving
B., giving
C., giving
D., giving
Correct Answer: , giving
Explanation:
Subtraction is done by adding the two's complement of the subtrahend. Two's complement of is . ; discarding the carry gives .
Incorrect! Try again.
34In a parallel adder-subtractor circuit, subtraction is achieved by XORing with a mode line and setting the initial carry-in . What values of and enable subtraction?
Subtraction
Medium
A. and
B. and
C. and
D. and
Correct Answer: and
Explanation:
With , each bit is complemented (one's complement), and adds one, forming the two's complement of , which yields .
Incorrect! Try again.
35In Booth's algorithm, the pair of bits indicates which action before the arithmetic shift?
Booth Multiplication
Medium
A.No arithmetic operation, only shift
B.Add the multiplicand ()
C.Subtract the multiplicand ()
D.Add the two's complement of the accumulator
Correct Answer: Subtract the multiplicand ()
Explanation:
In Booth's algorithm, marks the beginning of a string of 1s, so the multiplicand is subtracted from the accumulator before the arithmetic right shift.
Incorrect! Try again.
36The main advantage of Booth's multiplication algorithm over simple sequential add-and-shift multiplication is that it:
Booth Multiplication
Medium
A.Works only for unsigned numbers but with higher speed
B.Always guarantees fewer than total additions regardless of input
C.Directly handles signed (two's complement) numbers and reduces operations for strings of consecutive 1s
D.Eliminates the need for any shift operations entirely
Correct Answer: Directly handles signed (two's complement) numbers and reduces operations for strings of consecutive 1s
Explanation:
Booth's algorithm treats operands as signed two's complement numbers and skips over runs of consecutive 1s (and 0s), reducing the number of add/subtract operations.
Incorrect! Try again.
37Verilog HDL was originally developed and later standardized by the IEEE. Under which IEEE standard was Verilog first standardized in 1995?
Introduction to HDLs: History, Evolution
Medium
A.IEEE 802
B.IEEE 754
C.IEEE 1076
D.IEEE 1364
Correct Answer: IEEE 1364
Explanation:
Verilog was standardized as IEEE 1364 in 1995. In contrast, IEEE 1076 is the VHDL standard, and IEEE 754 is the floating-point standard.
Incorrect! Try again.
38In a typical HDL-based design flow, which step converts the RTL description into a gate-level netlist mapped to a target technology?
Typical HDL-based Design Flow (Design, Simulation, Synthesis, Verification)
Medium
A.Verification
B.Simulation
C.Synthesis
D.Specification
Correct Answer: Synthesis
Explanation:
Synthesis translates the RTL/behavioral HDL into a technology-mapped gate-level netlist. Simulation and verification check correctness but do not produce the netlist.
Incorrect! Try again.
39A key conceptual difference between an HDL like Verilog and a software language like C is that HDL constructs primarily:
Comparison with Software Programming Languages
Medium
A.Describe concurrent hardware behavior that executes in parallel
B.Cannot represent time or delays in any form
C.Are always interpreted rather than compiled
D.Execute strictly one statement after another in sequence
Correct Answer: Describe concurrent hardware behavior that executes in parallel
Explanation:
HDLs model hardware where many elements operate simultaneously, so their constructs are inherently concurrent. Software languages like C are fundamentally sequential.
Incorrect! Try again.
40In Verilog, which assignment type inside an always block models sequential (flip-flop) behavior by scheduling updates at the end of the time step?
Verilog
Medium
A.Blocking assignment (=)
B.Continuous assignment (assign)
C.Procedural continuous assignment (force)
D.Non-blocking assignment (<=)
Correct Answer: Non-blocking assignment (<=)
Explanation:
Non-blocking assignments (<=) schedule the right-hand side to update at the end of the time step, correctly modeling concurrent register updates in sequential logic.
Incorrect! Try again.
41Consider the RTL statement: . If both transfers are triggered by the same control signal on the same clock edge, what is the net effect?
Register Transfer Language
Hard
A.The contents of and are swapped
B.Both registers end up holding the original value of
C.Both registers end up holding the original value of
D.The operation is invalid and cannot be synthesized
Correct Answer: The contents of and are swapped
Explanation:
In RTL, simultaneous transfers use the source values latched at the clock edge before any update. Since both reads happen before the writes, gets old and gets old , achieving a swap without a temporary register.
Incorrect! Try again.
42A control function is written as . What is the minimum hardware condition required to clear register ?
Register Transfer Language
Hard
A.Both AND must be true simultaneously
B.Either ( AND ) or ( AND ) must be true
C.Only AND must be true
D.All of , , , must be true
Correct Answer: Either ( AND ) or ( AND ) must be true
Explanation:
The '+' in RTL control functions denotes logical OR while juxtaposition denotes AND. Thus the clear occurs when either product term or evaluates to 1.
Incorrect! Try again.
43A system uses a common bus built from multiplexers to connect 4 registers, each bits wide. How many multiplexers and how many total selection lines are required?
Bus and Memory Transfer
Hard
A. multiplexers and selection lines
B. multiplexers and selection lines
C. multiplexers and selection lines
D. multiplexers and selection lines
Correct Answer: multiplexers and selection lines
Explanation:
Each bit line of the bus needs one MUX, so an 8-bit bus needs 8 MUXes. Selecting one of 4 registers requires selection lines shared across all multiplexers.
Incorrect! Try again.
44Given the memory transfer , which sequence of internal actions correctly represents this write operation?
Bus and Memory Transfer
Hard
A.Place on address bus, on data bus, then assert Write
B.Place on address bus, on data bus, then assert Read
C.Place on data bus and on address bus simultaneously
D.Assert Read first, then place on the data bus
Correct Answer: Place on address bus, on data bus, then assert Write
Explanation:
A memory write requires the address register to drive the address bus, the source data to drive the data bus, and the Write control signal to be asserted so memory stores the data at that address.
Incorrect! Try again.
45A 4-bit register holds . It is configured as a circular shift-right register. After 6 circular right shifts, what does the register contain?
Shift Registers
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
For a 4-bit circular register, shifting is periodic with period 4, so 6 shifts equals 2 net shifts. Circular right-shifting once gives , and a second gives .
Incorrect! Try again.
46A bidirectional shift register with parallel load requires selecting among 4 operations (no change, shift right, shift left, parallel load). What size multiplexer per flip-flop and how many mode-control lines are needed?
Shift Registers
Hard
A. MUX with mode-control lines
B. MUX with mode-control line
C. MUX with mode-control lines
D. MUX with mode-control lines
Correct Answer: MUX with mode-control lines
Explanation:
Four operations require a multiplexer feeding each flip-flop's input, and selecting one of four inputs needs mode-control lines.
Incorrect! Try again.
47A linear feedback shift register (LFSR) of length using an XOR feedback tap that produces a maximal-length sequence cycles through how many distinct states?
Shift Registers
Hard
A. states
B. states
C. states
D. states
Correct Answer: states
Explanation:
A maximal-length LFSR cycles through all non-zero states. The all-zero state is excluded because it is a lock-up state for XOR feedback, giving states.
Incorrect! Try again.
48In an arithmetic circuit, the input to the adder is controlled so that becomes and the input carry . If , which micro-operation is realized?
Micro operations (Arithmetic, logic, shift)
Hard
A. (increment)
B. (simple addition)
C. (reverse subtraction)
D. (subtraction via 2's complement)
Correct Answer: (subtraction via 2's complement)
Explanation:
Adding the 1's complement plus 1 forms the 2's complement of , so . This is the standard subtraction micro-operation.
Incorrect! Try again.
49A selective-complement micro-operation is defined as . If and , what is the result, and which bits of get toggled?
Micro operations (Arithmetic, logic, shift)
Hard
A.Result ; no bits toggled
B.Result ; all bits toggled
C.Result ; bits where are toggled
D.Result ; bits where are toggled
Correct Answer: Result ; bits where are toggled
Explanation:
XOR with selectively complements those bit positions of where has a 1. , toggling the two positions where .
Incorrect! Try again.
50For an 8-bit register holding interpreted as a signed 2's complement number, what value results from one arithmetic shift right, and is the sign preserved?
Micro operations (Arithmetic, logic, shift)
Hard
A.; sign bit becomes positive
B.; sign bit is preserved (still negative)
C.; a 1 is inserted at the LSB
D.; sign bit is lost
Correct Answer: ; sign bit is preserved (still negative)
Explanation:
An arithmetic shift right replicates the sign bit into the MSB. Shifting right yields , keeping the leftmost bit as 1 so the number remains negative (effectively dividing by 2).
Incorrect! Try again.
51In a 4-bit ripple-carry adder, if each full adder has a propagation delay of ns for sum and ns for carry, what is the worst-case delay for the most significant sum bit to become valid?
Addition
Hard
A. ns
B. ns
C. ns
D. ns
Correct Answer: ns
Explanation:
The carry must ripple through the first three stages ( ns) before the fourth stage can compute its sum ( ns), giving ns worst case.
Incorrect! Try again.
52Two signed 4-bit 2's complement numbers and are added. What is the result and does overflow occur?
, but 4-bit signed range is to . The sum represents , and since two positive operands produced a negative result, signed overflow has occurred.
Incorrect! Try again.
53Perform where and using 2's complement subtraction in 4 bits. What is the result and what does the carry-out indicate?
Subtraction
Hard
A.; end carry indicates overflow
B.; end carry of 1 indicates a positive result
C.; end carry indicates borrow
D.; no end carry indicates the result is negative
Correct Answer: ; no end carry indicates the result is negative
Explanation:
with no end carry. In signed subtraction, absence of end carry signals a negative result; , matching .
Incorrect! Try again.
54In an unsigned subtraction using 2's complement, the presence of an end-carry (carry-out of 1) means what about the relationship between and ?
Subtraction
Hard
A.Overflow has occurred and the result is invalid
B., and the result is the correct positive difference
C. exactly
D., and the result must be re-complemented
Correct Answer: , and the result is the correct positive difference
Explanation:
For unsigned 2's complement subtraction, an end-carry of 1 indicates so the difference is non-negative and directly correct. No end-carry means , requiring re-complementing with a sign.
Incorrect! Try again.
55Using Booth's algorithm to multiply multiplier , how many arithmetic operations (additions or subtractions of the multiplicand) are performed?
Booth Multiplication
Hard
A. operations (only shifts)
B. operations (one per bit)
C. operations (all subtractions)
D. operations (one subtract, one add)
Correct Answer: operations (one subtract, one add)
Explanation:
Booth examines bit pairs (including an implicit ): gives transitions . The pair triggers a subtract and the pair triggers an add; the run of identical bits only shifts, giving 2 operations.
Incorrect! Try again.
56Booth's algorithm inspects the bit pair at each step. Which pair value causes the partial product accumulator to have the multiplicand added to it?
Booth Multiplication
Hard
A.
B.
C.
D.
Correct Answer:
Explanation:
In Booth's algorithm a transition marks the end of a string of 1s, so the multiplicand is added. A marks the start and triggers subtraction; and perform only an arithmetic shift.
Incorrect! Try again.
57A key advantage of Booth's algorithm over standard sequential multiplication is that it:
Booth Multiplication
Hard
A.Handles signed 2's complement operands directly and skips runs of identical bits
B.Eliminates the need for any shift operations
C.Always requires exactly additions for -bit operands
D.Only works correctly for unsigned positive numbers
Correct Answer: Handles signed 2's complement operands directly and skips runs of identical bits
Explanation:
Booth's algorithm operates on 2's complement numbers without special sign handling and treats runs of consecutive identical bits with only shifts, reducing the number of add/subtract operations for such patterns.
Incorrect! Try again.
58In a typical HDL-based design flow, which stage transforms behavioral/RTL descriptions into an optimized gate-level netlist mapped to a target technology library?
Introduction to HDLs: History, Evolution, Typical HDL-based Design Flow (Design, Simulation, Synthesis, Verification)
Hard
A.Timing back-annotation
B.Synthesis
C.Behavioral verification
D.Simulation
Correct Answer: Synthesis
Explanation:
Synthesis converts the RTL description into a gate-level netlist optimized for area, timing, and power, mapping logic onto cells from the target technology library. Simulation and verification only validate behavior; they do not produce netlists.
Incorrect! Try again.
59During functional simulation before synthesis, a design behaves correctly, but after synthesis the gate-level simulation shows glitches and timing failures. The most likely cause is:
Introduction to HDLs: History, Evolution, Typical HDL-based Design Flow (Design, Simulation, Synthesis, Verification)
Hard
A.Use of non-synthesizable constructs or missing timing constraints not captured by pre-synthesis simulation
B.The testbench was written in a software language rather than an HDL
C.Functional simulation is always incorrect and should be skipped
D.The RTL code contained syntax errors ignored by the simulator
Correct Answer: Use of non-synthesizable constructs or missing timing constraints not captured by pre-synthesis simulation
Explanation:
Pre-synthesis (functional) simulation ignores real gate delays and may pass even when code uses constructs that synthesize differently or lack timing constraints. Post-synthesis simulation reveals real delays, exposing glitches and timing violations.
Incorrect! Try again.
60Consider the Verilog fragment inside an always block: a = b; c = a; versus a <= b; c <= a;. Assuming a, b, c are registers and this is the only block driving them, what is the key difference in outcome?
Comparison with Software Programming Languages
Hard
A.Both produce identical results since Verilog ignores assignment type
B.Non-blocking assignments execute faster but give the same values as blocking
C.Blocking assignments cause to get the old value of
D.Blocking assigns update sequentially so gets new ; non-blocking schedule updates so gets old
Correct Answer: Blocking assigns update sequentially so gets new ; non-blocking schedule updates so gets old
Explanation:
Blocking (=) executes in order like software statements, so becomes then becomes the new (=). Non-blocking (<=) samples RHS values first then updates together, so receives the old value of . This models concurrent hardware.
Incorrect! Try again.
Did this save you a night before the exam?
LPU Notes is free, and it stays free. Ads cover part of the server bill.
The rest comes out of a student's own pocket: the domain, the storage,
and keeping the site up through the weeks everyone needs it at once.
The payment button didn't load. An ad blocker or a filtered network is the usual reason.
to try again.
Nothing here is ever locked, and nothing unlocks. Chip in only if it was worth it.
What it pays for →