NEW
Font size
S
M
L
XL
WorksheetsNEW 1.4.3 Boolean Algebra
Total questions: 54
Worksheet time: 27mins
Name
Class
Date
1.
Which Boolean algebra rule/law can be exemplified by: A ∧ (BVC) ≡ (A∧B) V (A∧C)
a)
De Morgan’s Law
b)
Commutation
c)
Distribution
d)
Association
2.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Every binary '0' has to be included in a group
b)
Overlapping groups are not allowed
c)
Overlapping groups are allowed
d)
Every binary '1' doesn't have to included in a group
3.
What is the output from the Boolean expression: ¬0?
a)
O
b)
1
c)
11
d)
10
4.
What is an XOR?
a)
Exclusive OR
b)
NOT OR
c)
AND
d)
Double negation
5.
Using commutation, which is an equivalent expression for: (X Ʌ Y) V (A Ʌ B)
a)
(A Ʌ B) V (X Ʌ Y)
b)
(A V B) Ʌ (X V Y)
c)
(A V B) V (X V Y)
d)
(A Ʌ B) Ʌ (X Ʌ Y)
6.
If A = 0, B = 1, C = 1. What is the output from: NOT A OR (B AND C)?
a)
11
b)
O
c)
10
d)
1
7.
If A = 1, B = 0, C = 1, D = 1. What is the output from the Boolean expression: (A∧B)V(C∧D)?
a)
1
b)
O
c)
10
d)
11
8.
When combining two half adder circuits together to make a full adder which additional gate is needed?
a)
AND
b)
XOR
c)
NOT
d)
OR
9.
Why do we use Karnaugh maps, laws and rules to simplify Boolean expressions?
a)
So that the resulting logic can be implemented using a minimum number of physical logic gates
b)
To reduce the cost of building physical circuits
c)
In order to get rid of redundant parts of Boolean expressions
d)
All of these answers
10.
If A = 1, B = 0, C = 0, D = 1. What is the output from the Boolean expression: (A∧B)V(C∧D)?
a)
10
b)
11
c)
1
d)
O
11.
If A = 1, B = 0, C = 1. What is the output from the Boolean expression: ¬(A∧B)∧C?
a)
11
b)
O
c)
1
d)
10
12.
What does this Boolean expression mean: A ∧ B?
a)
A
b)
A OR B
c)
A AND B
d)
A NOT B
13.
Which rule/law of Boolean algebra is exemplified by: ¬(AVB) ≡ (¬A) ∧ (¬B)?
a)
Commutation
b)
Association
c)
Distribution
d)
De Morgan’s law
14.
What is NOT in the context of the expression, 'IF A AND NOT B THEN…'?
a)
Wildcard
b)
Arithmetic operator
c)
Assignment
d)
Boolean operator
15.
What is the output from the Boolean expression: 1 ∧ 0?
a)
O
b)
1
c)
10
d)
11
16.
Which Boolean algebra rule/law can be described as 'the removal of brackets from an expression and the regrouping of the variables'?
a)
Distribution
b)
De Morgan’s Law
c)
Association
d)
Commutation
17.
Using association simplify the following expression: (X Ʌ Y) Ʌ (W Ʌ Z)
a)
X Ʌ Y Ʌ W Ʌ Z
b)
(X V Y) Ʌ (W V Z)
c)
(X V Y) V (W V Z)
d)
(X Ʌ Y) V (W Ʌ Z)
18.
If A = 0, B = 1, C = 1. What is the output from: A AND (B AND C)?
a)
11
b)
O
c)
1
d)
10
19.
Using De Morgan's law which of the following is an alternative expression for: ¬W Ʌ ¬X
a)
¬W V ¬X
b)
¬(W V X)
c)
(¬W V ¬X)
d)
¬(W Ʌ X)
20.
What is OR in the context of the expression, 'WHILE A < 0 OR A > 3'?
a)
Boolean operator
b)
Assignment
c)
Arithmetic operator
d)
Wildcard
21.
Which of the following is a valid rule when working with Karnaugh maps?
a)
The headings count down in binary: 11, 10, 01, 00
b)
None of these are valid rules
c)
Only 1 digit changes at a time in the headings: 00, 01, 11, 10
d)
The heading digits should count up in binary: 00, 01, 10, 11
22.
What can be described as, 'a visual method of simplifying Boolean algebra expressions which doesn't need extensive calculations and takes advantage of human pattern-recognition capabilities'?
a)
De Morgan’s Law
b)
Karnaugh Maps
c)
Commutation
d)
Distribution
23.
What is the output from the Boolean expression: ¬1?
a)
1
b)
11
c)
10
d)
O
24.
If A = 1, B = 0, C = 1, D = 0. What is the output from the Boolean expression: (AVB)V(C∧D)?
a)
11
b)
O
c)
1
d)
10
25.
If A = 0, B = 1, C = 1. What is the output from: NOT A XOR (B AND C)?
a)
10
b)
O
c)
1
d)
11
26.
If A = 0, B = 1, C = 0. What is the output from: A OR (B OR C)?
a)
10
b)
O
c)
11
d)
1
27.
What does this Boolean expression mean: ¬A?
a)
AND A
b)
A
c)
OR A
d)
NOT A
28.
What is the output from the Boolean expression: 1 ∧ 1?
a)
10
b)
11
c)
1
d)
O
29.
What is a half adder circuit?
a)
A circuit which can only add together two input variables
b)
A circuit which can control the timing of clock pulses on your processor
c)
A circuit which can be viewed as a memory and has two stable states
d)
A circuit which can add together two input variables and a carry bit from another addition
30.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Groups should be as small as possible
b)
Groups must be made up of 2n binary '1's. e.g. groups of 1, 2, 4, 8 etc.
c)
Groups can be made up of any number of binary '1's
d)
Every binary '0' has to be included in a group
31.
If A = 1, B = 1, C = 1. What is the output from the Boolean expression: ¬(A∧B)∧C?
a)
1
b)
11
c)
O
d)
10
32.
Which Boolean algebra rule/law can be described as, 'the order of application of two separate terms is not important'?
a)
Association
b)
De Morgan’s Law
c)
Double Negation
d)
Commutation
33.
What is a D type flip flop circuit?
a)
A circuit which can be viewed as a memory unit and has two stable states
b)
A circuit which can control the timing of clock pulses on your processor
c)
A circuit which can only add together two input variables
d)
A circuit which can add together two input variables and a carry bit from another addition
34.
What is the output from the Boolean expression: 0 ∧ 1?
a)
11
b)
O
c)
10
d)
1
35.
If A = 1, B = 0, C = 1, D = 1. What is the output from the Boolean expression: (AVB)∧(CVD)?
a)
11
b)
10
c)
1
d)
O
36.
What is the output from the Boolean expression: 1 V 0?
a)
O
b)
11
c)
1
d)
10
37.
If A = 0, B = 1, C = 0. What is the output from: A OR (B AND C)?
a)
1
b)
11
c)
10
d)
O
38.
How is a D type flip flop circuit triggered?
a)
By both its inputs being true
b)
By both its inputs being false
c)
By the falling edge of a clock pulse
d)
By the rising edge of a clock pulse
39.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Wrap around groups are not allowed
b)
Wrap around groups are allowed
c)
Diagonal groups are allowed
d)
Every binary '0' has to be included in a group
40.
What is the output from the Boolean expression: 1 V 1?
a)
1
b)
10
c)
O
d)
11
41.
If A = 0, B = 1. What is the output from the Boolean expression: A∧B?
a)
1
b)
O
c)
11
d)
10
42.
What is the output from the Boolean expression: 0 V 1?
a)
1
b)
11
c)
10
d)
O
43.
If A = 0, B = 1, C = 1. What is the output from: A OR (B AND C)?
a)
1
b)
10
c)
11
d)
O
44.
If A = 0, B = 0, C = 1, D = 1. What is the output from the Boolean expression: (AVB)∧(CVD)?
a)
1
b)
O
c)
10
d)
11
45.
If A = 0, B = 1. What is the output from the Boolean expression: ¬AVB?
a)
O
b)
11
c)
10
d)
1
46.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Diagonal groups are allowed
b)
Group binary '1's in rectangles or squares
c)
Group binary '1's in squares only
d)
Group binary '1's in any shape
47.
What does this Boolean expression mean: A V B?
a)
A AND B
b)
A NOT B
c)
A OR B
d)
A
48.
If A = 0. What is the output from the Boolean expression: ¬(¬A)?
a)
11
b)
O
c)
10
d)
1
49.
If A = 1, B = 0, C = 1, D = 0. What is the output from the Boolean expression: (AVB)∧(C∧D)?
a)
11
b)
O
c)
10
d)
1
50.
What is a full adder circuit?
a)
A circuit which can only add together two input variables
b)
A circuit which can be viewed as a memory and has two stable states
c)
A circuit which can add together two input variables and a carry bit from another addition
d)
A circuit which can control the timing of clock pulses on your processor
51.
If A = 0, B = 1. What is the output from the Boolean expression: ¬(A∧¬B)?
a)
10
b)
1
c)
O
d)
11
52.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Make groups as large as possible
b)
Make groups of 1, 3, 5 or more 1s
c)
Aim for the largest number of groups
d)
Make groups as small as possible
53.
What is AND in the context of the expression, 'IF X AND Y THEN…'?
a)
Wildcard
b)
Arithmetic operator
c)
Assignment
d)
Boolean operator
54.
Which Boolean algebra rule/law is exemplified by: ¬(¬ A) = A
a)
Double negation
b)
Commutation
c)
Distribution
d)
De Morgan’s Law
Reset
