Given a sequence of integers x1, . . . , xn (possibly including negative integers) and an interval of coordinates I = [i, j], write xI to denote the sum P i≤k≤j xk. Give a linear time algorithm to find the interval that maximizes xI .

the largest number of the four options is 1.8 x 10-2

you have it in scientific notation.

1.80 x 10-6   = 0.00000180

1.80 x 10-4   = 0.000180 (bigger, or "less small", than the former one)

so

1.8 x 10-2       = 0.0180. as you see. the "less small", or the biggest one of them all.

as you have negative exponent, it means you are dividing 1.8 by 100 (i.e. moving the dot towards left, two times).

if you had positive exponent for the scientific notation, power of tenths, you would be multiplying times 100 (moving the dot towards right) as below:

1.8 x (10)2 = 180

so. if you have negative exponent in scientific notation, move the dot toward left. if it is positive, toward right as many times the exponent tells you.

x is the total time in minutes for the free response

you are given number of questions as 15 - m and time per item as 8 minutes

to find x multiply the two givens together:

x = 8 * (15-m) = 8(15-m)