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

Midterm Exam

The student scored 93.75% on a quiz covering combinational logic circuits. The quiz consisted of 25 multiple choice questions. The student answered all but one question correctly, scoring 1 point out of 2 possible points on the single incorrect question. Overall the student demonstrated a strong understanding of combinational logic concepts such as multiplexers, decoders, simplifying Boolean functions and identifying common circuits.

Uploaded by

John Codes
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
22 views

Midterm Exam

The student scored 93.75% on a quiz covering combinational logic circuits. The quiz consisted of 25 multiple choice questions. The student answered all but one question correctly, scoring 1 point out of 2 possible points on the single incorrect question. Overall the student demonstrated a strong understanding of combinational logic concepts such as multiplexers, decoders, simplifying Boolean functions and identifying common circuits.

Uploaded by

John Codes
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 19

Grade 93.

75 out of 100.00
Question 1
Correct
Mark 1.00 out of 1.00

Flag question

Question text
It is a digital circuit that takes in 2n2n input lines and produces aggregated nn output lines.

Select one:

a.
Decoder

b.
Demultiplexer

c.
Multiplexer

d.
Encoder
Feedback
Your answer is correct.

Question 2
Correct
Mark 1.00 out of 1.00

Flag question

Question text
It is a combinational circuit that converts binary information from nn input lines to a
maximum of 2n2n unique output lines.
Select one:

a.
Decoder

b.
Demultiplexer

c.
Multiplexer

d.
Encoder
Feedback
Your answer is correct.

Question 3
Correct
Mark 2.00 out of 2.00

Flag question

Question text
A majority circuit is a combinational circuit whose output is equal to 1 if the input variables
have more 1's than 0's. The output is 9 otherwise.
From the choices available, choose the Boolean function that corresponds best to a 3-input
majority circuit.

Select one:

a.
F=xy+xz+yzF=xy+xz+yz

b.
F=x′y+xz+y′zF=x′y+xz+y′z

c.
F=x(y′z′+yz)F=x(y′z′+yz)

d.
F=x+yz+xy′z′F=x+yz+xy′z′
Feedback
Your answer is correct.

Question 4
Correct
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)F(w,x,y,z)=Σ(2,4,7,10,12) together
with its don't-care conditions d(w,x,y,z)=Σ(0,6,8)d(w,x,y,z)=Σ(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=F=.

x'z'+y'z'+w 'xy
Answer: 

Question 5
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)(x,y,z) and three outputs (A,B,C)(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=1x=0,y=1,z=1, the output is A=1,B=0,C=0A=1,B=0,C=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=0x=1,y=0,z=0, the output
is A=0,B=1,C=0A=0,B=1,C=0.
C= xz+x'z'
Answer 1
A= y(x+z)
Answer 2
B= (x+z)y'+(x+z)'y
Answer 3
Feedback
Your answer is correct.

Question 6
Correct
Mark 1.00 out of 1.00

Flag question

Question text
TRUE or FALSE: The critical path is the shortest and fastest path from a circuit's input to its
output.

Select one:
True
False 

Question 7
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?

Answer: 

Question 8
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.
Label the inputs and outputs with arbitrary symbols.

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

c.
Derive the truth table.

d.
Draw the diagram.
Feedback
Your answer is correct.

Question 9
Correct
Mark 1.00 out of 1.00

Flag question

Question text
It is the maximum time from when the input changes until the output reaches its final value.

Select one:

a.
Glitch
b.
Propagation delay

c.
Contamination delay

d.
Transient response
Feedback
Your answer is correct.

Question 10
Correct
Mark 1.00 out of 1.00

Flag question

Question text
TRUE OR FALSE: One way to eliminate glitches is to introduce redundant implicants.

Select one:
True 
False

Question 11
Correct
Mark 1.00 out of 1.00

Flag question

Question text
TRUE or FALSE: Multiplexers can be used as lookup tables to perform logic functions.

Select one:
True 
False

Question 12
Correct
Mark 1.00 out of 1.00

Flag question

Question text
Which Boolean function represents the schematic diagram below?

Select one:

a.
Y=A+B+C′Y=A+B+C′

b.
Y=C′+ABY=C′+AB

c.
Y=B+A′C′Y=B+A′C′

d.
Y=A+BC′Y=A+BC′
Feedback
Your answer is correct.

Question 13
Incorrect
Mark 0.00 out of 2.00
Flag question

Question text
Determine the contamination delay of the circuit. Use the delays given in the table.

30
Answer:

Question 14
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)F(A,B,C,D)=Σ(0,6,8,13,14) with don't-care
conditions d(A,B,C,D)=Σ(2,4,10)d(A,B,C,D)=Σ(2,4,10), except one.

Select one:

a.
F=B′D′+CD′+A′D′+ABC′DF=B′D′+CD′+A′D′+ABC′D

b.
F=(B+D)′+(C′+D)′+(A+D)′+(A′+B′+C+D′)′F=(B+D)′+(C′+D)′+(A+D)′+(A′+B′+C+D′)′

c.
F=(D⊕ABC′)′F=(D⊕ABC′)′

d.
F=D⊕ABC′F=D⊕ABC′
Feedback
Your answer is correct.

Question 15
Correct
Mark 2.00 out of 2.00

Flag question

Question text
Select the Boolean equation for the function described in the truth table below. Remember
to take advantage of the don't-care entries.

Truth Table
AA BB CC DD YY
0 0 0 0 X
0 0 0 1 X
0 0 1 0 X
Truth Table
AA BB CC DD YY
0 0 1 1 0
0 1 0 0 0
0 1 0 1 X
0 1 1 0 0
0 1 1 1 X
1 0 0 0 1
1 0 0 1 0
1 0 1 0 X
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0 X
1 1 1 1 1

Select one:

a.
Y=AB+AC+AD′Y=AB+AC+AD′

b.
Y=AD′+AC+BDY=AD′+AC+BD

c.
Y=AB′+B′C+CDY=AB′+B′C+CD

d.
Y=AC+AB′DY=AC+AB′D
Feedback
Your answer is correct.

Question 16
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.
Half-adder

c.
BCD Adder

d.
Full adder
Feedback
Your answer is correct.

Question 17
Correct
Mark 2.00 out of 2.00

Flag question

Question text
What kind of circuit is illustrated below?
Select one:

a.
It's a subtractor circuit.

b.
It's a 2:1 mux circuit.

c.
It's an adder circuit.

d.
It's a 2:1 encoder circuit.
Feedback
Your answer is correct.

Question 18
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.
Sequential logic circuit

b.
Parallel logic circuit

c.
Combinational logic circuit

d.
Serial logic circuit
Feedback
Your answer is correct.

Question 19
Correct
Mark 2.00 out of 2.00

Flag question

Question text
Which of the following is the Boolean function that corresponds to the truth table?

AA BB CC YY
0 0 0 1
0 0 1 0
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 1
Select one:

a.
Y=(A⊕C)′+B′C′Y=(A⊕C)′+B′C′

b.
Y=A⊕B+B′C′Y=A⊕B+B′C′

c.
Y=B′C+A′B+A′CY=B′C+A′B+A′C

d.
Y=A′B′+AB+B′C′Y=A′B′+AB+B′C′
Feedback
Your answer is correct.

Question 20
Correct
Mark 2.00 out of 2.00

Flag question

Question text
Which of the following is the Boolean function that corresponds to the 2-input NOR gate
implementation of the function F(A,B,C,D)=(A⊕B)′(C⊕D)F(A,B,C,D)=(A⊕B)′(C⊕D)?

Select one:

a.
F=[(A′+B′)′+(A+B′)′]′+[(C′+D′)′+(C+D)′]′F=[(A′+B′)′+(A+B′)′]′+[(C′+D′)′+(C+D)′]′

b.
F=[(A+B′)′+(A′+B)′)′+((C+D′)′+(C′+D)′]′F=[(A+B′)′+(A′+B)′)′+((C+D′)′+(C′+D)′]′

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

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

Question 21
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.
Serial logic circuit

c.
Combinational logic circuit

d.
Sequential logic circuit
Feedback
Your answer is correct.

Question 22
Correct
Mark 2.00 out of 2.00
Flag question

Question text
Determine the propagation delay of the circuit. Use the delays given in the table.

100
Answer:

Question 23
Correct
Mark 1.00 out of 1.00

Flag question
Question text
Select the minimized Boolean equation that best corresponds to the function performed by
the circuit shown below:

Select one:

a.
Y=AB′+A′C′+BC′Y=AB′+A′C′+BC′

b.
Y=ABC′+AC′D+B′C′Y=ABC′+AC′D+B′C′

c.
Y=A′C′D′+B′C′D′+A′B′Y=A′C′D′+B′C′D′+A′B′

d.
Y=AB′C′D+C′D′+A′BY=AB′C′D+C′D′+A′B
Feedback
Your answer is correct.

Question 24
Correct
Mark 1.00 out of 1.00

Flag question

Question text
It is the minimum time from when an input changes until any output starts to change its
value.

Select one:
a.
Glitch

b.
Contamination delay

c.
Propagation delay

d.
Transient response
Feedback
Your answer is correct.

Question 25
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.
Prime implicant

c.
Essential prime implicant

d.
Implicant
Feedback
Your answer is correct.

You might also like