NOVEMBER 2015 51301/SAU1A

Time : Three hours Maximum : 75 marks

PART A — (10  2 = 20 marks)

Answer any TEN questions.

1. What is a computer?
PoÛ GßÓõÀ GßÚ?
2. Define : Hardware.
Áßö£õ¸Ò – Áøμ¯Ö.
3. What is Operating System?
C¯UP Aø©¨¦ GßÓõÀ GßÚ?
4. What is a memory?
{øÚÁP® GßÓõÀ GßÚ?
5. Define radix?
Radix Áøμ¯Ö.
6. What is meant by Basic logic gates?
Basic logic gates GßÓõÀ GßÚ?
7. State Demorgan’s Theorem.
Demorgan’s Theorem Áøμ¯Ö.
8. What is meant by Excess three codes?
Excess three codes GßÓõÀ GßÚ?
1 51301/SAU1A
9. What are Flip Flops?

Flip Flops GßÓõÀ GßÚ?

10. Define : Counter.

Counter – Áøμ¯Ö.

11. What do you mean by Combinational Circuit?

Combinational Circuit £ØÔ }ú AÔÁx ¯õx?

12. What is meant by Multiplexer?

Multiplexer GßÓõÀ GßÚ?

PART B — (5  5 = 25 marks)

Answer any FIVE questions.

13. Explain about the Fundamentals of computers.

Fundamentals of computers £ØÔ ÂÍUSP.

14. Write short notes on basic logic gates with truth

tables.

Basic Logic Gates ©ØÖ® truth tables £ØÔ ]Ö

SÔ¨¦ GÊxP.
15. Minimization of Boolean Expressions
W  x  y  x  y  .

RÌPsh §¼¯ß expressions–ø¯ _¸USP.

W  x  y  x  y  .

2 51301/SAU1A
16. Simplify the Boolean expression using K-map.
F  A C  A B  AB C  BC.

RÌPsh §¼¯ß expression–ø¯ K-map–ø¯

£¯ß£kzv GÎuõUSP.
F  A C  A B  AB C  BC.

17. Explain the principles of Synchronous Counter

with neat diagram.

Synchronous Counter £ØÔ öuÎÁõÚ £hzxhß

ÂÍUSP.

18. Discuss about Decoders with neat diagram.

Decoders £ØÔ öuÎÁõÚ £hzxhß ÂÁ›.

19. Describe about the designing circuits using

ROM/PLA with details.

Designing circuits using ROM/PLA £ØÔ

ÂÁ›UPÄ®.

PART C — (3  10 = 30 marks)

Answer any THREE questions.

20. Discuss about the Operating Systems in detail.

Operating Systems £ØÔ Â›ÁõP ÂÁõvUPÄ®.

3 51301/SAU1A
21. Convert the followings :
RÌPshÁØøÓ ©õØÖP :
(a) 53.62510  ?2
(b) 444.456 10  ?8
(c) B 2F 816  ? 10
(d) 1011010110 2  ?16
22. Design a JK Flip Flop with logic circuit and
explain.
JK Flip Flop–ø¯ logic circuit–Ehß Áøμ¢x
ÂÍUPÄ®.
23. Find the minimal sum of products for the Boolean
expression f  1,2,3,7,8,9,10,11,14,15  using the

Quine-Mc Cluskey method.
Quine-Mc Cluskey method–ø¯ £¯ß£kzv
minimal sum of products
f  (1,2,3,7,8,9,10,11,14,15) Boolean expression–US
Psk¤i.
24. What do you mean by adder? Briefly explain about
the full adder with logic diagram and truth table.
Adder £ØÔ }º AÔÁx ¯õx? Full adder £ØÔ
öuÎÁõÚ logic diagram ©ØÖ® truth table Ehß
ÂÍUSP.
——————

4 51301/SAU1A