Retake exam DITE: Wednesday, March 14,2018 -- 14:00 to 17:00h
Task
I
(4points):
Conven thefollowing
numbers from the given base to the other listed bases in the table.Important:
Show and explain the conversion procedures you use and not only thefinal
result.Task
II
(6points):
Implement one JKflip-flop
using thefollowing
components:one T
flip-flop,
oneMultiplexer
4-to-1, and oneXOR
gate.lmportant:
Show and explainall
the steps you do to implement the JKflip-flop.
Task
III
(5points): Simplify
the Boolean functionF(W"X,Y,Z): lm(1,2,4,5,6,8,9) which has the
don't-careconditions d(WX,YZ) : Im(10,11,15) by finding all prime implicants
and essentialprime implicants
andapplying the
selection rule.Note that function
F
hasdon't
cøre conditionsd
that you haveto
takeinto
accountwhen simplifying function F. After you
havesimplified the function,
representit using the logic basis l\41\D. Also; draw the combinational logic circuit
colresponding to the function usingonly 3-input I\AND
gates.Important:
Show all prime implicants and essential prime implicants aswell
asexplain
all
the steps you do tosimplify
and represent function F.Task IV (5 points): Design a
Sequence Recognizercircuit that
recognizes the occurrenceof
the sequenceof bits "ll0",
regardlessof
whereit
occursin
a longer sequence.This circuit
has oneinput X
and one outputZ. An arbitrary long
input sequenceof bits
entersthe circuit via input X. Output Z equals to 1 when
the
previous three input bits to the circuit
were 110. Otherwise, Z
equals to 0.
Implement the
circuit
described above under thefollowing
conditions:1.
The Sequence Recognizercircuit must
beMoore Finite
StateMachine;
2.
Useonly
NOR gates and SR Flip-Flops.lmportant:
Show andexplain all the
stepsyou do to
design and implement the Sequence Recognizer c ircuit.Decimal Binary
þctal
þexadecimal10.312s
)
lz lz
7 I 0011101.101 lz lz
? ? løzt.s lz
? ?
lz