B 812 NRR

B.Sc. DEGREE EXAMINATION, SEPTEMBER 2020.

• First Semester

Computer Science

DIGITAL ELECTRONICS AND COMPUTER

ORGANIZATION

(For 2017 ~ 18 to 2018-19 Batches)

Tirne : Three hours . Maxin1um : 75 marks

SECTION A - (10 x 2 = 20 marks)

Answer ALL the questions.

1. Convert the following: (0.6875)10 = (?)2 •

2. State Demorgan's Theorem.

3. Wbat is the difference between CMOS and TTL

logic families?

4. What are the advantages of .Diode Transistor

Logic (DCL)?

5. Write short note on-: Master slave flip flops.

6. Define flip flop.

7. What are n1ultipro cessors?

8. List the nan1es of various types of counters .

9. Write short note on : Cache Me111ory

10. Distingu ish between Random Access Men1ory and

Read Only Memory.

SECTIO N B - (5 x 5 = 25 1narks)

Answer Al.ii-' the question s choosing either (a) or (b).

11. (a) Convert hexadeci mal number 2AC5 ..D to

decirnal Number.

Or
(b) Using 9's complem ent subtract
(72532)10 - (3250)10.

12. (a) Obtain the simplifie d expressi on in sum of

product form using karnaug h map.
F(w, x, y, z) = ~(2, 3, 12, 13, 14, 15).

Or
(b) Obtain the simplifie d expressi on in sum of ·
product form f (x, y, z) = L(O, 2, 4, 5, 6).

2 B 812 NRR
 13. (a) How does Universal shift register work?
Explain with neat diagram.

Or
(b) Draw the logic diagram of full adder and
explain with its truth table.

14. (a) Briefly explain with neat sketch about the

functional modules of computers.

Or
(b) Elucidate about three types of bus structures
with block diagram .
•

15. (a) Briefly explain about the working principle

of magnetic disk with neat sketch.

Or
(b) Write short note on : Virtual Memories.

SECTION C - (3 x 10 = 30 marks)

Answer any THREE questions.

16. Simplify the following expression in product of

Sum. F(A, B, C, D) = rr(o, 1, 2, 3, 4, 10, 11).

17. Explain in detail about Transistor Transistor

Logic (TTL) family with its apphcations.

3 B 812 NRR
18. Exp lain · the seri al-in seri al-o ut and seri al-in and
para llel- out shif t regi ster s.

19. Eluc idat e the arch itec ture of tigh tly coup led and
loosely coup led mul tipro cess or with nea t diagran1.

20. Disc uss in deta il abo ut ,vor king prin cipl e of

(a) Stat ic Ran dom P""ccess Mem orie s (SRAM) and
\'b) Dvn ami c RA1\1's.
, .)

4 B 812 NRR
 B 812 N R
ION,'
B.Sc. 'D EG RE E EXAMINAT
2017.
NO VE l\1 BE R/ DE CE M BE R
Fi rs t Se m es te r
Co m pu te r Sc ie nc e
DI GI TA L EL EC TR ON IC S
(F or 2009 to 20.16 ba tc he s)
M ax im um : 100 m ar ks
T·im e : Th re e ho ur s
ar ks )
PA.RT A - (10. x 2 = 20 m
.
A ns w er ALL th e qu es tio ns
ste m ?
1. W ha t is Bi na ry nu m be r sy

2. W ha t is ad dr es s?
s.
3. De fin e do n' t ca re co nd iti on

4. W ha t is m ul tip le xe r?

5. W ha t .is fiip flop?

6. De fin e co un te rs .

7. W ha t .is st at e re du ct io n? .

8. De fin e su b tra ct or s.
 . '1
oolean functions .
B
What are
9.
. .10 . Define Decoders.
30 marks)
PABT B ~ (6 x 6 ==
uestions.
Answer any FIVE q
asic g at es .
Wnte short note on b
1.1 .
o n 't ca re co n d it io n s w it h example.
12. Describe abou
td

lain: H al f ad d er w ith n e a t d ia g ra m .
13. Exp
s on m
- u lt i leve l N O R circuits.
Give short note
14 .
fl ip flops.
. D iscu ss about th e ty p es o f
15.
E xp la in the st at e as si g n m.e n t.
16.
ip flops.
. Write sh o rt notes on tr ig g er in g of' fl
17
18. Write about st at
e eq,uation.

PART C - ~5 x 10 = 50 m a rk s )
es ti o n s. .
Answer ALL th e q u
. ns.
an fu. nct 1o
J.9 . . (a) Describe .about Boole
Or ·
si m . . -
(b) . Il lu st ra te an d p li fy th e fo llowing K-map
(i) I . (.
0, 12, 13}
(~) . m ABCD) "" {O, 2, 8,1
J[ m(ABCD
) _ o 1.,2, 8, 9,10)..+
- ( .,
· 1l d(3, 4, 5, 7).

2 B 812 NR
 20. (a) Discus s in detail about the code conversion.
Or
(b) Briefly explai n the multil evel NAND circuit s.

21. (a) Descri be about deci1nal adder.

Or

(b) Descri be the ROM.

22. (a) Expla in ill detail about maste r slave flip- .

flops.
Or

(b) Expla in about the clocked seque ntial

circuit s.

23. (a) Discus s in detail about the Flip flop

excita tion table.
Or

(b) Briefly explai n the design of BCD cou·nters.

3 B 8 12 NR
 B ~l :! \H
ft~~ nE UR~~F F' X.\ ~ll NX l'lON.
6.
~ ('Y E~ lHF H. P ECEl\lHKR ~01
t") l"$l 8t'l llt'~ ft'l"
(\, mp utt 'r SeiC'nl'f\
DI GIT ,-\L ELECTRONICS
lF rom 2009--10 Dnw ard s)
1\'In xim um : 100 ma rks
~im e : Yh ree ho ur~
PART A - (10 >-- 2 = 20 ma rks)
An sw er _-\LL the que stio ns.
.
_-\11 que sri ons car ry equ al Ma rks
50 wo rds .
Ea ch ans we r sho uld not exc eed
.
L Su btr act in bin ary: 11 10 01 2- 10 1h
,")
£.n.. \\h at is l\fap- me tho d?
er NO T Ga te.
3. Dr aw Tru th Table for an Inv ert
-l. Gi,-e the dual of Pi == x yz'+x 'y' z.
1
u. Lis t few app lic ati on s of !VIultiplexe
r.
 Compare Dyn:.1: .mic R..-\...\I with Static RA1,l . 17. \\r ill' nl,,n,t th,
~ 6.
"' l)\\\\\1.'\' .
I .
Enumerate some of the combinational ~ir~uit~.
\~ . \•:,1,\ t,\n l\w Sl :
8. \Yha t is 1\Iagnetic romparator?
p :\H'\' t
9. \Yhat is synchronous sequential ci..r~uit?.
.\ \\ ~\\
10. Define Cmmter.
U) . li,) Simµht\
PART B - (5 x 6 = 30 marks)
Answ er any FIVE questions.
\b) Shnp\if
11. Simplify the Boolean function: rnnp n\ \
F = x' ,•
•
7
,_,,. .... :t"''' <:- '+x·)
....._ •· J 1... x..· v z'
.. ""'..r:
1
- -..
<
Y- L
tho c, ,·1
12. Convert the decimal number 35.25 int.a binarv . • V 1
octal and hexadecimal number system. 20 . (n) Utnw 1
13. Explain the hierarchy of memory and distinguish (
between R.LWI and RO lVI.
14. Draw a logical diagram for BCD to excess-3 co_d e
converter.
_15. Explain the working of full adder and rnakc the
(b) \ mplt
circuit diagram using NAND g·ates.
OH, .
16. Explain the D-type positive-edge-trigger~d flip-flop nwt.h
with a diagram. circu
2 B 812 NR
17. Write about the State diagram of a 3-bit binary
counter.
18. Explain the State Assignment with an example.
PART C - .(5 x 10 = 50 marks)
Answer ALL the questions.
19.. (a) Simplify: F = A(B + C )+BC+ AC:
Or
(b) Simplify the following expression using K
map method
y= Lm(7,9,10,l l,12,13,14,1 5) · · and draw
the circuit. ·
20. (a) Draw block diagram for the following:
(i) Implementa tion of full-adder m
sum of products
(ii) Implementa tion of . a full-adder
with two half adders and an _OR gate.
· Or
(b) Implement F == A(B; CD)+ BC'using NOT,
OR, and AND gates with a block diagram
method and convert by multilevel NOR gate ·
circuits.
3 B 812 NR
 111111
:21. D ra w the logic di ag
(a ) ra m· of BCD - decim
decoder. Explain its op al
er at io ns .
, Or
(b) What do you m ea n by
M·u lti pl ex er ? Ex pl ai n
an d design 8: 1 multiple
xer.
22 . (a) .Explain clocked RS Fl ip
Flop:
(i) Logic di ag ra m (ii)
G ra ph ic symbol
(iii) Ch ar ac te ris tic ta bl e (iv) C ha ra ct er is tic
equation
. Or
(b) Explain analysis of Se
qu en tia l ci rc ui t w ith
an example an d dr aw st
at e ta bl e.
23 . (a) Explain Flip-Flop
Ex ci ta tio n ta bl es an d
Gha ra ct er dr aw
ist ic ta bl e for JK an d T Fl ip -P lo p. ·
Or
(b) Des ig n a co un te r th at · ha s a re pe at ed
sequence of six st at
es an d ex pl ai n w ith
excitation table, logic di
agra1n of co un te r and
st at e di ag ra m of co un te
r.
4
B 812 NR
 B 812 NR
B.Sc. DEGREE EXAMINATION, APRIL/MAY 2017.
Firs t Sem este r
Com pute r Science
DIGITAL ELECTRONICS
(Fro m 2009-10 onwards)
Tim e : Thr ee hou rs Max imu m : 100 mar ks
PART A- -(10 x 2 = 20 mar ks)
Ans wer ALL the ques tion s.
1. Con vert the octa l num ber (137.21) to its decimal
equi vale nt. .
2. Def ine Unicode.
3. Wh at is mea nt by Half -Sub trac tor?
4. Con vert the NAND logic diagr~m to AND-OR
diag ram .
5. Wri te shor t note s on Decoder.
6. Diff eren tiate betw een ROM and PROM.
--- What is meant by T Flip-flop?
7.
8.
Define Binary counter.
Draw a diagram for BCD Ripple Counter.
9.
10. Write the advantages of Johnson Counter.
PART B _- (5 x 6 = 30 marks)
Answer any FIVE questions.
11. Write a brief note on number case conversions
with example.
12. Discuss about magnitude comparator.
13. Explain the Encoder with truth table.·
14. Discuss about the timing relationships in a aster-
siave flip flop.
15. Write in detail about state diagra~.
16. Explain the excitation table for BCD counter.
. .
17.
How many don't care inputs are there in BCD
Adder?
18.
Explain the basic Logical Operations.
2 B812NR
 ......
~
PART C - (5 x 10 = 50 marks)
An sw er AL L the que stio ns.
es.
19. (a) Ela bor ate on Complement and its typ
Or
Algebraic
(b) Ex pla in the var iou s typ es of
Str uct ure s.
n of the
20. (a) Discuss in det ail abo ut the De riv atio
l
ula tion .
Bo ole an fun ctio n by Algebraic Ma nip
Or
ive - · OR
(b) De scr ibe in det ail abo ut the Exclus
and Eq uiv ale nce Fu nct_ions.
der and
21. (a) Dif fer ent iate bet we en Decimal Ad
BCD.A dde r.
Or
(b) Wr ite on Pro gra mm abl e Logic arr ay.
ail.
22. (a) Ex pla in the Sta te Eq uat ion s in det
Or
Fli p•F lop s 1n .
(b) _ Ex pla in the · Tri gge rin g . of
det ail.
3 B 812 NR
23 . (a) . Write detailed notes on
Se qu en tia l circuits.
Or
(b) What is the difference be tw
ee n se ria l an d
parallel tra ns fer ? W ha t typ
e of Re gis ter is ..
used in ea ch case?
4
D 01 n