Scribd
Upload
26 views1 page

9A04401 Switching Theory & Logic Design1

This document contains exam questions for a Switching Theory and Logic Design course. The questions cover topics like ASCII code, binary number systems, Boolean algebra, logic gates, half adders, programmable logic devices, flip-flops, finite state machines, and state transition diagrams. Students are instructed to answer any five of the eight questions provided.

Uploaded by

subbu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
26 views1 page

9A04401 Switching Theory & Logic Design1

This document contains exam questions for a Switching Theory and Logic Design course. The questions cover topics like ASCII code, binary number systems, Boolean algebra, logic gates, half adders, programmable logic devices, flip-flops, finite state machines, and state transition diagrams. Students are instructed to answer any five of the eight questions provided.

Uploaded by

subbu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Code: 9A04401 R09

B.Tech III Year I Semester (R09) Supplementary Examinations June 2015


SWITCHING THEORY AND LOGIC DESIGN
(Mechatronics)
Time: 3 hours Max. Marks: 70

Answer any FIVE questions


All questions carry equal marks
*****
1 (a) Explain the ASCII code with table.
(b) Why the computer hardware works for binary number system? List the binary, Octel
and hexa number for decimal 0 to 15.

2 (a) Prove that AND-OR network is equivalent to NAND-NAND network.


(b) Minimize the following Boolean expressions:
(i)
(ii) .
(iii)

3 (a) Simplify Boolean function for minimal SOP using K- map

(b) Simplify Boolean function using k-map:


(i) F(A, B, C) = .
(ii) F(A, B, C) = .

4 (a) Realize half adder combinational circuit with two binary inputs and show that a half
adder can also be realized in universal logic by using only NAND and only NOR.
(b) Design decodes using NOR.

5 (a) Write a short note on PLD.


(b) Realize the given function using PROM of size
m(1, 4, 6, 7);

6 (a) With a neat switch explain JK master slave flip-flop.


(b) What do you mean by triggering? Explain various triggering modes with example.

7 (a) Explain mealy model with logic diagram.


(b) Explain more model with logic diagram.

8 (a) Explain the symbols used in ASM chart with neat diagram.
(b) Obtain the ASM chart for the following state transition.
State for if = 00, go to ; if = 01, goto ; if = 10 goto otherwise .

*****

You might also like