Tutorial
Hub
Atlas · 51 trails
My expedition
Trail Atlas
Swiss Index
← 01 Digital Logic & Number Systems
Area 01 test · Foundations
Digital Logic & Number Systems
20 questions · 70% to pass · no time limit. You see the right answers and why after you submit.
1
What is 8'hB6 in decimal (unsigned)?
166
182
198
214
2
What is the signed (two's complement) value of 8'hF6?
−10
−9
−118
+246
3
What range does a 6-bit two's complement number cover?
0 … 63
−31 … +31
−32 … +31
−64 … +63
4
On 8 bits, 100 + 100 = 200. Which flags are set?
Carry only
Overflow only
Both carry and overflow
Neither
5
The 4-bit value 1010 (−6) is moved to an 8-bit signed bus. What should the 8-bit value be?
0000_1010
1000_1010
1111_1010
1111_0110
6
Which expression detects signed overflow for a 4-bit subtraction d = a − b?
a[3] == b[3] && d[3] != a[3]
a[3] != b[3] && d[3] != a[3]
a[3] != b[3] && d[3] == a[3]
d[3] != b[3]
7
Simplify F = a·b + a·b̄ + ā·b.
a
b
a + b
a ⊕ b
8
By De Morgan, (a + b)̄ equals…
ā + b̄
ā · b̄
a · b
(a · b)̄
9
Which term can be removed from a·b + ā·c + b·c without changing the function?
a·b
ā·c
b·c
None of them
10
In a Karnaugh map, why are rows and columns ordered 00, 01, 11, 10?
It is alphabetical
Neighbouring cells differ by exactly one bit (Gray code)
It minimises the number of cells
It puts minterms in numeric order
11
Which single gate type is universal?
XOR
AND
NAND
OR
12
A full adder's carry-out is…
a ⊕ b ⊕ cin
a·b + cin·(a ⊕ b)
a·b·cin
(a + b)·cin
13
How does an adder compute a − b?
a + b with carry-in 1
a + ~b with carry-in 1
~a + b with carry-in 0
a + ~b with carry-in 0
14
What is the main drawback of a ripple-carry adder?
It cannot subtract
Its delay grows with width because the carry passes through every stage
It needs a clock
It only works for unsigned numbers
15
An always @* block assigns y in the if-branch but not in the else-branch. What does synthesis infer?
A flip-flop
A latch
A multiplexer only
A syntax error
16
Setup time is the time that…
Q takes to change after the clock edge
D must be stable before the clock edge
D must be stable after the clock edge
the reset must be held
17
The minimum clock period of a register-to-register path is approximately…
t_su + t_h
t_cq + logic delay + t_su
t_cq + t_h
logic delay only
18
A single-bit signal crosses from one clock domain to another. What is the standard fix?
Add a latch
Pass it through two flip-flops in the destination domain
Invert the clock
Use a wider bus
19
In a Moore state machine, outputs depend on…
inputs only
current state only
current state and inputs
the next state
20
In a testbench, why compare with !== instead of != ?
It is faster
It treats X and Z as values, so an X output is caught as a mismatch
It ignores X
It compares signed values
0 of 20 answered
Submit answers