1.

For two variables, n=2 , the number of possible Boolean functions is (a) (b) (c) ( ) (e) 4 8 16 12 2.

2.

!he one ma"or a vanta#e of $%&' is its, (a) (b) (c) ( ) (e) (ow propa#ation ela) *i#h propa#ation ela) +er) low propa#ation ela) +er) hi#h propa#ation ela) ,o ela).

-.

64. memor) contains how man) wor s of 8 bits each/ (a) (b) (c) ( ) (e) 60,0-6 64,0-6 60,4-6 60,046 60,006.

4.

!he simplest wa) to etermine cache locations in which to store memor) bloc1s is the, (a) (b) (c) ( ) (e) 2ssociative %appin# techni3ue 4irect %appin# techni3ue 'et52ssociative %appin# techni3ue 6n irect %appin# techni3ue 7a#in# techni3ue. ition is,

0.

!he sum of 56 an 51- usin# 28s complement a (a) (b) (c) 11199911 11119911 11991199

( ) (e) 6.

11191191 11199991.

:hich one of the followin# $7; re#isters hol s the a ress of the instructions (instructions in the pro#ram store in memor)) to be e<ecute ne<t/ (a) (b) (c) ( ) (e) %2= (%emor) a ress re#ister)

%B= (%emor) Buffer =e#ister) 2$ (2ccumulator) 6= (6nstruction =e#ister) 7$ (7ro#ram $ounter).

>.

:hat are the ma"or components of a $7;/ (a) (b) (c) ( ) (e) $ontrol ;nit, =e#ister 'et, 2rithmetic (o#ic ;nit $ontrol ;nit, %emor) ;nit, 2rithmetic (o#ic ;nit %emor) ;nit, 2rithmetic (o#ic ;nit, 2u<iliar) %emor) =e#ister 'et, $ontrol ;nit, %emor) ;nit =e#ister 'et, $ontrol ;nit, 2u<iliar) %emor).

8.

?iven the characteristic table of a @. flip5flop, fin the missin# output value. @ 9 9 1 1 (a) (b) (c) ( ) (e) . 9 1 9 1 A(t) A8(tB1) 1 A8(t) A(tB1). A(t+1) A(t) 9 1 555

C.

:hat is A, when ' = 1 an = = 1 for '= flip5flop/ (a) ,o $han#e

(b) (c) ( ) (e) 19 .

$lear to 9 'et to 1 $omplement of previous output 6n eterminate.

:hat oes ! stan s for in ! flip5flop/ (a) (b) (c) ( ) (e) !op !)pe !o##le !ic1le !ip.

Answers
1. 2nswer D (a)

=eason D !he 2,4, an &= functions are onl) two of a total of 16 possible functions forme with two binar) variables. !herefore, for two variables n=2, an the number of possible Boolean functions is 16. 2. 2nswer D (a)

=eason D !his means that it is not practical for use in s)stems re3uirin# hi#h5spee operations. !he characteristic parameters for the $%&' #ate epen on the power suppl) volta#e +44 that is use . !he power issipation increases with increase in volta#e suppl). !he propa#ation ela) ecreases with increase in volta#e suppl) an the noise mar#in is estimate to be about 49E of the volta#e suppl) value. -. 2nswer D (a)

=eason D $onsi er the 295bit lo#ical a ress. !he 45bit se#ment number specifies one of 16 possible se#ments. !he 85bit pa#e number can specif) up to 206 pa#es, an the 85bit wor fiel implies a pa#e siFe of 206 wor s. !his confi#uration allows each se#ment to have an) number of pa#es up to 206. the smallest possible se#ment will have one pa#e of 206 wor s. !he lar#est possible se#ment will have 206 pa#es, for a total of 206G206 = 60,0-6 which means 64. wor s. 4. 2nswer D (b)

=eason D 2ssociative memories are e<pensive compare to ran om5access memories because of the a e lo#ic associate with each cell. !herefore, the simplest wa) to etermine cache locations in which to store memor) bloc1s is the 4irect %appin#. 0. 2nswer D ( )

=eason D 28s complement of 56 = 11111919 28s complement of 51- = 11119911 2 the two numbers in their 28s complement form, inclu in# their si#n bits an an) carr) out of the si#n (leftmost) bit position. 'o the answer is 11191191 (51C). 56 11111919 iscar

51- 11119911 5555555555555555555555 51C 11191191 6. 2nswer D (e)

=eason D 7ro#ram $ounter (7$) 1eeps trac1 of the instruction of the pro#ram store in memor). >. 2nswer D (a)

=eason D !he ma"or components of $7; are $ontrol ;nit, =e#ister 'et, an 2rithmetic (o#ic ;nit. 8. 2nswer D ( )

=eason D !he ne<t state is a complement state. C. 2nswer D (e)

=eason D :hen = = 1 an ' = 1, race will alwa)s en with %aster (atch in the lo#ic 1 state, but this will not be certain with real components. 19. 2nswer D (c)

=eason D !o##le flip5flop as it chan#es its output on each cloc1 e #e.