0% found this document useful (0 votes)
110 views

Dig 1

The document appears to be a set of quiz questions related to digital logic and number systems. It includes multiple choice questions about binary systems, positional notation, logic gates, Boolean algebra, and other topics. The questions are formatted with answers to select from and feedback on correct or incorrect responses.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
110 views

Dig 1

The document appears to be a set of quiz questions related to digital logic and number systems. It includes multiple choice questions about binary systems, positional notation, logic gates, Boolean algebra, and other topics. The questions are formatted with answers to select from and feedback on correct or incorrect responses.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 187

Question 

1
Correct
Mark 1.00 out of 1.00

Flag question

Question text
It is a system that manipulates discrete elements of information represented internally in
binary form.

Select one:

a.
Binary System

b.
Information System

c.
Electronic System

d.
Digital System

Question 2
Correct
Mark 1.00 out of 1.00

Flag question

Question text
It deals with variables that take on two discrete values, and operations that assume logical
meaning.

Select one:

a.
Symbolic Logic

b.
Propositional Calculus

c.
Algebraic Function
d.
Binary Logic

Question 3
Correct
Mark 1.00 out of 1.00

Flag question

Question text
What is the equivalent of 34563456 in the decimal number system?

Select one:

a.
2341023410

b.
1371013710

c.
2331023310

d.
1361013610

Question 4
Correct
Mark 1.00 out of 1.00

Flag question

Question text
What is the equivalent of  10110.0101210110.01012 in hexadecimal number system?

Select one:

a.
18.241618.2416

b.
26.241626.2416
c.
22.51622.516

d.
16.51616.516

Question 5
Correct
Mark 1.00 out of 1.00

Flag question

Question text
The ______ of a number system gives the number of symbols used in a system; it is always
expressed in decimal numbers and is indicated by a subscript.

Select one:

a.
Unit

b.
None of the above

c.
Name

d.
Radix

Question 6
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Evaluate the output F3�3 if A=1, B=0, C=0, D=1. Refer to the figure below.
1
Answer:

Question 7
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Find the two’s complement of the binary number 11011010
00100110
Answer: 

Question 8
Correct
Mark 1.00 out of 1.00

Flag question

Question text
We use _______________ to find the decimal equivalent of a particular value expressed in a
different number system.

Select one:

a.
Positional notation

b.
Set builder notation

c.
Scientific notation
d.
Interval notation

Question 9
Correct
Mark 1.00 out of 1.00

Flag question

Question text
These are electronic circuits that operate on one or more input signals to produce an output
signal.

Select one:

a.
Logic gates

b.
Amplifier circuits

c.
RLC circuits

d.
Integrated circuits

Question 10
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Find the four-bit sum of 1011+0101
0000
Answer: 

Question 11
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Find the sum of 11001+(-11110).
11011
Answer: 

Question 12
Correct
Mark 1.00 out of 1.00

Flag question

Question text
What is the objective of abstraction?

Select one:

a.
Encrypting the data

b.
Hiding the complexity

c.
Hiding the source code

d.
Simplifying the circuit

Question 13
Correct
Mark 1.00 out of 1.00

Flag question

Question text
This is the graphic symbol of a 2-input XNOR gate.

Select one:

a.

b.
c.

d.

Feedback
Your answer is correct.

Question 14
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Evaluate the output F3�3 if A=1, B=0, C=1, and D=0. Refer to the figure below:

0
Answer:

Question 1
Correct
Mark 1.00 out of 1.00

Flag question

Question text
How many possible combinations of input values can we produce if we have 6 input
variables?
64
Answer:

Question 2
Correct
Mark 1.00 out of 1.00

Flag question

Question text
We use _______________ to find the decimal equivalent of a particular value expressed in a
different number system.

Select one:

a.
Scientific notation

b.
Interval notation

c.
Positional notation

d.
Set builder notation

Question 3
Correct
Mark 1.00 out of 1.00

Flag question

Question text
These are electronic circuits that operate on one or more input signals to produce an output
signal.

Select one:

a.
Integrated circuits

b.
Amplifier circuits

c.
Logic gates

d.
RLC circuits

Question 4
Incorrect
Mark 0.00 out of 1.00

Flag question

Question text
This logic operation outputs TRUE if either input, but not both, is true.

Select one:

a.
NOR

b.
NAND

c.
XOR

d.
OR
Feedback
Your answer is incorrect.

Question 5
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Evaluate the output F3�3 if A=1, B=0, C=1, and D=0. Refer to the figure below:
0
Answer:

Question 6
Correct
Mark 1.00 out of 1.00

Flag question

Question text
What is the equivalent of 34563456 in the decimal number system?

Select one:

a.
2341023410

b.
2331023310

c.
1361013610

d.
1371013710

Question 7
Correct
Mark 1.00 out of 1.00

Flag question

Question text
It deals with variables that take on two discrete values, and operations that assume logical
meaning.

Select one:

a.
Binary Logic

b.
Algebraic Function

c.
Symbolic Logic

d.
Propositional Calculus

Question 8
Correct
Mark 1.00 out of 1.00

Flag question

Question text
What is the equivalent of  10110.0101210110.01012 in hexadecimal number system?

Select one:

a.
16.51616.516

b.
22.51622.516

c.
18.241618.2416

d.
26.241626.2416

Question 9
Correct
Mark 1.00 out of 1.00
Flag question

Question text
Find the two’s complement of the binary number 11011010
00100110
Answer: 

Question 10
Correct
Mark 1.00 out of 1.00

Flag question

Question text
This is the graphic symbol of a buffer.

Select one:

a.

b.

c.

d.

Feedback
Your answer is correct.

Question 11
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Evaluate the output F3�3 if A=1, B=0, C=0, D=1. Refer to the figure below.

1
Answer:

Question 12
Correct
Mark 1.00 out of 1.00

Flag question

Question text
This is the representation of signed binary numbers that is easiest for humans to read.

Select one:

a.
Sign magnitude

b.
Two's complement

c.
One's complement

d.
Binary code
Feedback
Your answer is correct.

Question 13
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Evaluate the output F3�3 if A = 1, B = 1, C = 0, D = B

0
Answer:

Question 14
Correct
Mark 1.00 out of 1.00

Flag question

Question text
The component of the number system that represents the unit or quantity.

Select one:

a.
Base

b.
Position
c.
Digit

d.
Number
Feedback
Your answer is correct.

Question 15
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Express the decimal number 7935 in BCD.
NOTE: Do not put spaces between the digits of your answer.
0111100100110101
Answer:

Question 8
Incorrect
Mark 0.00 out of 1.00

Flag question

Question text
This logic operation outputs TRUE if either input, but not both, is true.
Select one:

a.
NOR

b.
NAND

c.
XOR

d.
OR
Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This is a term in a Boolean expression that is redundant and can be eliminated so that a
simpler expression can be obtained.

Select one:

a.

Minterm

b.

Maxterm

c.

Consensus term

d.

Complement term

Question 2
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The simplified form of the Boolean expression, ABC+A′B+ABC���+�′�+���' is
_____________.
Select one:

a.

b.

ABC

c.

d.

Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Question text
He is an English mathematician after whom Boolean algebra was named.

Select one:

a.

Gregory Boole

b.

George Boole
c.

Gregor Boole

d.

Gerard Boole

Question 4
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The simplified form of the Boolean expression, x(x′+y)�(�′+�) is __________.

Select one:

a.

x′�′

b.

xy��

c.

x′y�′�

d.

x�

Question 5
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which of the figures below best represents an equivalent two-level implementation of the
Boolean function y=(u⊕v)′+w�=(�⊕�)′+�?
Select one:

a.

b.
c.

d.

Feedback
Your answer is correct.

Question 6
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which figures represents an equivalent two-level implementation of F=xy+x′y′+y
′z�=��+�′�′+�′�?

Select one:
a.

b.
c.

None of these are correct

d.

Feedback
Your answer is correct.

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a Boolean term composed of one or more literals joined by the AND operation.

Select one:

a.

Product

b.

Identity
c.

Complement

d.

Sum

Question 8
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Convert the Boolean function described by F(x,y)=∑(1,2,3)�(�,�)=∑(1,2,3) to the other
canonical form.

Select one:

a.

F=x+y′�=�+�′

b.

F=xy+x′y′�=��+�′�′

c.

F=x+y�=�+�

d.

F=x′y+xy′�=�′�+��′
e.

F=x′+y′�=�′+�′

Question 9
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It states that every algebraic expression that we can logically construct from the postulates
of Boolean algebra are valid even when the operators and identity elements interchange.

Select one:

a.

Commutative Postulate

b.

Duality Principle

c.

Associative Theorem

d.

DeMorgan’s Theorem

Question 10
Correct

Mark 1.00 out of 1.00

Flag question
Question text
It is part of mathematics that deals with operations involving logical elements, variables and
operators, axioms and postulates.

Select one:

a.

Propositional Calculus

b.

Fuzzy Logic

c.

Boolean Algebra

d.

Symbolic Logic

Question 11
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a product term involving all inputs of the function.

Select one:

a.

POS
b.

Maxterm

c.

SOP

d.

Minterm

Question 12
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
What is the complement of xy′+x′y��′+�′�? Use parentheses when necessary.

xy+(x'y')
Answer: 

Question 13
Correct

Mark 1.00 out of 1.00

Flag question

Question text
How many Boolean functions can we construct with two input variables involved?
16
Answer: 

Question 14
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following best represents the sum of minterms form of the function f=bd′
+acd′+ab′c+a′c′�=��′+���′+��′�+�′�′?
Select one:

a.

f(a,b,c,d)=∑(1,4,5,6,8,10,11,12,14)�(�,�,�,�)=∑(1,4,5,6,8,10,11,12,14)

b.

f(a,b,c,d)=∑(0,2,3,4,6,11,12,14)�(�,�,�,�)=∑(0,2,3,4,6,11,12,14)

c.

f(a,b,c,d)=∑(0,1,4,5,6,10,11,12,14)�(�,�,�,�)=∑(0,1,4,5,6,10,11,12,14)

d.

f(a,b,c,d)=∑(1,2,3,4,6,10,11,12,13)�(�,�,�,�)=∑(1,2,3,4,6,10,11,12,13)

Question 15
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a sum term involving all inputs of the function.

Select one:

a.

POS
b.

Maxterm

c.

SOP

d.

Minterm

Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the figures below best represents an equivalent two-level implementation of the
Boolean function y=(u⊕v)′+w�=(�⊕�)′+�?
Select one:

a.

b.
c.

d.

Feedback
Your answer is correct.
The correct answer is: 

Question 2
Correct

Mark 1.00 out of 1.00

Flag question

Question text
How many terms and literals will there be if we simplified the Boolean expression x+y′+yz′
+xy′z′�+�′+��′+��′�′?
Select one:

a.

3 terms, 3 literals

b.

3 terms, 5 literals

c.

4 terms, 4 literals

d.

4 terms, 5 literals
Feedback
Your answer is correct.
The correct answer is: 3 terms, 3 literals

Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Question text
He is an English mathematician after whom Boolean algebra was named.

Select one:

a.

Gregory Boole

b.

Gerard Boole

c.

George Boole

d.

Gregor Boole

Feedback
The correct answer is: George Boole

Question 4
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a product term involving all inputs of the function.

Select one:

a.

SOP

b.

Maxterm

c.

POS

d.

Minterm

Feedback
The correct answer is: Minterm

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a Boolean function form composed of sum terms, each with different number of literals,
joined by AND operations.
Select one:

a.

Product of Sums form


b.

Sum of Products form

c.

Product of Maxterms form

d.

Sum of Minterms form


Feedback
Your answer is correct.

The correct answer is: Product of Sums form

Question 6
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is part of mathematics that deals with operations involving logical elements, variables and
operators, axioms and postulates.

Select one:

a.

Boolean Algebra

b.

Fuzzy Logic
c.

Propositional Calculus

d.

Symbolic Logic

Feedback
The correct answer is: Boolean Algebra

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
To which postulate would the DeMorgan theorems belong?
Select one:

a.

Identity

b.

Commutative

c.

Distributive

d.

Complement
Feedback
Your answer is correct.
The correct answer is: Complement

Question 8
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Which of the following is the Product of Sums (POS) equivalent of the function F=A′B+CD
′�=�′�+��′
Select one:

a.

F=(A′+C)(A′+D)(B+C)(B+D′)�=(�′+�)(�′+�)(�+�)(�+�′)

b.

F=(A+C′)(A+D′)(B′+C′)(B′+D)�=(�+�′)(�+�′)(�′+�′)(�′+�)

c.

F=(A+B′)(C′+D)�=(�+�′)(�′+�)

d.

F=(A′+B)(C+D′)�=(�′+�)(�+�′)
Feedback
Your answer is incorrect.

The correct answer is: F=(A′+C)(A′+D)(B+C)(B+D′)�=(�′+�)(�′+�)(�+�)(�+�′)

Question 9
Correct

Mark 1.00 out of 1.00

Flag question
Question text
The simplified form of the Boolean expression, ABC+A′B+ABC���+�′�+���' is
_____________.

Select one:

a.

b.

ABC

c.

d.

Feedback
The correct answer is: B

Question 10
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which figure represents an equivalent two-level implementation of F=xy+x′y′+y
′z�=��+�′�′+�′�?
Select one:

a.
b.

c.

None of the above.

d.
Feedback
Your answer is correct.

The correct answer is: 

Question 11
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following best represents the sum of minterms form of the function f=bd′
+acd′+ab′c+a′c′�=��′+���′+��′�+�′�′?
Select one:

a.
f(a,b,c,d)=∑(0,2,3,4,6,11,12,14)�(�,�,�,�)=∑(0,2,3,4,6,11,12,14)

b.

f(a,b,c,d)=∑(0,1,4,5,6,10,11,12,14)�(�,�,�,�)=∑(0,1,4,5,6,10,11,12,14)

c.

f(a,b,c,d)=∑(1,2,3,4,6,10,11,12,13)�(�,�,�,�)=∑(1,2,3,4,6,10,11,12,13)

d.

f(a,b,c,d)=∑(1,4,5,6,8,10,11,12,14)�(�,�,�,�)=∑(1,4,5,6,8,10,11,12,14)

Feedback
The correct answer
is: f(a,b,c,d)=∑(0,1,4,5,6,10,11,12,14)�(�,�,�,�)=∑(0,1,4,5,6,10,11,12,14)

Question 12
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a sum term involving all inputs of the function.

Select one:

a.

Minterm

b.

POS
c.

Maxterm

d.

SOP

Feedback
The correct answer is: Maxterm

Question 13
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Convert the Boolean function described by F(x,y)=∑(1,2,3)�(�,�)=∑(1,2,3) to the other
canonical form.

Select one:

a.

F=x+y′�=�+�′

b.

F=x′+y′�=�′+�′

c.

F=x+y�=�+�

d.
F=xy+x′y′�=��+�′�′

e.

F=x′y+xy′�=�′�+��′
Feedback
The correct answer is: F=x+y�=�+�

Question 14
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a Boolean function form composed of product terms, each with different number of
literals, joined by OR operations.
Select one:

a.

Product of Maxterms form

b.

Sum of Products form

c.

Product of Sums form

d.

Sum of Minterms form


Feedback
Your answer is correct.
The correct answer is: Sum of Products form

Question 15
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This is a term in a Boolean expression that is redundant and can be eliminated so that a
simpler expression can be obtained.

Select one:

a.

Complement term

b.

Maxterm

c.

Minterm

d.

Consensus term

Feedback
The correct answer is: Consensus term

Question 16
Incorrect

Mark 0.00 out of 1.00

Flag question
Question text
How many Boolean functions can we create if we have 4 variables?
NOTE: Do not put spaces or commas between the digits of your answer.
222
Answer:

Feedback
The correct answer is: 65536

Question 17
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The simplified form of the Boolean expression, x(x′+y)�(�′+�) is __________.

Select one:

a.

x′y�′�

b.

x�

c.

x′�′

d.

xy

Feedback
The correct answer is: \(xy\)
Question 18
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a Boolean term composed of one or more literals joined by the AND operation.

Select one:

a.

Product

b.

Sum

c.

Complement

d.

Identity

Feedback
The correct answer is: Product

Question 19
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Which is the consensus term in the Boolean expression, \( A'C'+BC'D+AD \)?
Select one:

a.

\( BC'D \)

b.

None of the above.

c.

\( A'C' \)

d.

\( AD \)
Feedback
Your answer is incorrect.

The correct answer is: \( BC'D \)

Question 20
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It states that every algebraic expression that we can logically construct from the postulates
of Boolean algebra are valid even when the operators and identity elements interchange.

Select one:

a.
DeMorgan’s Theorem

b.

Duality Principle

c.

Commutative Postulate

d.

Associative Theorem

Feedback
The correct answer is: Duality Principle

Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Find the sum of 11001+(-11110).

11011
Answer: 

Question 2
Correct

Mark 1.00 out of 1.00

Flag question
Question text
It is a sum term involving all inputs of the function.

Select one:

a.

Minterm

b.

Maxterm

c.

POS

d.

SOP

Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Question text
What is the objective of abstraction?

Select one:

a.

Encrypting the data


b.

Simplifying the circuit

c.

Hiding the complexity

d.

Hiding the source code

Question 4
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
What is the complement of xy′+x′y��′+�′�? Use parentheses when necessary.

(x + y) . (x’ + y’)
Answer: 

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The 8-bit sum of the signed numbers (-23) and (+11) in two’s complement form is _________.

Select one:

a.
1111 1101

b.

1111 1100

c.

1111 1000

d.

1111 0100

Question 6
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It states that every algebraic expression that we can logically construct from the postulates of Boolean
algebra are valid even when the operators and identity elements interchange.

Select one:

a.

Associative Theorem

b.

Commutative Postulate

c.
DeMorgan’s Theorem

d.

Duality Principle

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Find the four-bit sum of 1011+0101

0000
Answer: 

Question 8
Correct

Mark 1.00 out of 1.00

Flag question

Question text
We use _______________ to find the decimal equivalent of a particular value expressed in a different
number system.

Select one:

a.

Set builder notation

b.
Positional notation

c.

Interval notation

d.

Scientific notation

Question 9
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Evaluate the output F3�3 if A=0, B=1, C=0 and D=A

0
Answer:

Question 10
Correct

Mark 1.00 out of 1.00


Flag question

Question text
Find the two’s complement of the binary number 10001110
0111 0010
Answer:

Question 11
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Evaluate the output F3�3 if A = 1, B = 1, C = 0, D = B

0
Answer:

Question 12
Correct

Mark 1.00 out of 1.00


Flag question

Question text
Which figures represents an equivalent two-level implementation of F=xy+x′y′+y′z�=��+�′�′
+�′�?
Select one:

a.

b.
c.

d.

None of these are correct


Feedback
Your answer is correct.

Question 13
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a Boolean term composed of one or more literals joined by the AND operation.

Select one:

a.

Sum

b.

Complement
c.

Product

d.

Identity

Question 14
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Use the complement and DeMorgan’s theorems to express the Boolean function, F=xy+x' y'+y'z, with OR
and NOT operations.

yx'+xy'z'
Answer: 

Question 15
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This is a term in a Boolean expression that is redundant and can be eliminated so that a simpler
expression can be obtained.

Select one:

a.

Minterm
b.

Consensus term

c.

Complement term

d.

Maxterm

Question 16
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following is a self-complementing binary code?

Select one:

a.

2421

b.

Gray Code

c.

ASCII Code
d.

BCD

Question 17
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
The output of (x+y′)′+(xz)(�+�′)′+(��) if x=0;y=1 and z=1 is:

Select one:

a.

b.

None of the above

c.

d.

1 and 0

Question 18
Correct

Mark 1.00 out of 1.00


Flag question

Question text
Finding the complements of numbers simplifies which operation in digital systems?

Select one:

a.

Subtraction

b.

Addition

c.

Multiplication

d.

Division

Question 19
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is part of mathematics that deals with operations involving logical elements, variables and operators,
axioms and postulates.

Select one:
a.

Fuzzy Logic

b.

Symbolic Logic

c.

Boolean Algebra

d.

Propositional Calculus

Question 20
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Use the complement and DeMorgan’s theorems to express the Boolean function F=xy+x' y'+y'z with
NAND and NOT operations.

yx'+xy'z'
Answer: 

Question 21
Correct

Mark 1.00 out of 1.00

Flag question
Question text
This operator is typically represented by the absence of an operator.

Select one:

a.

AND operator

b.

NOT operator

c.

OR operator

d.

NOR operator

Question 22
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Simplify the Boolean expression, xy'+y' z'+x'z' to a minimum number of literals.

Select one:

a.

xy′+x′z′��′+�′�′
b.

x+y′�+�′

c.

y′z′+x′z′�′�′+�′�′

d.

x′+y′�′+�′

Question 23
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the figures below best represents an equivalent two-level implementation of the
Boolean function y=(u⊕v)′+w�=(�⊕�)′+�?
Select one:

a.

b.
c.

d.

Feedback
Your answer is correct.

Question 24
Correct

Mark 1.00 out of 1.00


Flag question

Question text
Which of the following best represents the sum of minterms form of the function f=bd′+acd′+ab
′c+a′c′�=��′+���′+��′�+�′�′?

Select one:

a.

f(a,b,c,d) = ∑(0,1,4,5,6,10,11,12,14)

b.

f(a,b,c,d) = ∑(1,4,5,6,8,10,11,12,14)

c.

f(a,b,c,d) = ∑(0,2,3,4,6,11,12,14)

d.

f(a,b,c,d) = ∑(1,2,3,4,6,10,11,12,13)

Question 25
Correct

Mark 1.00 out of 1.00

Flag question

Question text
He is an English mathematician after whom Boolean algebra was named.

Select one:
a.

Gregor Boole

b.

George Boole

c.

Gerard Boole

d.

Gregory Boole

Question 26
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Binary logic consists of binary variables and a set of ____________________.

Select one:

a.

Logical operators

b.

Mathematical operators
c.

Logical symbols

d.

Algebraic functions

Question 27
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a product term involving all inputs of the function.

Select one:

a.

Minterm

b.

SOP

c.

Maxterm

d.

POS
Question 28
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This is the graphic symbol of a 2-input NAND Gate
Select one:

a.

b.

c.

d.

Feedback
Your answer is correct.
Question 29
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which Boolean function best describes the logic diagram below?

Select one:

a.

y=(a(bcd)e′)′�=(�(���)�′)′

b.

y=(a(bcd)′e)′�=(�(���)′�)′

c.

y=(abc′de′)′�=(���′��′)′

d.

y=((a(bcd)′e)′)′�=((�(���)′�)′)′
Feedback
Your answer is correct.

Question 30
Correct
Mark 1.00 out of 1.00

Flag question

Question text
It deals with variables that take on two discrete values, and operations that assume logical meaning.

Select one:

a.

Symbolic Logic

b.

Binary Logic

c.

Propositional Calculus

d.

Algebraic Function

Question 31
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The simplified form of the Boolean expression, ABC+A′���+�′ B+ABC′�+���′ is
_____________.
Select one:

a.

ABC

b.

c.

d.

Question 32
Correct

Mark 1.00 out of 1.00

Flag question

Question text
How many Boolean functions can we construct with two input variables involved?

16
Answer: 

Question 33
Correct

Mark 1.00 out of 1.00


Flag question

Question text
Convert 4021.254021.25 to decimal. The answer is _________________.

Select one:

a.

515.610515.610

b.

822.610822.610

c.

192.710192.710

d.

511.410511.410

Question 34
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a system that manipulates discrete elements of information represented internally in binary form.

Select one:
a.

Information System

b.

Electronic System

c.

Digital System

d.

Binary System

Question 35
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Convert the Boolean function described by F(x,y)=∑(1,2,3) to the other canonical form.

Select one:

a.

F = xy+x'y'

b.

F = x'y+xy'
c.

F = x+y

d.

F = x+y'

Question 36
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Reduce the Boolean expression, A'B(D'+C'D)+B(A+A'CD), to one literal.

Select one:

a.

b.

c.

d.

D
Question 37
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The ______ of a number system gives the number of symbols used in a system; it is always expressed in
decimal numbers and is indicated by a subscript.

Select one:

a.

None of the above

b.

Name

c.

Unit

d.

Radix

Question 38
Correct

Mark 1.00 out of 1.00

Flag question
Question text
These are electronic circuits that operate on one or more input signals to produce an output signal.

Select one:

a.

Programmer circuits

b.

Memory circuits

c.

Logic gates

d.

Processor

Question 39
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The simplified form of the Boolean expression, x(x′+y)�(�′+�) is __________.

Select one:

a.

x'y
b.

xy

c.

d.

x'

Question 40
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This is the graphic symbol of a 2-input XNOR gate.

Select one:

a.

b.

c.
d.

Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the figures below best represents an equivalent two-level implementation of the
Boolean function y=(u⊕v)′+w�=(�⊕�)′+�?
Select one:

a.

b.
c.

d.

Feedback
Your answer is correct.

Question 2
Correct

Mark 1.00 out of 1.00


Flag question

Question text
We use _______________ to find the decimal equivalent of a particular value expressed in a
different number system.

Select one:

a.

Scientific notation

b.

Set builder notation

c.

Interval notation

d.

Positional notation

Question 3
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
The output of (x+y′)′+(xz)(�+�′)′+(��) if x=0;y=1 and z=1 is:
Select one:

a.

None of the above

b.

c.

d.

1 and 0

Question 4
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It deals with variables that take on two discrete values, and operations that assume logical
meaning.

Select one:

a.

Algebraic Function
b.

Binary Logic

c.

Propositional Calculus

d.

Symbolic Logic

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a Boolean term composed of one or more literals joined by the AND operation.

Select one:

a.

Product

b.

Identity

c.

Sum
d.

Complement

Question 6
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
What is the complement of xy′+x′y��′+�′�? Use parentheses when necessary.

xy+( x' y' )


Answer: 

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Find the four-bit sum of 1011+0101
0000
Answer: 

Question 8
Correct

Mark 1.00 out of 1.00

Flag question
Question text
It states that every algebraic expression that we can logically construct from the postulates
of Boolean algebra are valid even when the operators and identity elements interchange.

Select one:

a.

Associative Theorem

b.

Commutative Postulate

c.

Duality Principle

d.

DeMorgan’s Theorem

Question 9
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
The 8-bit sum of the signed numbers (-23) and (+11) in two’s complement form is _________.

Select one:

a.
1111 1000

b.

1111 1100

c.

1111 1101

d.

1111 0100

Question 10
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Use the complement and DeMorgan’s theorems to express the Boolean function, F=xy+x'
y'+y'z, with OR and NOT operations.
xy+z
Answer: 

Question 11
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which figures represents an equivalent two-level implementation of F=xy+x′y′+y
′z�=��+�′�′+�′�?

Select one:

a.

b.

c.
d.

None of these are correct


Feedback
Your answer is correct.

Question 12
Correct

Mark 1.00 out of 1.00

Flag question

Question text
How many Boolean functions can we construct with two input variables involved?
16
Answer: 

Question 13
Correct

Mark 1.00 out of 1.00

Flag question
Question text
These are electronic circuits that operate on one or more input signals to produce an output
signal.

Select one:

a.

Processor

b.

Memory circuits

c.

Programmer circuits

d.

Logic gates

Question 14
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a product term involving all inputs of the function.

Select one:

a.
Maxterm

b.

SOP

c.

POS

d.

Minterm

Question 15
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Find the sum of 11001+(-11110).
11011
Answer: 

Question 16
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This operator is typically represented by the absence of an operator.
Select one:

a.

OR operator

b.

NOT operator

c.

AND operator

d.

NOR operator

Question 17
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a system that manipulates discrete elements of information represented internally in
binary form.

Select one:

a.

Digital System
b.

Electronic System

c.

Binary System

d.

Information System

Question 18
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Find the two’s complement of the binary number 10001110
00100110
Answer:

Question 19
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This is the graphic symbol of a 2-input NAND Gate
Select one:
a.

b.

c.

d.

Feedback
Your answer is correct.

Question 20
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following best represents the sum of minterms form of the function f=bd′
+acd′+ab′c+a′c′�=��′+���′+��′�+�′�′?
Select one:

a.

f(a,b,c,d) = ∑(1,4,5,6,8,10,11,12,14)

b.

f(a,b,c,d) = ∑(0,2,3,4,6,11,12,14)

c.

f(a,b,c,d) = ∑(1,2,3,4,6,10,11,12,13)

d.

f(a,b,c,d) = ∑(0,1,4,5,6,10,11,12,14)

Question 21
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Reduce the Boolean expression, A'B(D'+C'D)+B(A+A'CD), to one literal.

Select one:

a.

B
b.

c.

d.

Question 22
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The simplified form of the Boolean expression, ABC+A′���+�′ B+ABC′�+���′ is
_____________.

Select one:

a.

b.

ABC

c.

B
d.

Question 23
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Convert 4021.254021.25 to decimal. The answer is _________________.

Select one:

a.

822.610822.610

b.

192.710192.710

c.

515.610515.610

d.

511.410511.410

Question 24
Correct

Mark 1.00 out of 1.00


Flag question

Question text
Which Boolean function best describes the logic diagram below?

Select one:

a.

y=(a(bcd)e′)′�=(�(���)�′)′

b.

y=((a(bcd)′e)′)′�=((�(���)′�)′)′

c.

y=(abc′de′)′�=(���′��′)′

d.

y=(a(bcd)′e)′�=(�(���)′�)′
Feedback
Your answer is correct.

Question 25
Correct

Mark 1.00 out of 1.00


Flag question

Question text
It is part of mathematics that deals with operations involving logical elements, variables and
operators, axioms and postulates.

Select one:

a.

Fuzzy Logic

b.

Propositional Calculus

c.

Symbolic Logic

d.

Boolean Algebra

Question 26
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Binary logic consists of binary variables and a set of ____________________.
Select one:

a.

Logical operators

b.

Mathematical operators

c.

Logical symbols

d.

Algebraic functions

Question 27
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Use the complement and DeMorgan’s theorems to express the Boolean function F=xy+x'
y'+y'z with NAND and NOT operations.
xy+y'
Answer: 

Question 28
Correct

Mark 1.00 out of 1.00


Flag question

Question text
He is an English mathematician after whom Boolean algebra was named.

Select one:

a.

Gregory Boole

b.

Gerard Boole

c.

George Boole

d.

Gregor Boole

Question 29
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Convert the Boolean function described by F(x,y)=∑(1,2,3) to the other canonical form.
Select one:

a.

F = x+y'

b.

F = x'y+xy'

c.

F = xy+x'y'

d.

F = x+y

Question 30
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Evaluate the output F3�3 if A = 1, B = 1, C = 0, D = B

0
Answer:

Question 31
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following is a self-complementing binary code?

Select one:

a.

BCD

b.

ASCII Code
c.

Gray Code

d.

2421

Question 32
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Finding the complements of numbers simplifies which operation in digital systems?

Select one:

a.

Division

b.

Subtraction

c.

Multiplication

d.
Addition

Question 33
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This is a term in a Boolean expression that is redundant and can be eliminated so that a
simpler expression can be obtained.

Select one:

a.

Complement term

b.

Maxterm

c.

Minterm

d.

Consensus term

Question 34
Correct

Mark 1.00 out of 1.00


Flag question

Question text
This is the graphic symbol of a 2-input XNOR gate.

Select one:

a.

b.

c.

d.

Feedback
Your answer is correct.

Question 35
Correct

Mark 1.00 out of 1.00


Flag question

Question text
The ______ of a number system gives the number of symbols used in a system; it is always
expressed in decimal numbers and is indicated by a subscript.

Select one:

a.

Name

b.

None of the above

c.

Radix

d.

Unit

Question 36
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The simplified form of the Boolean expression, x(x′+y)�(�′+�) is __________.
Select one:

a.

b.

x'

c.

x'y

d.

xy

Question 37
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a sum term involving all inputs of the function.

Select one:

a.

POS
b.

SOP

c.

Minterm

d.

Maxterm

Question 38
Correct

Mark 1.00 out of 1.00

Flag question

Question text
What is the objective of abstraction?

Select one:

a.

Simplifying the circuit

b.

Hiding the source code

c.

Hiding the complexity


d.

Encrypting the data

Question 39
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Evaluate the output F3�3 if A=0, B=1, C=0 and D=A

1
Answer:

Question 40
Incorrect

Mark 0.00 out of 1.00

Flag question
Question text
Simplify the Boolean expression, xy'+y' z'+x'z' to a minimum number of literals.

Select one:

a.

x+y′�+�′

b.

y′z′+x′z′�′�′+�′�′

c.

xy′+x′z′��′+�′�′

d.

x′+y′

Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which figures represents an equivalent two-level implementation of F=xy+x′y′+y
′z�=��+�′�′+�′�?

Select one:

a.
b.

c.
d.

None of these are correct


Feedback
Your answer is correct.

Question 2
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The ______ of a number system gives the number of symbols used in a system; it is always
expressed in decimal numbers and is indicated by a subscript.

Select one:

a.

None of the above

b.

Unit

c.

Name

d.

Radix
Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Finding the complements of numbers simplifies which operation in digital systems?

Select one:

a.

Subtraction

b.

Division

c.

Addition

d.

Multiplication

Question 4
Correct

Mark 1.00 out of 1.00

Flag question
Question text
It is part of mathematics that deals with operations involving logical elements, variables and
operators, axioms and postulates.

Select one:

a.

Boolean Algebra

b.

Fuzzy Logic

c.

Symbolic Logic

d.

Propositional Calculus

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Find the four-bit sum of 1011+0101
0000
Answer: 

Question 6
Correct
Mark 1.00 out of 1.00

Flag question

Question text
What is the objective of abstraction?

Select one:

a.

Simplifying the circuit

b.

Hiding the source code

c.

Hiding the complexity

d.

Encrypting the data

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This is a term in a Boolean expression that is redundant and can be eliminated so that a
simpler expression can be obtained.

Select one:

a.

Consensus term

b.

Maxterm

c.

Minterm

d.

Complement term

Question 8
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a system that manipulates discrete elements of information represented internally in
binary form.

Select one:

a.
Binary System

b.

Digital System

c.

Information System

d.

Electronic System

Question 9
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Evaluate the output F3�3 if A=0, B=1, C=0 and D=A
0
Answer:

Question 10
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This is the graphic symbol of a 2-input NAND Gate
Select one:

a.

b.

c.

d.
Feedback
Your answer is correct.

Question 11
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It deals with variables that take on two discrete values, and operations that assume logical
meaning.

Select one:

a.

Symbolic Logic

b.

Algebraic Function

c.

Propositional Calculus

d.

Binary Logic

Question 12
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which of the following is a self-complementing binary code?

Select one:

a.

ASCII Code

b.

2421

c.

BCD

d.

Gray Code

Question 13
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This is the graphic symbol of a 2-input XNOR gate.
Select one:

a.

b.

c.

d.

Feedback
Your answer is correct.

Question 14
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Evaluate the output F3�3 if A = 1, B = 1, C = 0, D = B

0
Answer:

Question 15
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The simplified form of the Boolean expression, x(x′+y)�(�′+�) is __________.

Select one:

a.

xy

b.

x'
c.

d.

x'y

Question 16
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Convert 4021.254021.25 to decimal. The answer is _________________.

Select one:

a.

515.610515.610

b.

822.610822.610

c.

192.710192.710

d.
511.410511.410

Question 17
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The 8-bit sum of the signed numbers (-23) and (+11) in two’s complement form is _________.

Select one:

a.

1111 1101

b.

1111 1100

c.

1111 1000

d.

1111 0100

Question 18
Correct

Mark 1.00 out of 1.00


Flag question

Question text
Find the two’s complement of the binary number 10001110
0111 0010
Answer:

Question 19
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a sum term involving all inputs of the function.

Select one:

a.

Maxterm

b.

SOP

c.

Minterm

d.
POS

Question 20
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This operator is typically represented by the absence of an operator.

Select one:

a.

OR operator

b.

AND operator

c.

NOT operator

d.

NOR operator

Question 21
Correct

Mark 1.00 out of 1.00


Flag question

Question text
Simplify the Boolean expression, xy'+y' z'+x'z' to a minimum number of literals.

Select one:

a.

x+y′�+�′

b.

xy′+x′z′��′+�′�′

c.

x′+y′�′+�′

d.

y′z′+x′z′�′�′+�′�′

Question 22
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following best represents the sum of minterms form of the function f=bd′
+acd′+ab′c+a′c′�=��′+���′+��′�+�′�′?
Select one:

a.

f(a,b,c,d) = ∑(1,2,3,4,6,10,11,12,13)

b.

f(a,b,c,d) = ∑(0,1,4,5,6,10,11,12,14)

c.

f(a,b,c,d) = ∑(1,4,5,6,8,10,11,12,14)

d.

f(a,b,c,d) = ∑(0,2,3,4,6,11,12,14)

Question 23
Correct

Mark 1.00 out of 1.00

Flag question

Question text
We use _______________ to find the decimal equivalent of a particular value expressed in a
different number system.

Select one:

a.

Set builder notation


b.

Positional notation

c.

Scientific notation

d.

Interval notation

Question 24
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Use the complement and DeMorgan’s theorems to express the Boolean function, F=xy+x'
y'+y'z, with OR and NOT operations.
y x'+ x y' z'
Answer: 

Question 25
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Binary logic consists of binary variables and a set of ____________________.

Select one:
a.

Mathematical operators

b.

Algebraic functions

c.

Logical operators

d.

Logical symbols

Question 26
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a product term involving all inputs of the function.

Select one:

a.

Minterm

b.
SOP

c.

POS

d.

Maxterm

Question 27
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
What is the complement of xy′+x′y��′+�′�? Use parentheses when necessary.

(x + y) (x’ + y’)
Answer: 

Question 28
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Use the complement and DeMorgan’s theorems to express the Boolean function F=xy+x'
y'+y'z with NAND and NOT operations.
y x'+ x y' z'
Answer: 

Question 29
Correct

Mark 1.00 out of 1.00

Flag question

Question text
He is an English mathematician after whom Boolean algebra was named.

Select one:

a.

Gregor Boole

b.

Gerard Boole

c.

George Boole

d.

Gregory Boole

Question 30
Correct

Mark 1.00 out of 1.00

Flag question
Question text
Which Boolean function best describes the logic diagram below?

Select one:

a.

y=((a(bcd)′e)′)′�=((�(���)′�)′)′

b.

y=(a(bcd)′e)′�=(�(���)′�)′

c.

y=(a(bcd)e′)′�=(�(���)�′)′

d.

y=(abc′de′)′�=(���′��′)′
Feedback
Your answer is correct.

Question 31
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Which of the figures below best represents an equivalent two-level implementation of the
Boolean function y=(u⊕v)′+w�=(�⊕�)′+�?
Select one:

a.

b.

c.
d.

Feedback
Your answer is incorrect.

Question 32
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Find the sum of 11001+(-11110).
11011
Answer: 

Question 33
Correct

Mark 1.00 out of 1.00

Flag question

Question text
How many Boolean functions can we construct with two input variables involved?
16
Answer: 

Question 34
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The output of (x+y′)′+(xz)(�+�′)′+(��) if x=0;y=1 and z=1 is:

Select one:

a.

None of the above

b.

c.

1 and 0

d.

Question 35
Correct

Mark 1.00 out of 1.00


Flag question

Question text
It states that every algebraic expression that we can logically construct from the postulates
of Boolean algebra are valid even when the operators and identity elements interchange.

Select one:

a.

Duality Principle

b.

Associative Theorem

c.

Commutative Postulate

d.

DeMorgan’s Theorem

Question 36
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Convert the Boolean function described by F(x,y)=∑(1,2,3) to the other canonical form.
Select one:

a.

F = x+y

b.

F = x'y+xy'

c.

F = xy+x'y'

d.

F = x+y'

Question 37
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a Boolean term composed of one or more literals joined by the AND operation.

Select one:

a.

Sum
b.

Identity

c.

Complement

d.

Product

Question 38
Correct

Mark 1.00 out of 1.00

Flag question

Question text
These are electronic circuits that operate on one or more input signals to produce an output
signal.

Select one:

a.

Logic gates

b.

Programmer circuits

c.

Memory circuits
d.

Processor

Question 39
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The simplified form of the Boolean expression, ABC+A′���+�′ B+ABC′�+���′ is
_____________.

Select one:

a.

b.

ABC

c.

d.

Question 40
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Reduce the Boolean expression, A'B(D'+C'D)+B(A+A'CD), to one literal.

Select one:

a.

b.

c.

d.

Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following is not an equivalent expression of the Boolean
function F(A,B,C,D)=Σ(2,4,10,12,14)�(�,�,�,�)=Σ(2,4,10,12,14)
Select one:
a.

F=D+A′BC�=�+�′��

b.

F′=(A′+D)(B+D)(C+D)�′=(�′+�)(�+�)(�+�)

c.

F=D′(A+B′+C′)�=�′(�+�′+�′)

d.

F=B′D′+C′D′+AD′�=�′�′+�′�′+��′
Feedback
Your answer is correct.

Question 2
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Which of the following is the simplified Sum of Products equivalent of the Boolean
function F(w,x,y,z)=Π(1,3,5,7,13,15)�(�,�,�,�)=Π(1,3,5,7,13,15)?
Select one:

a.

F=wy′+xz�=��′+��

b.

F=z′+wx′�=�′+��′
c.

F=w′z′+xz′�=�′�′+��′

d.

F=wz′+x′z′�=��′+�′�′
Feedback
Your answer is incorrect.

Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a logic circuit composed of logic gates and storage elements. Its output is a function of
the inputs and the state of the storage elements.
Select one:

a.

Serial logic circuit

b.

Combinational logic circuit

c.

Parallel logic circuit

d.

Sequential logic circuit


Feedback
Your answer is correct.
Question 4
Correct

Mark 1.00 out of 1.00

Flag question

Question text
TRUE OR FALSE: When adding negative numbers in two's complement system, signed
overflow occurs when there is a carry into and a carry out of the sign bit.

Select one:

True

False 

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Why would you build a BCD-to-binary converter circuit?
Select one:

a.

Different parts of the system may use different binary codes.

b.

None of the above.

c.

The converter will translate all binary numbers into BCD.


d.

Only humans can comprehend BCD.

Feedback
Your answer is correct.

Question 6
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Give the simplified Boolean expression for the outputs of the combinational circuit
described as follows:
The combinational circuit has three inputs (x,y,z)(�,�,�) and three outputs (A,B,C)
(�,�,�). When the binary input is 0, 1, 2 or 3, the binary output is one greater than the
input. For example, if x=0,y=1,z=1�=0,�=1,�=1, the output
is A=1,B=0,C=0�=1,�=0,�=0.
When the binary input is 4, 5, 6, or 7, the binary output is two less than the input. For
example, if the binary input is x=1,y=0,z=0�=1,�=0,�=0, the output
is A=0,B=1,C=0�=0,�=1,�=0.
y(x+z)
A = Answer 1  

xz+x'z'
C = Answer 2  

(x+z)y'+(x+z)'y
B = Answer 3  

Feedback
Your answer is correct.

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
These are combinational circuits that perform the addition of three bits.
full adder
Answer: 
Question 8
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This occurs only when adding numbers in two's complement system that have the same
sign, and whose result appears to be in the opposite sign.
Select one:

a.

Signed overflow

b.

Unsigned overflow

c.

Carry flag = 0

d.

Sign flag = 1
Feedback
Your answer is correct.

Question 9
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a product term obtained by combining the maximum possible number of adjacent
squares.
Select one:

a.

Prime implicant

b.

Essential prime implicant

c.

Implicant

d.

Minterm
Feedback
Your answer is correct.

Question 10
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Obtain the simplified Boolean expression for the output G� in terms of the input variables
in the circuit shown below. Give the expression only (no need to include G=�=), and do
not put spaces between the variables and operators.
A'D'+ABC
Answer: 

Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a combinational circuit that performs addition of two bits.
Select one:

a.

Full adder

b.

BCD Adder

c.
Half-adder

d.

Adder-subtractor
Feedback
Your answer is correct.

Question 2
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
The following are equivalent functions
of F(A,B,C,D)=Σ(0,6,8,13,14)�(�,�,�,�)=Σ(0,6,8,13,14) with don't-care
conditions d(A,B,C,D)=Σ(2,4,10)�(�,�,�,�)=Σ(2,4,10), except one.

Select one:

a.

F=B′D′+CD′+A′D′+ABC′D�=�′�′+��′+�′�′+���′�

b.

F=D⊕ABC′�=�⊕���′

c.

F=(B+D)′+(C′+D)′+(A+D)′+(A′+B′+C+D′)′�=(�+�)′+(�′+�)′+(�+�)′+(�′+�′
+�+�′)′

d.

F=(D⊕ABC′)′�=(�⊕���′)′
Feedback
Your answer is incorrect.

Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Simplify the function F=wx′+y′z′+w′yz′�=��′+�′�′+�′��′ and express the simplified
function with OR operations.
Select one:

a.

F=(w′+x)′+(y+z)′+(w+z)′�=(�′+�)′+(�+�)′+(�+�)′

b.

F=(w+x′)+(y′+z′)+(y+z′)�=(�+�′)+(�′+�′)+(�+�′)

c.

F=(w′+x)+(y+z)+(w+z)�=(�′+�)+(�+�)+(�+�)

d.

F=(w+x′)′+(y′+z′)′+(y+z′)′�=(�+�′)′+(�′+�′)′+(�+�′)′
Feedback
Your answer is correct.

Question 4
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Which of the following best corresponds to the simplified Boolean
function F(a,b,c,d)=Π(1,3,5,7,13,15)�(�,�,�,�)=Π(1,3,5,7,13,15)?
Select one:

a.

F=ac+b′d�=��+�′�

b.

F=(a+d′)(b′+d′)�=(�+�′)(�′+�′)

c.

F=(a+c′)(b+d′)�=(�+�′)(�+�′)

d.

F=ad′+bd′�=��′+��′
Feedback
Your answer is incorrect.

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Question text
In a four-variable K-Map, how many adjacent squares will produce a product term with 2
literals?
4
Answer:

Question 6
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The following are steps involved in designing combinational circuits, except one:
Select one:

a.

Derive the truth table.

b.

Draw the diagram.

c.

Label the inputs and outputs with arbitrary symbols.

d.

Obtain the simplified Boolean functions of the output in terms of the input.
Feedback
Your answer is correct.

Question 7
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Simplify the Boolean
function F(w,x,y,z)=Σ(2,4,7,10,12)�(�,�,�,�)=Σ(2,4,7,10,12) together with its don't-
care conditions d(w,x,y,z)=Σ(0,6,8)�(�,�,�,�)=Σ(0,6,8) and express the simplified
function in SOP form. Do not include spaces between characters. Write only the equation.
Do not include F=�=.
(w ,x,y,z)
Answer: 

Question 8
Correct

Mark 1.00 out of 1.00


Flag question

Question text
It is a digital circuit that produces the arithmetic sum of n�-bit binary numbers.
Select one:

a.

Half-adder

b.

BCD adder

c.

Full adder

d.

Binary adder
Feedback
Your answer is correct.

Question 9
Correct

Mark 1.00 out of 1.00

Flag question

Question text
TRUE OR FALSE: The number of adjacent squares that can be combined in a K-map must be
a multiple of 2.
Select one:

True

False 
Question 10
Correct

Mark 1.00 out of 1.00

Flag question

Question text
We combine adjacent squares of the K-map that contain zeros to obtain which simplified
form of Boolean function?
Product of sums
Answer: 

Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text
In a four-variable K-Map, how many adjacent squares will produce a product term with 2
literals?
4
Answer:

Question 2
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Obtain the simplified Boolean expression for the output F� in terms of the input variables
in the circuit shown below. Give the expression only (no need to include F=�=), and do not
put spaces between the variables and operators.
0
Answer: 

Question 3
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Why would you build a BCD-to-binary converter circuit?
Select one:

a.

Different parts of the system may use different binary codes.

b.

None of the above.

c.

Only humans can comprehend BCD.


d.

The converter will translate all binary numbers into BCD.


Feedback
Your answer is incorrect.

Question 4
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
TRUE OR FALSE: The number of adjacent squares that can be combined in a K-map must be
a multiple of 2.
Select one:

True 

False

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a logic circuit consisting of gates whose outputs at any time are a function of the
combination of inputs.
Select one:

a.

Parallel logic circuit

b.
Serial logic circuit

c.

Combinational logic circuit

d.

Sequential logic circuit


Feedback
Your answer is correct.

Question 6
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a table or diagram made up of squares which provides a simple way to minimize
Boolean functions.
Karnaugh map
Answer: 

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following best corresponds to a circuit diagram of a 1:2 demultiplexer? The
demultiplexer accepts one input (IN) and passes this to one of the two outputs (A or B),
depending on the selection (SEL) bit. The truth table is shown below:
Demultiplexer Truth Table
Input Input Output Output
(IN) (SEL) A B

0 0 0 0
0 1 0 0
1 0 1 0
1 1 0 1

Select one:

a.

b.

c.
d.

Feedback
Your answer is correct.

Question 8
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a product term obtained by combining the maximum possible number of adjacent
squares.
Select one:

a.

Minterm

b.
Essential prime implicant

c.

Prime implicant

d.

Implicant
Feedback
Your answer is correct.

Question 9
Correct

Mark 1.00 out of 1.00

Flag question

Question text
TRUE OR FALSE: When adding positive numbers in two's complement system, there is no
signed overflow when neither a carry into nor a carry out of the sign bit occurs.
Select one:

True 

False

Question 10
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Obtain the simplified Boolean expression for the output G� in terms of the input variables
in the circuit shown below. Give the expression only (no need to include G=�=), and do
not put spaces between the variables and operators.
1
Answer: 

Question 1
Correct

Mark 1.00 out of 1.00

Flag question

Question text
TRUE OR FALSE: When adding positive numbers in two's complement system, there is no
signed overflow when neither a carry into nor a carry out of the sign bit occurs.
Select one:

True 

False

Question 2
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a logic circuit composed of logic gates and storage elements. Its output is a function of
the inputs and the state of the storage elements.
Select one:

a.

Parallel logic circuit

b.

Sequential logic circuit

c.

Combinational logic circuit

d.

Serial logic circuit


Feedback
Your answer is correct.

Question 3
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Which of the following best corresponds to the simplified Boolean
function F(a,b,c,d)=Π(1,3,5,7,13,15)�(�,�,�,�)=Π(1,3,5,7,13,15)?
Select one:

a.

F=(a+d′)(b′+d′)�=(�+�′)(�′+�′)
b.

F=ad′+bd′�=��′+��′

c.

F=ac+b′d�=��+�′�

d.

F=(a+c′)(b+d′)�=(�+�′)(�+�′)
Feedback
Your answer is incorrect.

Question 4
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Which of the following is not an equivalent expression of the Boolean
function F(A,B,C,D)=Σ(2,4,10,12,14)�(�,�,�,�)=Σ(2,4,10,12,14)
Select one:

a.

F=D′(A+B′+C′)�=�′(�+�′+�′)

b.

F′=(A′+D)(B+D)(C+D)�′=(�′+�)(�+�)(�+�)

c.

F=D+A′BC�=�+�′��

d.
F=B′D′+C′D′+AD′�=�′�′+�′�′+��′
Feedback
Your answer is incorrect.

Question 5
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
The following are equivalent functions
of F(A,B,C,D)=Σ(0,6,8,13,14)�(�,�,�,�)=Σ(0,6,8,13,14) with don't-care
conditions d(A,B,C,D)=Σ(2,4,10)�(�,�,�,�)=Σ(2,4,10), except one.

Select one:

a.

F=D⊕ABC′�=�⊕���′

b.

F=B′D′+CD′+A′D′+ABC′D�=�′�′+��′+�′�′+���′�

c.

F=(D⊕ABC′)′�=(�⊕���′)′

d.

F=(B+D)′+(C′+D)′+(A+D)′+(A′+B′+C+D′)′�=(�+�)′+(�′+�)′+(�+�)′+(�′+�′
+�+�′)′
Feedback
Your answer is incorrect.

Question 6
Incorrect

Mark 0.00 out of 1.00


Flag question

Question text
We combine adjacent squares of the K-map that contain zeros to obtain which simplified
form of Boolean function?
Product of sum
Answer: 

Question 7
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Simplify the function F=wx′+y′z′+w′yz′�=��′+�′�′+�′��′ and express the simplified
function with OR operations.
Select one:

a.

F=(w′+x)+(y+z)+(w+z)�=(�′+�)+(�+�)+(�+�)

b.

F=(w+x′)+(y′+z′)+(y+z′)�=(�+�′)+(�′+�′)+(�+�′)

c.

F=(w′+x)′+(y+z)′+(w+z)′�=(�′+�)′+(�+�)′+(�+�)′

d.

F=(w+x′)′+(y′+z′)′+(y+z′)′�=(�+�′)′+(�′+�′)′+(�+�′)′
Feedback
Your answer is incorrect.

Question 8
Incorrect

Mark 0.00 out of 1.00


Flag question

Question text
Give the simplified Boolean expression for the outputs of the combinational circuit
described as follows:
The combinational circuit has three inputs (x,y,z)(�,�,�) and three outputs (A,B,C)
(�,�,�). When the binary input is 0, 1, 2 or 3, the binary output is one greater than the
input. For example, if x=0,y=1,z=1�=0,�=1,�=1, the output
is A=1,B=0,C=0�=1,�=0,�=0.
When the binary input is 4, 5, 6, or 7, the binary output is two less than the input. For
example, if the binary input is x=1,y=0,z=0�=1,�=0,�=0, the output
is A=0,B=1,C=0�=0,�=1,�=0.
y(x+z)
B = Answer 1  

yz+xy'z
C = Answer 2  

xy'+y'z+x'yz
A = Answer 3  

Feedback
Your answer is incorrect.

Question 9
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
TRUE OR FALSE: When adding negative numbers in two's complement system, signed
overflow occurs when there is a carry into and a carry out of the sign bit.

Select one:

True 

False

Question 10
Incorrect

Mark 0.00 out of 1.00


Flag question

Question text
Simplify the Boolean
function F(w,x,y,z)=Σ(2,4,7,10,12)�(�,�,�,�)=Σ(2,4,7,10,12) together with its don't-
care conditions d(w,x,y,z)=Σ(0,6,8)�(�,�,�,�)=Σ(0,6,8) and express the simplified
function in SOP form. Do not include spaces between characters. Write only the equation.
Do not include F=�=.
Σ(10,12)
Answer: 

Question 1
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
It is a combinational circuit that performs addition of two bits.
Select one:

a.

Half-adder

b.

BCD Adder

c.

Adder-subtractor

d.

Full adder
Feedback
Your answer is incorrect.
Question 2
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following best corresponds to a circuit diagram of a 1:2 demultiplexer? The
demultiplexer accepts one input (IN) and passes this to one of the two outputs (A or B),
depending on the selection (SEL) bit. The truth table is shown below:

Demultiplexer Truth Table


Input Input Output Output

(IN) (SEL) A B

0 0 0 0
0 1 0 0
1 0 1 0
1 1 0 1

Select one:

a.

b.
c.

d.

Feedback
Your answer is correct.

Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The following are steps involved in designing combinational circuits, except one:
Select one:

a.

Draw the diagram.

b.

Label the inputs and outputs with arbitrary symbols.

c.

Derive the truth table.

d.

Obtain the simplified Boolean functions of the output in terms of the input.
Feedback
Your answer is correct.

Question 4
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This occurs only when adding numbers in two's complement system that have the same
sign, and whose result appears to be in the opposite sign.
Select one:

a.

Carry flag = 0

b.
Signed overflow

c.

Sign flag = 1

d.

Unsigned overflow
Feedback
Your answer is correct.

Question 5
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Which of the following is the simplified Sum of Products equivalent of the Boolean
function F(w,x,y,z)=Π(1,3,5,7,13,15)�(�,�,�,�)=Π(1,3,5,7,13,15)?
Select one:

a.

F=z′+wx′�=�′+��′

b.

F=w′z′+xz′�=�′�′+��′

c.

F=wz′+x′z′�=��′+�′�′

d.

F=wy′+xz�=��′+��
Feedback
Your answer is incorrect.

Question 6
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a logic circuit consisting of gates whose outputs at any time are a function of the
combination of inputs.
Select one:

a.

Parallel logic circuit

b.

Sequential logic circuit

c.

Combinational logic circuit

d.

Serial logic circuit


Feedback
Your answer is correct.

Question 7
Correct

Mark 1.00 out of 1.00

Flag question
Question text
These are combinational circuits that perform the addition of three bits.
full adder
Answer: 

Question 8
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a table or diagram made up of squares which provides a simple way to minimize
Boolean functions.
Karnaugh map
Answer: 

Question 9
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Obtain the simplified Boolean expression for the output F� in terms of the input variables
in the circuit shown below. Give the expression only (no need to include F=�=), and do not
put spaces between the variables and operators.
1
Answer: 

Question 10
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a digital circuit that produces the arithmetic sum of n�-bit binary numbers.
Select one:

a.

Binary adder

b.

Half-adder

c.

BCD adder

d.

Full adder

Question 1
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Simplify the Boolean
function F(w,x,y,z)=Σ(2,4,7,10,12)�(�,�,�,�)=Σ(2,4,7,10,12) together with its don't-
care conditions d(w,x,y,z)=Σ(0,6,8)�(�,�,�,�)=Σ(0,6,8) and express the simplified
function in SOP form. Do not include spaces between characters. Write only the equation.
Do not include F=�=.
0
Answer: 

Feedback
The correct answer is: x'z'+y'z'+w'xy

Question 2
Correct

Mark 1.00 out of 1.00

Flag question

Question text
These are combinational circuits that perform the addition of three bits.
full adder
Answer: 

Feedback
The correct answer is: full adder

Question 3
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a product term obtained by combining the maximum possible number of adjacent
squares.
Select one:

a.

Essential prime implicant

b.

Minterm
c.

Prime implicant

d.

Implicant
Feedback
Your answer is correct.

The correct answer is: Prime implicant

Question 4
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Obtain the simplified Boolean expression for the output G� in terms of the input variables
in the circuit shown below. Give the expression only (no need to include G=�=), and do
not put spaces between the variables and operators.

A'D'+ABC
Answer: 
Feedback
The correct answer is: A'D'+ABC

Question 5
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following is the simplified Sum of Products equivalent of the Boolean
function F(w,x,y,z)=Π(1,3,5,7,13,15)�(�,�,�,�)=Π(1,3,5,7,13,15)?
Select one:

a.

F=z′+wx′�=�′+��′

b.

F=w′z′+xz′�=�′�′+��′

c.

F=wz′+x′z′�=��′+�′�′

d.

F=wy′+xz�=��′+��
Feedback
Your answer is correct.

The correct answer is: F=w′z′+xz′�=�′�′+��′

Question 6
Correct

Mark 1.00 out of 1.00


Flag question

Question text
It is a logic circuit consisting of gates whose outputs at any time are a function of the
combination of inputs.
Select one:

a.

Parallel logic circuit

b.

Serial logic circuit

c.

Sequential logic circuit

d.

Combinational logic circuit


Feedback
Your answer is correct.

The correct answer is: Combinational logic circuit

Question 7
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following is not an equivalent expression of the Boolean
function F(A,B,C,D)=Σ(2,4,10,12,14)�(�,�,�,�)=Σ(2,4,10,12,14)
Select one:
a.

F=D+A′BC�=�+�′��

b.

F=B′D′+C′D′+AD′�=�′�′+�′�′+��′

c.

F=D′(A+B′+C′)�=�′(�+�′+�′)

d.

F′=(A′+D)(B+D)(C+D)�′=(�′+�)(�+�)(�+�)
Feedback
Your answer is correct.

The correct answer is: F=D+A′BC�=�+�′��

Question 8
Incorrect

Mark 0.00 out of 1.00

Flag question

Question text
Obtain the simplified Boolean expression for the output F� in terms of the input variables
in the circuit shown below. Give the expression only (no need to include F=�=), and do not
put spaces between the variables and operators.
A'D'+ABC
Answer: 

Feedback
The correct answer is: A'D+ABC

Question 9
Correct

Mark 1.00 out of 1.00

Flag question

Question text
This occurs only when adding numbers in two's complement system that have the same
sign, and whose result appears to be in the opposite sign.
Select one:

a.

Carry flag = 0

b.

Unsigned overflow
c.

Sign flag = 1

d.

Signed overflow
Feedback
Your answer is correct.

The correct answer is: Signed overflow

Question 10
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The following are equivalent functions
of F(A,B,C,D)=Σ(0,6,8,13,14)�(�,�,�,�)=Σ(0,6,8,13,14) with don't-care
conditions d(A,B,C,D)=Σ(2,4,10)�(�,�,�,�)=Σ(2,4,10), except one.

Select one:

a.

F=(B+D)′+(C′+D)′+(A+D)′+(A′+B′+C+D′)′�=(�+�)′+(�′+�)′+(�+�)′+(�′+�′
+�+�′)′

b.

F=(D⊕ABC′)′�=(�⊕���′)′

c.

F=D⊕ABC′�=�⊕���′
d.

F=B′D′+CD′+A′D′+ABC′D�=�′�′+��′+�′�′+���′�
Feedback
Your answer is correct.

The correct answer is: F=D⊕ABC′�=�⊕���′

Question 11
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following best corresponds to a circuit diagram of a 1:2 demultiplexer? The
demultiplexer accepts one input (IN) and passes this to one of the two outputs (A or B),
depending on the selection (SEL) bit. The truth table is shown below:

Demultiplexer Truth Table


Input Input Output Output

(IN) (SEL) A B

0 0 0 0
0 1 0 0
1 0 1 0
1 1 0 1

Select one:

a.
b.

c.

d.
Feedback
Your answer is correct.

The correct answer is: 

Question 12
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Simplify the function F=wx′+y′z′+w′yz′�=��′+�′�′+�′��′ and express the simplified
function with OR operations.
Select one:

a.

F=(w+x′)+(y′+z′)+(y+z′)�=(�+�′)+(�′+�′)+(�+�′)

b.

F=(w′+x)+(y+z)+(w+z)�=(�′+�)+(�+�)+(�+�)
c.

F=(w′+x)′+(y+z)′+(w+z)′�=(�′+�)′+(�+�)′+(�+�)′

d.

F=(w+x′)′+(y′+z′)′+(y+z′)′�=(�+�′)′+(�′+�′)′+(�+�′)′
Feedback
Your answer is correct.

The correct answer is: F=(w′+x)′+(y+z)′+(w+z)′�=(�′+�)′+(�+�)′+(�+�)′

Question 13
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Which of the following best corresponds to the simplified Boolean
function F(a,b,c,d)=Π(1,3,5,7,13,15)�(�,�,�,�)=Π(1,3,5,7,13,15)?
Select one:

a.

F=(a+c′)(b+d′)�=(�+�′)(�+�′)

b.

F=ac+b′d�=��+�′�

c.

F=(a+d′)(b′+d′)�=(�+�′)(�′+�′)

d.

F=ad′+bd′�=��′+��′
Feedback
Your answer is correct.

The correct answer is: F=(a+d′)(b′+d′)�=(�+�′)(�′+�′)

Question 14
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a combinational circuit that performs addition of two bits.
Select one:

a.

Adder-subtractor

b.

Full adder

c.

Half-adder

d.

BCD Adder
Feedback
Your answer is correct.

The correct answer is: Half-adder

Question 15
Correct
Mark 1.00 out of 1.00

Flag question

Question text
In a four-variable K-Map, how many adjacent squares will produce a product term with 2
literals?
4
Answer:

Feedback
The correct answer is: 4

Question 16
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a table or diagram made up of squares which provides a simple way to minimize
Boolean functions.
Karnaugh map
Answer: 

Feedback
The correct answer is: Karnaugh map

Question 17
Correct

Mark 1.00 out of 1.00

Flag question

Question text
The following are steps involved in designing combinational circuits, except one:
Select one:

a.

Derive the truth table.


b.

Obtain the simplified Boolean functions of the output in terms of the input.

c.

Draw the diagram.

d.

Label the inputs and outputs with arbitrary symbols.


Feedback
Your answer is correct.

The correct answer is: Label the inputs and outputs with arbitrary symbols.

Question 18
Correct

Mark 1.00 out of 1.00

Flag question

Question text
Why would you build a BCD-to-binary converter circuit?
Select one:

a.

Only humans can comprehend BCD.

b.

The converter will translate all binary numbers into BCD.

c.

Different parts of the system may use different binary codes.


d.

None of the above.


Feedback
Your answer is correct.

The correct answer is: Different parts of the system may use different binary codes.

Question 19
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a logic circuit composed of logic gates and storage elements. Its output is a function of
the inputs and the state of the storage elements.
Select one:

a.

Serial logic circuit

b.

Sequential logic circuit

c.

Combinational logic circuit

d.

Parallel logic circuit


Feedback
Your answer is correct.
The correct answer is: Sequential logic circuit

Question 20
Correct

Mark 1.00 out of 1.00

Flag question

Question text
It is a digital circuit that produces the arithmetic sum of n�-bit binary numbers.
Select one:

a.

Binary adder

b.

Full adder

c.

BCD adder

d.

Half-adder
Feedback
Your answer is correct.

The correct answer is: Binary adder

You might also like