A) A high level, using algorithms or procedural constructs B) The layout level C) The transistor level D) The gate-instance level
A) What the system does, not how it is built B) The exact gate delays C) How the system is physically built D) The wiring between modules
A) Wiring a breadboard B) Placing and routing a chip C) Drawing a schematic D) Writing pseudocode or an algorithm
A) assign statements only B) always, if, case, for C) wire declarations only D) AND/OR gate instances only
A) Behavioral: Medium, Dataflow: High, Gate-level: Low B) All three are High C) Behavioral: Low, Dataflow: Medium, Gate-level: High D) Behavioral: High, Dataflow: Medium, Gate-level: Low
A) Hardware structure B) Algorithmic behavior C) Data movement D) Testbench stimulus
A) Hardware structure B) Simulation time C) Data movement D) Algorithmic behavior
A) initial B) assign C) always D) case
A) Only when inputs change B) Only once at the start C) Only on the falling clock edge D) Whenever a signal in its sensitivity list changes
A) Yes, inputs and outputs only B) No, it can respond to any input, output, or internal C) Yes, clock signals only D) Yes, inputs only
A) The signals that trigger the block to execute B) The reset value C) The data types of the signals D) The module’s ports
A) always @(negedge reset) B) always @(posedge clk) C) initial begin D) always @(a or b or c)
A) Ignores all signals B) Triggers only on clock edges C) Runs only once D) Automatically includes all right-hand-side signals in the sensitivity list
A) Falling edge of clk or rising edge of reset B) Any change in d C) Rising edge of clk or falling edge of reset D) Rising edge of both
A) Usually not good practice B) The only way to model a counter C) Required for all designs D) Required for flip-flops
A) Combinational logic uses always @(); sequential logic uses always @(posedge clk ...) B) Both use initial blocks C) Combinational logic uses always @(posedge clk); sequential logic uses always @() D) Both must use assign
A) Only once at the start of simulation B) Only during synthesis C) Whenever an input changes D) On every clock edge
A) Describing flip-flops in hardware B) Describing combinational multiplexers C) Testbenches, setting initial values, and file operations D) Declaring module ports
A) Not synthesizable in most FPGA/ASIC flows B) Triggered by posedge clk C) Required in every module D) Always synthesizable
A) 1 time unit B) 10 time units C) It never changes D) 0 time units
A) Only the last block is used B) Each block must share the same sensitivity list C) Hardware is inherently parallel, and each block models an independent circuit element D) To make code run slower
A) Alternating on each clock B) Concurrently, so you should not assume an order C) Only the first one runs D) One after another in the order written
A) In random order B) In parallel with each other C) Only once D) Sequentially, in the order written
A) The clock generator B) The sequential counter register C) The reset synchronizer D) The combinational display/check logic
A) Two B) One C) Four D) Three
A) A testbench using initial B) Combinational logic using always @(*) C) A memory unit D) Sequential logic using posedge clk
A) NOT gate B) AND gate C) XOR gate D) OR gate
A) Logic, always block, module declaration, sensitivity list B) Always block, logic, sensitivity list, module declaration C) Module declaration, always block, sensitivity list, logic implementation D) Sensitivity list, module declaration, always block, logic
A) The clock only B) Stored values only C) Current inputs and past states D) Current inputs only
A) A clock input B) Flip-flops C) Latches D) No memory element
A) Combinational: f(inputs + past states); Sequential: f(inputs) B) Combinational: f(inputs); Sequential: f(inputs + past states) C) Both: f(inputs) D) Both: f(past states only)
A) Decoder B) Half adder C) D flip-flop D) Multiplexer
A) Inputs: SUM, CARRY; Outputs: A, B B) Inputs: A, B; Outputs: A_gt_B, A_eq_B C) Inputs: A, B; Outputs: SUM, CARRY D) Inputs: A, B, S; Output: Y
A) A NAND B B) A OR B C) A AND B D) A XOR B
A) A AND B B) A XOR B C) A OR B D) NOT A
A) assign SUM = A | B; B) assign SUM = A & B; C) assign SUM = ~A; D) assign SUM = A ^ B;
A) SUM = 1, CARRY = 1 B) SUM = 0, CARRY = 0 C) SUM = 1, CARRY = 0 D) SUM = 0, CARRY = 1
A) Y = D0 + D1 + S B) Y = (~S · D1) + (S · D0) C) Y = (~S · D0) + (S · D1) D) Y = (S · D0) + (~S · D1)
A) D0 B) S C) 0 D) D1
A) D1 B) ~D1 C) D0 D) 0
A) Sorting circuits B) Memory addressing C) Digital calculators D) Data routing in communication
A) 3 B) 4 C) 1 D) 2
A) assign A_eq_B = (A == B); B) assign A_eq_B = (A > B); C) assign A_eq_B = A & B; D) assign A_eq_B = (A < B);
A) A_gt_B B) A_lt_B C) All of them D) A_eq_B
A) Sorting circuits and microcontrollers B) Data routing C) Memory addressing D) Display drivers
A) 4'b0010 B) 4'b0100 C) 4'b1000 D) 4'b0001
A) 4'b0001 B) 4'b1000 C) 4'b0100 D) 4'b0010
A) Because it is assigned inside a procedural block that responds to any input change B) Because it is sequential logic C) Because it needs a clock D) Because it stores the previous state
A) assign Y[2] = A[1] & A[0]; B) assign Y[2] = ~A[1] & ~A[0]; C) assign Y[2] = A[1] & ~A[0]; D) assign Y[2] = ~A[1] & A[0];
A) Sorting circuits B) Digital calculators C) Memory addressing and display drivers D) Core of microprocessors
A) Digital calculators and processors B) Memory addressing C) Sorting circuits D) Data routing
A) The core of microprocessors B) A clock generator C) A memory unit D) A type of flip-flop
A) Half adder / full adder B) Encoder C) Shift register D) Multiplexer
A) Truth tables, Boolean expressions, and HDL (Verilog) B) Layout masks C) State diagrams only D) Timing diagrams only
A) Both current inputs and previous states B) Reset only C) The clock only D) Current inputs only
A) Memory elements such as flip-flops or latches B) No outputs C) No inputs D) Only AND gates
A) Decoder B) Flip-flops C) Clock signal D) Latches
A) clock B) data C) enable D) reset
A) power B) clock C) input D) state-register
A) posedge B) level C) change D) negedge
A) Procedural continuous B) Non-blocking C) Continuous D) Blocking
A) It is an input B) It is a constant C) It is a clock D) It is assigned inside an always block and stores a value
A) Active-low B) Synchronous C) Disabled D) Asynchronous
A) Set to 0 regardless of the clock B) Set to d C) Held at its previous value D) Set to 1
A) Only during reset B) On the positive clock edge when reset is not high C) On the falling clock edge D) Immediately whenever d changes
A) High impedance B) 0 C) Unknown D) 1
A) Toggles B) Becomes 0 C) Becomes 1 D) Keeps its value (Q <= Q)
A) Becomes 1 B) Toggles C) Keeps its value D) Becomes 0
A) Becomes 1 B) Becomes 0 C) Toggles D) Keeps its value
A) reset B) toggle C) hold D) set
A) Addition B) Concatenation C) Subtraction D) Comparison
A) endmodule B) endcase C) endif D) end
A) X B) Z C) 1 D) 0
A) set B) hold C) toggle D) clear
A) 4 B) 3 C) 2 D) 8
A) 4 B) 2 C) 0 D) 1
A) 1110 B) 0111 C) 1000 D) 1111
A) 10000 B) 0000 C) 1111 D) 0001
A) high (1) B) low C) unknown D) floating
A) reset only B) clk only C) data and clk D) clk and reset
A) out B) reset C) clk D) state
A) Decoders only B) Counters, timers, shift registers, FSMs, and memory units C) Comparators only D) Half adders only
A) Gates and wires B) Module names C) Clock, input, and output signals D) Power and ground
A) Source code syntax B) Flip-flop state transitions and propagation delays C) Synthesis reports D) Chip layout
A) concatenation B) rotation C) addition D) replication
A) Q[2] B) Q[0] C) Q[1] D) Q[3]
A) 0010 B) 0101 C) 1011 D) 1010
A) analog B) decimal C) gray code D) parallel
A) A mathematical model of computation based on states and transitions B) A type of memory chip C) A clock generator D) A kind of adder
A) Mealy and Johnson B) Moore and Gray C) Moore and Mealy D) Mealy and Boolean
A) Clock B) Input C) State D) Reset
A) The clock only B) The reset only C) The state only D) The state and the input
A) 4 B) 3 C) 1 D) 2
A) S1 B) S2 C) Reset D) S0
A) S0 B) S2 C) Undefined D) S1
A) S0 B) S2 C) Never D) S1
A) Combinational, using always @(*) B) Not needed C) A testbench using initial D) Sequential, using always @(posedge clk or posedge reset)
A) 2'b11 B) 2'b10 C) 2'b00 D) 2'b01
A) Only when in = 1 B) Only in state 2'b11 C) In every state D) Only in state 2'b00
A) S2 B) S0 C) S4 D) S3 |