Answer:
A hash function is a function which when given a key, generates an address in the table. The example of a hash function is a book call number. Each book in the library has a unique call number. ... The later is always possible only if you know (or approximate) the number of objects to be proccessed.
Explanation:
A
I think the answer would be C :)
Explanation:
A.)
we have two machines M1 and M2
cpi stands for clocks per instruction.
to get cpi for machine 1:
= we multiply frequencies with their corresponding M1 cycles and add everything up
50/100 x 1 = 0.5
20/100 x 2 = 0.4
30/100 x 3 = 0.9
CPI for M1 = 0.5 + 0.4 + 0.9 = 1.8
We find CPI for machine 2
we use the same formula we used for 1 above
50/100 x 2 = 1
20/100 x 3 = 0.6
30/100 x 4 = 1.2
CPI for m2 = 1 + 0.6 + 1.2 = 2.8
B.)
CPU execution time for m1 and m2
this is calculated by using the formula;
I * CPI/clock cycle time
execution time for A:
= I * 1.8/60X10⁶
= I x 30 nsec
execution time b:
I x 2.8/80x10⁶
= I x 35 nsec
Answer:
she sells sea shells by the sea shore
Explanation:
