Does E(1)=L(1)?

Two logic functions are given in the K-MAPs below.         Answer Questions 11-13 regarding these two functions.

  Implement the function G by a 4:1 MUX by using C and D as the control select inputs (do not consider the function F) by completing the table below, where the usage of additional gates for the MUX inputs should be minimized. Input port 0 Input port 1 Input port 2 Input port 3  

The decimal value of S =

   F(X,Y,Z) = (X+Z)(X’+Z’)(X’+Y+Z)                 = (X+Z)(X’+Z’)(X’+Y) A. Idempotent & DeMorgan’s Law B. Consensus  C. Simplifications  D. None of the above

Consider the state transition and excitation table below for a 2-bit counter: Q1 Q0 Q1+ Q0+ T1 J0 K0 0 0 1 1 0 1 0 0 1 0 x x x x x 1 1 0 1 Answer Questions 14-17 below.

Without state reduction, how many D flip-flops are need to implement the FSM by using one-hot state encoding and binary state encoding, respectively?   # flip flops needed (in decimal) one-hot state encoding binary state encoding

Determine the minimized product-of-sum (POS) expression for the function F without consideration of G (choose one if there are equivalent expressions): F(A,B,C,D) =

Determine the values of T1 , J0, k0 , Q1+ and Q0+  for the current state Q1Q0 = 10.  Q1 Q0 Q1+ Q0+ T1 J0 K0 1 0

List the bit strings that this detector detects (leave no space between bits, and list the strings from small to large according to their binary number values): string 1 string 2 string 3 string 4