introduction to computer organization

==============================

The hamming code for the data " 11101011" will be Note : the first bit is the right most bit

a. 0111

b. 0110

c. 1100

d. Non of the choices

e. 0101

====

The speedup factor of a program if we use 8 processors and the fraction of the execution time involves code that is inherently parallel=0.8 roughly will be

a.2.3

b.4

c.3.3

d.1.5

e.non of choice

=====

suppose that y=2, a=3 , b=4, c=5. the value of y after execution the following code will be:

• load a
• mul b
• sub c
• jmplz m1 // if (acc <0) go to m1
• store y
• m1 sub b
• add c

Select one:

a.All choices wrong

b.8

c.5

d.7

e.3

====

In reference to access time to a two-level memory, a _________ occurs if an accessed word is not found in the faster memory.

a.miss

b.hit

c.line

d.tag