Suppose you have a RISC machine with a 2 GHz clock (i. e., the clock ticks 2 billion times per second). This particular computer uses an instruction cache, a data cache, an operand fetch unit, and an operand store unit. The instruction set includes simple instructions with the following timings:

set reg, immed 2 clock cycle
loop label 3 clock cycles
add reg, immed 1 clock cycle
add reg, reg 3 clock cycles
load reg, mem 3 clock cycles

Assume that the following code fragment is used to sum the element of a numeric array. If the initialization code has already executed (i. e. the SET instructions have already finished execution) how many array elements can be processed in 2.4 ms?

Ihave 25$ on an itunes card and i need to buy spotify premium, i have no other payment method.

When you type the pwd command, you notice that your current location on the linux filesystem is the /usr/local directory. answer the following questions, assuming that your current directory is /usr/local for each question. a. which command could you use to change to the /usr directory using an absolute pathname? b. which command could you use to change to the /usr directory using a relative pathname? c. which command could you use to change to the /usr/local/share/info directory using an absolute pathname? d. which command could you use to change to the /usr/local/share/info directory using a relative pathname? e. which command could you use to change to the /etc directory using an absolute pathname? f. which command could you use to change to the /etc directory using a relative pathname?

The initial tableau of a linear programming problem is given. use the simplex method to solve it. x 1 x 2 x 3 s 1 s 2 z 1 2 4 1 0 0 8 3 4 1 0 1 0 10 minus3 minus12 1 0 0 1 0 the maximum is nothing when x 1equals nothing, x 2equals nothing, x 3equals nothing, s 1equals3, and s 2equals0. (be sure to simplify to lowest terms if necessary.)