Q3. A sequential circuit has an input (X) and an output (Z). The output is the same as the input was two clock periods previously. For example, X= 010110 101101000 1 Z = 0001011010110100 The first two values of Z are 0. Find a Mealy state graph and table for the circuit.

Show that the digital circuit can be simplified to a circuit consisting of three NOT gates, two 2-input AND gate and one 2-input OR gate. Draw and simulate your circuit in Quartus II and show that it functions properly according to the truth table. Please draw it so I can easily understand.

A circuit is constructed with four resistors, one inductor, one battery and a switch as shown. The values for the resistors are: R1 = R2 = 72 Q, R3 = 61 Q and R4 = 99 Q. The inductance is L = %3D V L 549 mH and the battery voltage is V = 24 V. R3 1) The switch has been open for a long time when at time t = 0, the switch is closed. What is l1(0), the magnitude of the current through the resistor R1 just after the switch is closed? A Submit 2) What is 1(o0), the magnitude of the current that flows through the resistor R1 a very long time after the switch has been closed? A Submit 3) What is VL(0), the magnitude of the voltage across the inductor just after the switch is closed? V Submit 4) What is IL(0), the magnitude of the current through the inductor after the switch has been closed for a very long time? A Submit 5) What is I2(0), the magnitude of the current through the resistor R2 just after the switch is closed? A Submit

A four-bit binary number (A, B, C, D), where A is the most significant digit and D the least significant digit, appears on the input to a combinational logic circuit. Output X indicates whether the number is divisible by 2 without any remainder and output Y indicates if the number is divisible by 3 without remainder. Obtain the sum-of-products logic equations for X and Y with the minimum number of literals. Show the implementation for X and Y. Also implement X using NAND gates only.

just b

A combinational circuit is described by this Boolean Expression: F(A,B,C,D) = 2m(0,2,4,8,9) i) Minimise the Boolean Expression given above using a Karnaugh map. ii) Given Don't Care conditions d = Em (10,11,12), use a separate Karnaugh map to demonstrate how you would further simplify the expression in part i). iii) Use Switching Algebra to show how you would implement the function obtained in part ii) by using NAND gates only. Provide a circuit diagram in your answer. Show all your working.

1- In the following sequential circuit. There are 2 D FF (A and B), 2 inputs (x and y), and 1 output z The output and next-states equations are given A(t+1) = x'y + xà B(t+1) = x'B + xA z= B c- Draw the corresponding state diagram.