NEW
Font size
S
M
L
XL
WorksheetsA Level CS - 06 Boolean Algebra & Logic Gates
Total questions: 20
Worksheet time: 20mins
Name
Class
Date
1.
Electronic components used to perform Boolean Algorithms.
a)
Logic Gates
b)
Adders
c)
De Morgan's Law
d)
Flip-flops
e)
Algorithms
2.
An equation made up of Boolean operations.
a)
Boolean expression
b)
Logic Gates
c)
NOT
d)
De Morgan's Law
e)
OR
3.
A combination of logic gates.
a)
Logic circuit
b)
Boolean expressions
c)
Logic Gates
d)
NOT
e)
De Morgan's Law
4.
A memory unit that can store one bit.
a)
FLIP FLOP
b)
Logic circuit
c)
Boolean expressions
d)
Logic Gates
e)
NOT
5.
A memory unit that changes state with each pulse of the clock from 0 to 1.
a)
Edge triggered d type flip flop
b)
Adder
c)
Logic circuit
d)
Boolean expressions
e)
Logic Gates
6.
A device that generates a signal used to synchronise the components of a computer.
a)
Clock
b)
Edge triggered d type flip flop
c)
FLIP FLOP
d)
Logic circuit
e)
Boolean expressions
7.
Part of the processor that processes and manipulates data.
a)
Arithmetic Logic Unit
b)
Clock
c)
Edge triggered d type flip flop
d)
FLIP FLOP
e)
Logic circuit
8.
A circuit that performs addition using inputs from A and B only.
a)
Half adder
b)
Arithmetic Logic Unit
c)
Clock
d)
Edge triggered d type flip flop
e)
FLIP FLOP
9.
A circuit that performs addition using inputs from A and B plus a carry bit.
a)
Full Adder
b)
Half adder
c)
Arithmetic Logic Unit
d)
Clock
e)
Edge triggered d type flip flop
10.
used to store 0 or 1 depending on the result binary addition.
a)
Carry bit
b)
Full Adder
c)
Half adder
d)
Arithmetic Logic Unit
e)
Clock
11.
An equation made up of Boolean operations.
a)
Boolean Expression
b)
Carry bit
c)
Full Adder
d)
Half adder
e)
Arithmetic Logic Unit
12.
Result is true if any of the inputs false.
a)
NAND gate
b)
NOR gate
c)
XOR gate
d)
Full Adder
e)
Half adder
13.
A method of representing/calculating the result of every possible combination of inputs in a Boolean expression.
a)
Truth table
b)
NAND gate
c)
Boolean Expression
d)
Carry bit
e)
Full Adder
14.
Result is true if both inputs are true.
a)
AND gate
b)
Truth table
c)
NAND gate
d)
Boolean Expression
e)
Carry bit
15.
Only TRUE if both inputs are false.
a)
NOR Gate
b)
AND gate
c)
Truth table
d)
NAND gate
e)
Boolean Expression
16.
a single Boolean function.
a)
Boolean operation
b)
Boolean expression
c)
NOT a AND b
d)
Truth table
e)
Logic Circuit
17.
Boolean operation that is true if either input is true but not if both inputs are true.
a)
XOR
b)
Boolean operation
c)
NOR Gate
d)
AND gate
e)
Truth table
18.
Boolean operation that outputs true if either of its inputs are true.
a)
OR
b)
XOR
c)
Boolean operation
d)
NOR Gate
e)
AND gate
19.
a process for simplifying Boolean expressions.
a)
De Morgan's Law
b)
OR
c)
XOR
d)
Boolean operation
e)
NOR Gate
20.
Boolean operation that inverts the result so true becomes false and false becomes true.
a)
NOT
b)
De Morgan's Law
c)
OR
d)
XOR
e)
Boolean operation
Reset
