Font size
S
M
L
XL
WorksheetsH446.1.4.1.CD
Total questions: 135
Worksheet time: 1hrs 8mins
Name
Class
Date
1.
What is the output from the Boolean expression: 1 ∧ 0?
a)
10
b)
0
c)
1
d)
11
2.
What is the output from the Boolean expression: 1 ∧ 1?
a)
11
b)
0
c)
10
d)
1
3.
What is the output from the Boolean expression: 1 V 0?
a)
0
b)
11
c)
10
d)
1
4.
What is the output from the Boolean expression: 1 V 1?
a)
0
b)
11
c)
10
d)
1
5.
What is NOT in the context of the expression, 'IF A AND NOT B THEN…'?
a)
Wildcard
b)
Assignment
c)
Boolean operator
d)
Arithmetic operator
6.
What is OR in the context of the expression, 'WHILE A < 0 OR A > 3'?
a)
Boolean operator
b)
Arithmetic operator
c)
Assignment
d)
Wildcard
7.
What is AND in the context of the expression, 'IF X AND Y THEN…'?
a)
Arithmetic operator
b)
Boolean operator
c)
Assignment
d)
Wildcard
8.
What is an XOR?
a)
NOT OR
b)
Double negation
c)
AND
d)
Exclusive OR
9.
If A = 0, B = 1, C = 0. What is the output from: A OR (B OR C)?
a)
1
b)
11
c)
10
10.
If A = 0, B = 1, C = 1. What is the output from: A OR (B AND C)?
a)
1
b)
10
c)
11
11.
If A = 0, B = 1, C = 1. What is the output from: NOT A OR (B AND C)?
a)
0
b)
1
c)
10
d)
11
12.
If A = 0, B = 1, C = 1. What is the output from: NOT A XOR (B AND C)?
a)
11
b)
10
c)
1
13.
If A = 0, B = 1. What is the output from the Boolean expression: ¬(A∧¬B)?
a)
1
b)
10
c)
11
14.
If A = 0, B = 1. What is the output from the Boolean expression: ¬AVB?
a)
1
b)
10
c)
11
15.
If A = 0. What is the output from the Boolean expression: ¬(¬A)?
a)
1
b)
0
c)
11
d)
10
16.
If A = 1, B = 0, C = 1, D = 0. What is the output from the Boolean expression: (AVB)∧(C∧D)?
a)
11
b)
0
c)
1
d)
10
17.
If A = 1, B = 0, C = 1, D = 0. What is the output from the Boolean expression: (AVB)V(C∧D)?
a)
0
b)
11
c)
1
d)
10
18.
If A = 1, B = 0, C = 1, D = 1. What is the output from the Boolean expression: (A∧B)V(C∧D)?
a)
11
b)
0
c)
1
d)
10
19.
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
20.
What is the output from the Boolean expression: ¬0?
a)
0
b)
11
c)
10
d)
1
21.
What is the output from the Boolean expression: ¬1?
a)
10
b)
11
c)
1
22.
What does this Boolean expression mean: A ∧ B?
a)
A NOT B
b)
A AND B
c)
A OR B
d)
A
23.
What does this Boolean expression mean: ¬A?
a)
AND A
b)
NOT A
c)
A
d)
OR A
24.
What does this Boolean expression mean: A V B?
a)
A
b)
A AND B
c)
A OR B
d)
A NOT B
25.
Why do we use Karnaugh maps, laws and rules to simplify Boolean expressions?
a)
All of these answers
b)
So that the resulting logic can be implemented using a minimum number of physical logic gates
c)
To reduce the cost of building physical circuits
d)
In order to get rid of redundant parts of Boolean expressions
26.
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)
Karnaugh Maps
b)
Commutation
c)
Distribution
d)
De Morgan’s Law
27.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Every binary '1' doesn't have to included in a group
b)
Overlapping groups are allowed
c)
Every binary '0' has to be included in a group
d)
Overlapping groups are not allowed
28.
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)
The heading digits should count up in binary: 00, 01, 10, 11
d)
Only 1 digit changes at a time in the headings: 00, 01, 11, 10
29.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Groups can be made up of any number of binary '1's
b)
Groups should be as small as possible
c)
Every binary '0' has to be included in a group
d)
Groups must be made up of 2n binary '1's. e.g. groups of 1, 2, 4, 8 etc.
30.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Wrap around groups are allowed
b)
Every binary '0' has to be included in a group
c)
Diagonal groups are allowed
d)
Wrap around groups are not allowed
31.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Group binary '1's in squares only
b)
Group binary '1's in any shape
c)
Diagonal groups are allowed
d)
Group binary '1's in rectangles or squares
32.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Make groups as large as possible
b)
Aim for the largest number of groups
c)
Make groups as small as possible
d)
Make groups of 1, 3, 5 or more 1s
33.
Which Boolean algebra rule/law can be described as 'the removal of brackets from an expression and the regrouping of the variables'?
a)
Commutation
b)
De Morgan’s Law
c)
Distribution
d)
Association
34.
Using association simplify the following expression: (X Ʌ Y) Ʌ (W Ʌ Z)
a)
X Ʌ Y Ʌ W Ʌ Z
b)
(X Ʌ Y) V (W Ʌ Z)
c)
(X V Y) V (W V Z)
d)
(X V Y) Ʌ (W V Z)
35.
Which Boolean algebra rule/law can be described as, 'the order of application of two separate terms is not important'?
a)
Association
b)
Commutation
c)
De Morgan’s Law
d)
Double Negation
36.
Using commutation, which is an equivalent expression for: (X Ʌ Y) V (A Ʌ B)
a)
(A Ʌ B) Ʌ (X Ʌ Y)
b)
(A V B) V (X V Y)
c)
(A V B) Ʌ (X V Y)
d)
(A Ʌ B) V (X Ʌ Y)
37.
Which rule/law of Boolean algebra is exemplified by: ¬(AVB) ≡ (¬A) ∧ (¬B)?
a)
Association
b)
Commutation
c)
Distribution
d)
De Morgan’s law
38.
Using De Morgan's law which of the following is an alternative expression for: ¬W Ʌ ¬X
a)
¬(W Ʌ X)
b)
(¬W V ¬X)
c)
¬(W V X)
d)
¬W V ¬X
39.
Which Boolean algebra rule/law can be exemplified by: A ∧ (BVC) ≡ (A∧B) V (A∧C)
a)
Association
b)
De Morgan’s Law
c)
Commutation
d)
Distribution
40.
Which Boolean algebra rule/law is exemplified by: ¬(¬ A) = A
a)
Commutation
b)
Distribution
c)
De Morgan’s Law
d)
Double negation
41.
When combining two half adder circuits together to make a full adder which additional gate is needed?
a)
AND
b)
XOR
c)
OR
d)
NOT
42.
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
43.
What is a half adder circuit?
a)
A circuit which can control the timing of clock pulses on your processor
b)
A circuit which can be viewed as a memory and has two stable states
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
44.
What is a D type flip flop circuit?
a)
A circuit which can add together two input variables and a carry bit from another addition
b)
A circuit which can only add together two input variables
c)
A circuit which can be viewed as a memory unit and has two stable states
d)
A circuit which can control the timing of clock pulses on your processor
45.
How is a D type flip flop circuit triggered?
a)
By the rising edge of a clock pulse
b)
By both its inputs being false
c)
By the falling edge of a clock pulse
d)
By both its inputs being true
46.
What is the output from the Boolean expression: 1 ∧ 0?
a)
10
b)
0
c)
1
d)
11
47.
What is the output from the Boolean expression: 1 ∧ 1?
a)
11
b)
0
c)
10
d)
1
48.
What is the output from the Boolean expression: 1 V 0?
a)
0
b)
11
c)
10
d)
1
49.
What is the output from the Boolean expression: 1 V 1?
a)
0
b)
11
c)
10
d)
1
50.
What is NOT in the context of the expression, 'IF A AND NOT B THEN…'?
a)
Wildcard
b)
Assignment
c)
Boolean operator
d)
Arithmetic operator
51.
What is OR in the context of the expression, 'WHILE A < 0 OR A > 3'?
a)
Boolean operator
b)
Arithmetic operator
c)
Assignment
d)
Wildcard
52.
What is AND in the context of the expression, 'IF X AND Y THEN…'?
a)
Arithmetic operator
b)
Boolean operator
c)
Assignment
d)
Wildcard
53.
What is an XOR?
a)
NOT OR
b)
Double negation
c)
AND
d)
Exclusive OR
54.
If A = 0, B = 1, C = 0. What is the output from: A OR (B OR C)?
a)
1
b)
11
c)
10
55.
If A = 0, B = 1, C = 1. What is the output from: A OR (B AND C)?
a)
1
b)
10
c)
11
56.
If A = 0, B = 1, C = 1. What is the output from: NOT A OR (B AND C)?
a)
0
b)
1
c)
10
d)
11
57.
If A = 0, B = 1, C = 1. What is the output from: NOT A XOR (B AND C)?
a)
11
b)
10
c)
1
58.
If A = 0, B = 1. What is the output from the Boolean expression: ¬(A∧¬B)?
a)
1
b)
10
c)
11
59.
If A = 0, B = 1. What is the output from the Boolean expression: ¬AVB?
a)
1
b)
10
c)
11
60.
If A = 0. What is the output from the Boolean expression: ¬(¬A)?
a)
1
b)
0
c)
11
d)
10
61.
If A = 1, B = 0, C = 1, D = 0. What is the output from the Boolean expression: (AVB)∧(C∧D)?
a)
11
b)
0
c)
1
d)
10
62.
If A = 1, B = 0, C = 1, D = 0. What is the output from the Boolean expression: (AVB)V(C∧D)?
a)
0
b)
11
c)
1
d)
10
63.
If A = 1, B = 0, C = 1, D = 1. What is the output from the Boolean expression: (A∧B)V(C∧D)?
a)
11
b)
0
c)
1
d)
10
64.
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
65.
What is the output from the Boolean expression: ¬0?
a)
0
b)
11
c)
10
d)
1
66.
What is the output from the Boolean expression: ¬1?
a)
10
b)
11
c)
1
67.
What does this Boolean expression mean: A ∧ B?
a)
A NOT B
b)
A AND B
c)
A OR B
d)
A
68.
What does this Boolean expression mean: ¬A?
a)
AND A
b)
NOT A
c)
A
d)
OR A
69.
What does this Boolean expression mean: A V B?
a)
A
b)
A AND B
c)
A OR B
d)
A NOT B
70.
Why do we use Karnaugh maps, laws and rules to simplify Boolean expressions?
a)
All of these answers
b)
So that the resulting logic can be implemented using a minimum number of physical logic gates
c)
To reduce the cost of building physical circuits
d)
In order to get rid of redundant parts of Boolean expressions
71.
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)
Karnaugh Maps
b)
Commutation
c)
Distribution
d)
De Morgan’s Law
72.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Every binary '1' doesn't have to included in a group
b)
Overlapping groups are allowed
c)
Every binary '0' has to be included in a group
d)
Overlapping groups are not allowed
73.
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)
The heading digits should count up in binary: 00, 01, 10, 11
d)
Only 1 digit changes at a time in the headings: 00, 01, 11, 10
74.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Groups can be made up of any number of binary '1's
b)
Groups should be as small as possible
c)
Every binary '0' has to be included in a group
d)
Groups must be made up of 2n binary '1's. e.g. groups of 1, 2, 4, 8 etc.
75.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Wrap around groups are allowed
b)
Every binary '0' has to be included in a group
c)
Diagonal groups are allowed
d)
Wrap around groups are not allowed
76.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Group binary '1's in squares only
b)
Group binary '1's in any shape
c)
Diagonal groups are allowed
d)
Group binary '1's in rectangles or squares
77.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Make groups as large as possible
b)
Aim for the largest number of groups
c)
Make groups as small as possible
d)
Make groups of 1, 3, 5 or more 1s
78.
Which Boolean algebra rule/law can be described as 'the removal of brackets from an expression and the regrouping of the variables'?
a)
Commutation
b)
De Morgan’s Law
c)
Distribution
d)
Association
79.
Using association simplify the following expression: (X Ʌ Y) Ʌ (W Ʌ Z)
a)
X Ʌ Y Ʌ W Ʌ Z
b)
(X Ʌ Y) V (W Ʌ Z)
c)
(X V Y) V (W V Z)
d)
(X V Y) Ʌ (W V Z)
80.
Which Boolean algebra rule/law can be described as, 'the order of application of two separate terms is not important'?
a)
Association
b)
Commutation
c)
De Morgan’s Law
d)
Double Negation
81.
Using commutation, which is an equivalent expression for: (X Ʌ Y) V (A Ʌ B)
a)
(A Ʌ B) Ʌ (X Ʌ Y)
b)
(A V B) V (X V Y)
c)
(A V B) Ʌ (X V Y)
d)
(A Ʌ B) V (X Ʌ Y)
82.
Which rule/law of Boolean algebra is exemplified by: ¬(AVB) ≡ (¬A) ∧ (¬B)?
a)
Association
b)
Commutation
c)
Distribution
d)
De Morgan’s law
83.
Using De Morgan's law which of the following is an alternative expression for: ¬W Ʌ ¬X
a)
¬(W Ʌ X)
b)
(¬W V ¬X)
c)
¬(W V X)
d)
¬W V ¬X
84.
Which Boolean algebra rule/law can be exemplified by: A ∧ (BVC) ≡ (A∧B) V (A∧C)
a)
Association
b)
De Morgan’s Law
c)
Commutation
d)
Distribution
85.
Which Boolean algebra rule/law is exemplified by: ¬(¬ A) = A
a)
Commutation
b)
Distribution
c)
De Morgan’s Law
d)
Double negation
86.
When combining two half adder circuits together to make a full adder which additional gate is needed?
a)
AND
b)
XOR
c)
OR
d)
NOT
87.
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
88.
What is a half adder circuit?
a)
A circuit which can control the timing of clock pulses on your processor
b)
A circuit which can be viewed as a memory and has two stable states
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
89.
What is a D type flip flop circuit?
a)
A circuit which can add together two input variables and a carry bit from another addition
b)
A circuit which can only add together two input variables
c)
A circuit which can be viewed as a memory unit and has two stable states
d)
A circuit which can control the timing of clock pulses on your processor
90.
How is a D type flip flop circuit triggered?
a)
By the rising edge of a clock pulse
b)
By both its inputs being false
c)
By the falling edge of a clock pulse
d)
By both its inputs being true
91.
What is the output from the Boolean expression: 1 ∧ 0?
a)
10
b)
0
c)
1
d)
11
92.
What is the output from the Boolean expression: 1 ∧ 1?
a)
11
b)
0
c)
10
d)
1
93.
What is the output from the Boolean expression: 1 V 0?
a)
0
b)
11
c)
10
d)
1
94.
What is the output from the Boolean expression: 1 V 1?
a)
0
b)
11
c)
10
d)
1
95.
What is NOT in the context of the expression, 'IF A AND NOT B THEN…'?
a)
Wildcard
b)
Assignment
c)
Boolean operator
d)
Arithmetic operator
96.
What is OR in the context of the expression, 'WHILE A < 0 OR A > 3'?
a)
Boolean operator
b)
Arithmetic operator
c)
Assignment
d)
Wildcard
97.
What is AND in the context of the expression, 'IF X AND Y THEN…'?
a)
Arithmetic operator
b)
Boolean operator
c)
Assignment
d)
Wildcard
98.
What is an XOR?
a)
NOT OR
b)
Double negation
c)
AND
d)
Exclusive OR
99.
If A = 0, B = 1, C = 0. What is the output from: A OR (B OR C)?
a)
1
b)
11
c)
10
100.
If A = 0, B = 1, C = 1. What is the output from: A OR (B AND C)?
a)
1
b)
10
c)
11
101.
If A = 0, B = 1, C = 1. What is the output from: NOT A OR (B AND C)?
a)
0
b)
1
c)
10
d)
11
102.
If A = 0, B = 1, C = 1. What is the output from: NOT A XOR (B AND C)?
a)
11
b)
10
c)
1
103.
If A = 0, B = 1. What is the output from the Boolean expression: ¬(A∧¬B)?
a)
1
b)
10
c)
11
104.
If A = 0, B = 1. What is the output from the Boolean expression: ¬AVB?
a)
1
b)
10
c)
11
105.
If A = 0. What is the output from the Boolean expression: ¬(¬A)?
a)
1
b)
0
c)
11
d)
10
106.
If A = 1, B = 0, C = 1, D = 0. What is the output from the Boolean expression: (AVB)∧(C∧D)?
a)
11
b)
0
c)
1
d)
10
107.
If A = 1, B = 0, C = 1, D = 0. What is the output from the Boolean expression: (AVB)V(C∧D)?
a)
0
b)
11
c)
1
d)
10
108.
If A = 1, B = 0, C = 1, D = 1. What is the output from the Boolean expression: (A∧B)V(C∧D)?
a)
11
b)
0
c)
1
d)
10
109.
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
110.
What is the output from the Boolean expression: ¬0?
a)
0
b)
11
c)
10
d)
1
111.
What is the output from the Boolean expression: ¬1?
a)
10
b)
11
c)
1
112.
What does this Boolean expression mean: A ∧ B?
a)
A NOT B
b)
A AND B
c)
A OR B
d)
A
113.
What does this Boolean expression mean: ¬A?
a)
AND A
b)
NOT A
c)
A
d)
OR A
114.
What does this Boolean expression mean: A V B?
a)
A
b)
A AND B
c)
A OR B
d)
A NOT B
115.
Why do we use Karnaugh maps, laws and rules to simplify Boolean expressions?
a)
All of these answers
b)
So that the resulting logic can be implemented using a minimum number of physical logic gates
c)
To reduce the cost of building physical circuits
d)
In order to get rid of redundant parts of Boolean expressions
116.
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)
Karnaugh Maps
b)
Commutation
c)
Distribution
d)
De Morgan’s Law
117.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Every binary '1' doesn't have to included in a group
b)
Overlapping groups are allowed
c)
Every binary '0' has to be included in a group
d)
Overlapping groups are not allowed
118.
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)
The heading digits should count up in binary: 00, 01, 10, 11
d)
Only 1 digit changes at a time in the headings: 00, 01, 11, 10
119.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Groups can be made up of any number of binary '1's
b)
Groups should be as small as possible
c)
Every binary '0' has to be included in a group
d)
Groups must be made up of 2n binary '1's. e.g. groups of 1, 2, 4, 8 etc.
120.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Wrap around groups are allowed
b)
Every binary '0' has to be included in a group
c)
Diagonal groups are allowed
d)
Wrap around groups are not allowed
121.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Group binary '1's in squares only
b)
Group binary '1's in any shape
c)
Diagonal groups are allowed
d)
Group binary '1's in rectangles or squares
122.
Which of the following is a valid rule when working with Karnaugh maps?
a)
Make groups as large as possible
b)
Aim for the largest number of groups
c)
Make groups as small as possible
d)
Make groups of 1, 3, 5 or more 1s
123.
Which Boolean algebra rule/law can be described as 'the removal of brackets from an expression and the regrouping of the variables'?
a)
Commutation
b)
De Morgan’s Law
c)
Distribution
d)
Association
124.
Using association simplify the following expression: (X Ʌ Y) Ʌ (W Ʌ Z)
a)
X Ʌ Y Ʌ W Ʌ Z
b)
(X Ʌ Y) V (W Ʌ Z)
c)
(X V Y) V (W V Z)
d)
(X V Y) Ʌ (W V Z)
125.
Which Boolean algebra rule/law can be described as, 'the order of application of two separate terms is not important'?
a)
Association
b)
Commutation
c)
De Morgan’s Law
d)
Double Negation
126.
Using commutation, which is an equivalent expression for: (X Ʌ Y) V (A Ʌ B)
a)
(A Ʌ B) Ʌ (X Ʌ Y)
b)
(A V B) V (X V Y)
c)
(A V B) Ʌ (X V Y)
d)
(A Ʌ B) V (X Ʌ Y)
127.
Which rule/law of Boolean algebra is exemplified by: ¬(AVB) ≡ (¬A) ∧ (¬B)?
a)
Association
b)
Commutation
c)
Distribution
d)
De Morgan’s law
128.
Using De Morgan's law which of the following is an alternative expression for: ¬W Ʌ ¬X
a)
¬(W Ʌ X)
b)
(¬W V ¬X)
c)
¬(W V X)
d)
¬W V ¬X
129.
Which Boolean algebra rule/law can be exemplified by: A ∧ (BVC) ≡ (A∧B) V (A∧C)
a)
Association
b)
De Morgan’s Law
c)
Commutation
d)
Distribution
130.
Which Boolean algebra rule/law is exemplified by: ¬(¬ A) = A
a)
Commutation
b)
Distribution
c)
De Morgan’s Law
d)
Double negation
131.
When combining two half adder circuits together to make a full adder which additional gate is needed?
a)
AND
b)
XOR
c)
OR
d)
NOT
132.
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
133.
What is a half adder circuit?
a)
A circuit which can control the timing of clock pulses on your processor
b)
A circuit which can be viewed as a memory and has two stable states
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
134.
What is a D type flip flop circuit?
a)
A circuit which can add together two input variables and a carry bit from another addition
b)
A circuit which can only add together two input variables
c)
A circuit which can be viewed as a memory unit and has two stable states
d)
A circuit which can control the timing of clock pulses on your processor
135.
How is a D type flip flop circuit triggered?
a)
By the rising edge of a clock pulse
b)
By both its inputs being false
c)
By the falling edge of a clock pulse
d)
By both its inputs being true
Reset
