Sample_Final3_Ans

# Sample_Final3_Ans - 1 Mark each of the following statement...

This preview shows pages 1–4. Sign up to view the full content.

1. Mark each of the following statement TRUE or FALSE (10 points, 1 point each) (a) Any Boolean function can be implemented using multiplexers alone. f) (b) A Moore machine usually has fewer states than an equivalent Mealy machine. ~.' (c) The number of inputs a gate can have is arbitrary. ~ ~ 1 ~~ :... ([) (d) Overflow can only occur if adding two numbers of the same sign. f[) ~ For D latch, output oscillation will not occur since it has only one input.~ ~ (f) F~ a NAND gate in positive logic, what logic operation would the gat_ej£erform . tL ifli.h~negative logic were applied instead? j1pf-T/ F r- N~:. (g) The frequency of the output of a T FF is half that of its input. (t) (h) Th1~~ry representation for 7 as a unsigned number, signed number, or a ASCII cE::) character are all the same. 0 '1 6 7 31 (i) a fg'N ID81"":questlOns 011 a,a.;a.fl~~r1 topics: MAR v. MBR!_RtarbjiRtQrr1i]3til ??? j , (~ -d-~4<-r/~;dJ~r t7K :d- /K.l1 ~ ~-~~ cdf! ..w 4 ~ tU ? h<- #-t: ~ ~ k.~ () -d ~~,M;l t-40~ -I- NAJ'b - N A,tJ]) :::;:. . - /I (};2 --- , p..-rJp '--- f}I X vi - f'JotZ-. 'I: Y I - l L..-L it \ L i-f #- H- (..,. H- U-L-- H-- 1-1-1 H H-H L. 1-'- HI

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
2. Given A=1O10l = 2- f I 0 B=11001 ~ Z 5 I(] A and B are unsigned numbers _(8 bits per numbe0/Represent A and g in 2's comple- ment signed number representation~~ C :B.;Ip~:form the operations A+B, and A+C, where all the numbers are in 2's complement signed representation. Give your answers in decimal. Does overflow in each case? (10 points). Of) I (}; 0 (), @ 6 D I I r A -= -.!J00 I 0 I CJ ( A -=- (!) [) 0 ( tf) ((;) ( E:> -;:: DOO I I 00 Ie.-=- I ( (lJ Of r I - () V I 0 {I ( 0 '], , I I I ,I I , () 6 r = - ("DO 0 0 ( 00 Z ( ) I "2 F C, G .::::-- 6 4 It::> -- ~ 4«.7 ~+ 2 E./b 4 biD ~6+
3. Consider the following logic expression. You are to use Boolean

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 10

Sample_Final3_Ans - 1 Mark each of the following statement...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online