Section-A

1.(a) (b)

Write the postulates of Boolean algebra.

Solve the following using K-map:F(A,B,C,D) = ∑(0,5,6,9, 10,12,15)

(8)

(8)

2.(a)

(b)

What are De-Morgan’s theorems? Explain with examples.

Simplify F together with don’t care conditions d in (i) SOP (ii) POS form.F(w,x,y,z) = ∑(1,2,8,9,12,13), d(w,x,y,z) = ∑(10,11,14,15)

(8)

(8)

Section-B

3. (a) (b)

What is an instruction code? What are its various parts? Explain.

What are the parts of an instruction cycle? What are the various machine cycles involved? Explain in detail.

(8)

(8)

4.(a)

(b)

What is a ripple counter? Why is it so called? Explain the working of the ripple counter with timing diagram.

Explain various addressing modes in detail.

(8)

(8)

Section-C

5.(a)

(b)

Explain various arithmetic operation with their logic circuit.

Compare the features of RISC and CISC.

(8)

(8)

6.(a)

(b)

Compare micro-programmed and hardwired CPU organizations.

Consider the following algorithm:Declare registers A[8],B[8],C[8]START: A= 0 B=0AhLOOP: A=A+B B=B-1 If B<> 0 then goto LOOP C = AHALT: go to HALTDesign a hardwired controller that will implement this algorithm

(8)

(8)

Section-D

7. (a)

(b)

Explain the various memory types.

What is the difference between i/o mapped i/o and memory mapped i/o?

(10)

(6)

8. Discuss the architecture of 8085 machine. (16)

Section-E

9(a) How is a register different from memory? (2)

(b) Explain the DMA data transfer scheme through an appropriate diagram. (2)

(c) Who controls the buses in DMA data transfer? (2)

(d) What is the main advantage of micro-programmed control? (2)

(e) What are the advantages of a D-flip-flop over S-R? (2)

(f) Name the Computer system buses. (2)

(g) Why cache memory is so called? (2)

(h) What are the functions of ALU? (2)

Section-A

1.(a)

(b)

Write down the postulates of Boolean algebra. Also differentiate between Boolean

algebra and real number algebra.

Solve the following Boolean functions :

(i) xy+xy’ (ii) (x+y) (x+y’) (iii) xz+xyz’ (iv) (a+b)’(a’+b’)

(8)

(8)

2.(a)

(b)

Explain the 3-variable and 4-variable K-map solution method.

Given F(A,B,C,D) = ∑ (0,2,3,6,7,12,13,14) + d(1,4,11,15), where d denotes the don’t

care condition . find simplified expression

(i) In SOP form (ii) In POS form . Also realize the simplified expression using gates.

(8)

(8)

Section-B

3. (a)

(b)

Explain the design of a parallel adder,

Explain the design of a synchronous counter.

(8)

(8)

4.(a)

(b)

Explain the working of a J-K flip-flop with the help of timing diagram and truth

table.

How will you convert the J-K to T flip-flop? Explain the working of a T-flip-flop.

(8)

(8)

Section-C

5.(a)

(b)

Discuss register transfer language concept with examples.

Explain various arithmetic and logical shift operations.

(8)

(8)

6.(a)

(b)

Explain the features of RISC processors.

Explain the design of a control unit.

(8)

(8)

Section-D

7. (a)

(b)

Draw a block diagram depicting the architecture of 8085. Discuss the various

registers available with their specific purpose(s).

What is interrupt driven i/o? Explain in detail.

(10)

(6)

8. Discuss various memory types in detail. (16)

Section-E

9(a) What are De-Morgan’s Laws? (2)

(b) What are logic gates? What is the use of a truth table? (2)

(c) What is the difference between a machine and instruction cycle? (2)

(d) What is the advantage of DMA? (2)

(e) What is an associative memory? (2)

(f) What is the problem of a glitch? (2)

(g) What is duality? (2)

(h) What is an addressing mode? (2)