Suppose you have a risc machine with a 2.8 ghz clock (i. e., the clock ticks 2.8 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 6 clock cycles add reg, immed 2 clock cycle add reg, reg 3 clock cycles load reg, mem 4 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 3.2 ms? round your answer to the nearest integer. recall that 1 ms = 0.001 seconds. also assume that there are no physical memory limitations, implying that the array can be as large as desired. set r1, 0 ; initialize sum set r2, max_size ; initialize loop counter set r3, @list ; initialize array pointer more: load r4, \textrm{3.0} ; fetch current list element add r1, r4 ; add current list element add r3, 4 ; move array pointer to next element loop more ; auto-decrement r2, jump to more if r2 ! = 0

Drag each label to the correct location on the imagelist the do’s and don’ts of safeguarding your password.keep yourself loggedin when you leave your computer.don’t write your password down and leave it whereothers can find it.share your password with your friends.each time you visit a website,retain the cookies on your computer.use a long password with mixed characters.

Consider a slotted aloha system, where the time slot equals the fixed duration of each packet. assume that there are 4 stations a,b,c,d sharing the medium. (a) stations a,b,c,d receive one packet each from higher layers at times 1.3, 1.5, 2.6,5.7 respectively. show which transmissions take place when, according to the slottedaloha protocol; describe all transmissions until all four packets have been successful.when needed, each station has access to the following sequence of random number, provided by a random number generator and drawn uniformly between 0 and 1: (1) station a draws numbers: 0.31, 0.27, 0.78, 0.9, 0.9, 0.11, 0. (2) station b draws numbers: 0.45, 0.28, 0.11, 0.83, 0.37, 0.22, 0. (3)station c draws numbers: 0.1, 0.2, 0.3, 0.4, 0. (4) station d draws numbers: 0.36, 0.77, 0.9, 0.1, 0.1, 0.1, 0.1, 0. (b) in slotted aloha, a station transmits in each time slot with a given probability. what probabilities would you assign to each of the four stations so as to: (i) maximize the efficiency of the protocol? (ii) maximize fairness among the four stations? (c) will the efficiency increase or decrease if we modify slotted aloha as follows: (i) get rid of slots and allow stations to transmit immediately? (ii) implement carrier sensing? (iii) implement collision detection? (iv) implement collision avoidance?

Before you record your own voice, you should a. record other people's voices b. warm up and practice difficult names c. listen to your favorite songs d. read a transcript of a good radio news segment