NOVEMBER 2013 51301/SAU1A

Time : Three hours Maximum : 75 marks

SECTION A — (10 × 2 = 20 marks)

Answer any TEN questions.

All questions carry equal marks.

1. List the characteristics of a computer.

2. Define ‘Operating System’.

3. What is the decimal equivalent of binary 1011.11?

4. Define ‘Binary Logic’.

5. Explain the operation of a NAND gate with truth

table.

6. Define the dual of any statement S in a Boolean

algebra B.

7. Prove the theorem of Boolean algebra x + 1 = 1 .

8. Define ‘combinational circuits’.

9. What is an encoder?
10. What is a decoder?

11. What is arithmetic and logic unit?

12. List the set of micro-operations for the

accumulator.

SECTION B — (5 × 5 = 25 marks)

Answer any FIVE questions.

All questions carry equal marks.

13. Discuss about computer language.

14. Discuss about error-detection, excess-3 and 2421

codes with an example.

15. Convert the expressions to sum-of-products term:

(A ′ + C) (A ′ + B′ + C′) (A + B′) .

16. Explain any five basic theorems of Boolean

algebra.

17. Explain JK Master-slave flip-flop.

18. Draw the block diagram of a 4-to-1-line

multiplexer and explain the operation by means of
a function table.

19. Explain the design of logic circuit.

2 51301/SAU1A
 SECTION C — (3 × 10 = 30 marks)

Answer any THREE questions.

All questions carry equal marks.

20. Explain the detailed block diagram for computer.

21. Discuss about 1’s, 2’s, 9’s and 10’s complements

with suitable examples.

22. Use a Karnaugh map to find a minimal sum for

E = y′t′ + y ′z′ + y z t′ + x ′y′z t and implement them
in universal logic.

23. Draw the logic and block diagram of a full adder

and explain the operation by means of a truth
table.

24. Explain the design of control unit using

micro-program control.

———————

3 51301/SAU1A