Font size
WorksheetsComputer System Architecture
Total questions: 35
Worksheet time: 21mins
Identify the name of this Logic Gate
Identify the name of this Logic Gate
Identify the name of this Logic Gate
Identify the name of this Logic Gate
Identify the name of this Logic Gate
NOR Gate
Identify the name of this Logic Gate
NOR Gate
XOR Gate
Identify the name of this Logic Gate
XNOR Gate
NOR Gate
XOR Gate
The Input give complement or opposite at the Output
Inverter
AND Gate
OR Gate
NAND Gate
Produces a High Output only when all the input are High
Inverter
AND Gate
OR Gate
NAND Gate
Produces a High Output when only one of the input are High
Inverter
AND Gate
OR Gate
NAND Gate
Produces a High Output when only one of the input are Low
Inverter
AND Gate
OR Gate
NAND Gate
Produces a High Output when all of the input are Low
XNOR Gate
XOR Gate
NOR Gate
NAND Gate
Produces a High Output when the input are Different
XNOR Gate
XOR Gate
NOR Gate
NAND Gate
Produces a High Output when the input are Same
XNOR Gate
XOR Gate
NOR Gate
NAND Gate
The ALU carries out arithmetic and logic operations. It processes _____ numbers rather than decimal numbers.
binary
decimal
hexadecimal
All of the above
An OR gate can be imagined as
switches connected in series.
switches connected in parallel
MOS transistors connected in series
All of the above
A NOR gate has two or more input signals. All input must be _____ to get a high output
low
highC
1'sD
some low some high
Which of the following expressions is in the sum-of-products (SOP) form?
(A + B)(C + D)
(A)B(CD)
AB(CD)
AB + CD
From the truth table above , determine the standard SOP expression.
A'B'C' + ABC+AB'C
ABC + ABC + ABC
A'B'C + A'BC + ABC'
AB'C + A'BC + ABC'
n Boolean algebra, A + 1 = 1.
True
False
In Boolean algebra, A+AB= A.
True
False
A Karnaugh map is similar to a truth table because it presents all the possible values of input variables and the resulting output of each value.
True
False
By applying De Morgan's theorem to a NOR gate, two identical truth tables can be produced.
True
False
How many gates would be required to implement the following Boolean expression before simplification? XY + X(X + Z) + Y(X + Z)
1
2
4
5
Type of Flip-Flop
SR FLIP-FLOP
CLOCKED SR FLIP-FLOP
JK FLIP-FLOP
T FLIP-FLOP
D FLIP-FLOP
What is Binary Number?
What is Octal Number?
What is Decimal NUMBER?
What is Hexadecimal Number?
Change 5678 into decimal number
37710
37910
37510
37610
Change 162.378 into decimal number
117.3610
114.3110
115.3410
411.1310
Change 7C.BA16 into decimal number
117.366562510
124.316562510
125.726562510
141.866562510
Change 10101100101.1001001 to Hexadecimal
565.9216
597.9216
565.9416
575.9216
Change AB34.39EF to binary
1010101100110100.00111001111011112
1010101100110100.0011100111101112
1010101000110100.00111001111011112
1010101100110001.00111001111011112
Change 101011101.1010 into Octal
534.58
575.58
535.68
535.58
