State Herzberg’s two factor theory.

Question (4): Build a finite state machine (FSM) with an input X and an output Z. If the sequence '0110' shows up on X, then a value '1' should show up on Z, otherwise '0'. Allow overlap of Sequences (i.e., end of one sequence could be the beginning of another one). Unused states should go to the initial valid state. You need to give two different designs. One for Moore and the other for Mealy. In each design case:- a) Draw the state diagram. b) Write the state stable.

Plot a graph for the following polynomials each with x=-100 to +100 with a change in x as 0.2 a) f(x)= x(x-2) (x-1)(x+1) b) f(x) = -(x-2) (x-1)(x+1) ) f(x) = -x(x-1)(x+1)(x-2) d) f(x) = (1-x)(x+1) (x-2) Write c++ code that will output all the values of f(x) given values of x. Do it for a, b, c and d above.

1. Simplify the following logic equation: F = ab'c + abcd' + ab'cd' + acd Also draw the circuit before and after simplifications, and comment on savings on number of gates. % savings (number of gates required before modification – number of gates required with simplest form)* 100/(number of gates required after modification)