LOD311B 20232 STest 2 MEMO
LOD311B 20232 STest 2 MEMO
LOD311B 20232 STest 2 MEMO
TEST 2 Examiners
(ONLY PAPER) Mr LA Mpiana
Semester 1, 2023
_______________________
Lecturer 100 min Moderator
Mr. SEM. Tankam
7 pages
Surname Initials
%
_______________________
Signature
Instructions to Candidates
1. No programmable calculators are allowed.
2. Make sure that your calculator is set to ENG (Engineering Mode) with a TAB
amount of three (3)
3. Only answers written in the aforementioned format will be accepted as correct.
4. Calculated values must be expressed to three (3) decimal values.
5. Answers without units will not be marked.
6. All the answers, including diagram, sketches, etc, must be done in pen. Work done
in pencil will not be remarked.
7. Show all your calculations in the allocated areas.
8. All the questions must be answered on the question paper in the allocated areas.
9. Diagrams and schematics will be marked as follows: Marks will be allocated for the
correct components or blocks added to the diagram or schematic and marks will be
deducted for each wrong connection of these components or blocks on the diagram
or schematic or for any additional components or blocks unnecessarily added to the
diagram or schematic.
Question 1
Draw the state diagram and state table of a Moore type finite state machine to detect the
sequence 1100 ? (10)
CS NS Z
W=0 w =1
A A B 0
B A C 0
C D C 0
D E B 0
E A B 1
Question 2
2.1 Find the simplified function using the tabular method of minimization for the function
below
f = Ʃ(1,2,3,4,6,7,8,9,10,11,12)
1 0001
2 0010
4 0100
8 1000
3 0011
6 0110
9 1001
10 1010
12 1100
7 0111
11 1011
List 2
1,3 00x1
1,9 x001
2,3 001x
2,6 0x10
2,10 x010
4,6 01x0
4,12 x100
8,9 100x
8,10 10x0
8,12 1x00
3,7 0x11
3,11 x011
6,7 011x
9,11 10x1
10,11 110x
List 3
1,3,9,11 x0x1
2.3,6,7 0x1x
2,3,10,11 x01x
8.9, 10,11 10xx
_ __ __ __ __ __
f = x2x4 +x1x3 +x2x3+ x1x2 + x2x3x4
X X X
X X
x X X
x x X
_ __ __ __ __ __
f = x2x4 +x1x3 +x2x3+ x1x2 + x2x3x4
Question 3
a. Use a minimum number of 2:1 Multiplexers and logic gates to implement this
b. Use a minimum number of 4:1 multiplexer and logic gates to implement the same
function to implement the same function.
(10)
Check if the 2:1 multiplexer has been constructed well
Question 4
4.1 What is the difference between a Meally and a Moore Finite state Machines
(4)
The output of a Moore system is updated in the state while the output of a Meally is
updated during the transition
The output of a Moore system is depends on the state while the output of a Meally is
depends on both the state and the transition
4.2 Define the following terms:
Prime implicant is an implicant that can not be reduced int an implicant of fewer number
of literals
4.2.2 Cover
(3)
Cover is a sum of all the implicant for which the value of a function is equal to 1
END OF PAPER