Question 

1
Complete
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.
1 and 0

b.
0

c.
1

d.
None of the above
Question 2
Complete
Mark 1.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: 
Question 3
Complete
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+B′+C′)�=�′(�+�′+�′)

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

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

d.
F=D+A′BC�=�+�′��
Feedback
Your answer is correct.
Question 4
Complete
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.
Propositional Calculus

b.
Algebraic Function

c.
Symbolic Logic

d.
Binary Logic
Question 5
Complete
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′+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 correct.
Question 6
Complete
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
Complete
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 8
Complete
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.
Binary System

c.
Digital System

d.
Electronic System
Question 9
Complete
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.
SOP
b.
Maxterm

c.
Minterm

d.
POS
Question 10
Complete
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.
Answer 1
A = y(x+z)

Answer 2
C= xz+x'z'

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

Feedback
Your answer is correct.
Question 11
Complete
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 12
Complete
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.
Sign flag = 1

c.
Signed overflow

d.
Unsigned overflow
Feedback
Your answer is correct.
Question 13
Complete
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.
Obtain the simplified Boolean functions of the output in terms of the input.

d.
Label the inputs and outputs with arbitrary symbols.
Feedback
Your answer is correct.
Question 14
Complete
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 15
Complete
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 16
Complete
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 17
Complete
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 18
Complete
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.
Memory circuits

b.
Processor

c.
Logic gates

d.
Programmer circuits
Question 19
Complete
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 0100

b.
1111 1101

c.
1111 1000

d.
1111 1100
Question 20
Complete
Mark 1.00 out of 1.00

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

a.
None of the above.

b.
The converter will translate all binary numbers into BCD.

c.
Only humans can comprehend BCD.

d.
Different parts of the system may use different binary codes.
Feedback
Your answer is correct.
Question 21
Complete
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.
Question 22
Complete
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.
Question 23
Complete
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 24
Complete
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.
Gregory Boole

d.
George Boole
Question 25
Complete
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 26
Complete
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.
Complement

b.
Product

c.
Identity

d.
Sum
Question 27
Complete
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.
ASCII Code

c.
Gray Code

d.
BCD
Question 28
Complete
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.
Serial logic circuit

b.
Combinational logic circuit

c.
Sequential logic circuit

d.
Parallel logic circuit
Feedback
Your answer is correct.
Question 29
Complete
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=ad′+bd′�=��′+��′

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

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

d.
F=ac+b′d�=��+�′�
Feedback
Your answer is correct.
Question 30
Complete
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 31
Complete
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=w′z′+xz′�=�′�′+��′

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

c.
F=wy′+xz�=��′+��

d.
F=z′+wx′�=�′+��′
Feedback
Your answer is correct.
Question 32
Complete
Mark 1.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=�=.
x'z'+y'z'+w 'xy
Answer: 
Question 33
Complete
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.
POS

c.
Maxterm

d.
Minterm
Question 34
Complete
Mark 1.00 out of 1.00

Flag question
Question text
Convert 4021.254021.25 to decimal. The answer is _________________.
Select one:

a.
192.710192.710

b.
515.610515.610

c.
511.410511.410

d.
822.610
Question 35
Complete
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 36
Complete
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.
Full adder

c.
Binary adder

d.
BCD adder
Feedback
Your answer is correct.
Question 37
Complete
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.
Implicant

c.
Minterm

d.
Prime implicant
Feedback
Your answer is correct.
Question 38
Complete
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.
Symbolic Logic

b.
Fuzzy Logic

c.
Boolean Algebra

d.
Propositional Calculus
Question 39
Complete
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 symbols

b.
Logical operators

c.
Algebraic functions

d.
Mathematical operators
Question 40
Complete
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 complexity

c.
Hiding the source code

d.
Encrypting the data