1. Minimise the following boolean function and draw the corresponding logic circuit. f(w,x,y,z) = (w*~x*(y+x*z)+~w*~x)*y 2. A newly created computer program detects the presence of excel E , word W and power point on any computer its installed. the program will NOT run ONLY when either Excel or Word is running simultaneously with power point a) contruct a fully complete truth table depicting all the 8 possible combinations and outputs for the given requirements above. b)construct the corresponding k-map from the truth table in (a). c) derive and fully minimise the boolean function from the k-map in (b). d) draw a fully labeled combinational circuit daigram of the minimised circuit. 3. construct a well labeled state diagram for a Mealy state machine that detects a sequence of bits 0101. how many overlaps exist in this state machine.
1. Minimise the following boolean function and draw the corresponding logic circuit.
f(w,x,y,z) = (w*~x*(y+x*z)+~w*~x)*y
2. A newly created computer program detects the presence of excel E , word W and power point on any computer its installed. the program will NOT run ONLY when either Excel or Word is running simultaneously with power point
a) contruct a fully complete truth table depicting all the 8 possible combinations and outputs for the given requirements above.
b)construct the corresponding k-map from the truth table in (a).
c) derive and fully minimise the boolean function from the k-map in (b).
d) draw a fully labeled combinational circuit daigram of the minimised circuit.
3. construct a well labeled state diagram for a Mealy state machine that detects a sequence of bits 0101. how many overlaps exist in this state machine.
Trending now
This is a popular solution!
Step by step
Solved in 4 steps with 3 images
