A database contains 1,000,000 records which can be sorted into ascending order by an ID number. We are searching for the record whose ID number is X. Suppose it takes 1 microsecond to compare one record with X. There are two implementations of the database: one uses a linear list, and one uses a binary search tree. Which statement is true?

Exprimer pour

Consider this program fragment:

i := 0;
sum := 0;
while i<n do
   { sum := sum + i;
     i := i + 1;
   }
a := sum;

Which of the following is a correct translation from high to low level?

Suppose R1 contains 00c6 and R2 contains 0dc1.

What is the effective address in this instruction?

lea  R2,8[R1]

Give the answer as a single hex word, with no $.

Example format of answer: f32b (four consecutive hex digits)