Forgot Password?

We've sent you an email verification code. Please enter it here to set a new password.

Now share this with your friends to help them.

(a) What are universal gates? Design AND and OR gates using the universal gates.

(b) State and prove the demorgan theorem.

(c). Convert the following binary number of decimal numbers:

(i) (101111.1101)_{2} (ii) (110101.101)_{2}.

(a) Distinguish Melay and Moore machining.

(e) What is the difference between conventional flow chart and ASM chart?

(f) What are capabilities and limitations of finite state machines?

(g) What is the advantages of Master Slave FF.

(a) Simply the expression Y = (0,1,4,5, 6, 8, 9, 12, 13, 14) using the K-map.

(b) Find the minimal sum of products for the Boolean expression:

f(w,x,y,z) = (1,3,4,5,9,10,11) + d 6,8) using the Quine-Mccluskey method.

(a) Design a 4-Bit magnitude comparator.

(b) Design and explain the octal to binary encoder.

(a) Design and explain the operation of TTL NOR gate.

(b) What are the advantages of CMOS logic? Discuss.

(a) Design a synchronous MOD-10 counter.

(6) What are the different type of shift registers? Explain.

Design a sequence detector that produces an output '1' whenever the non overlapping sequence 1011 is detected.

Draw the merger graph and obtain the set of maximal compatibles for theincompletely specified sequential machine whose state table is given below:

Write short note on:

(a) Homing experiment

(b) Fault models

For the state diagram of the control circuit shown below:

(b) Design the circuit using multiplexers.

(a) Obtain the ASM chart.

Ipjugaad