2) Write a for loop over the index i. This for loop will execute a piece of code for 20 times, each time producing an array of 100 random numbers and storing it in a new variable called ‘variable_i’. As a result, when the for loop is finished running, there should be 20 variables stored in your workspace named variable_1 to variable_20 each containing 100 random numbers. (Take a screenshot of your code and a screenshot of your workspace showing the 20 variables in your workspace.). Now Create a matrix of size 100x20 and call it ‘A’. Fill the columns of ‘A’ with the 20 variables (variable_1, …, variable_20). Hint: use variable_{loop index}

Advantages and disadvantages of binary system

When making changes to optimize part of a processor, it is often the case that speeding up one type of instruction comes at the cost of slowing down something else. for example, if we put in a complicated fast floating-point unit, that takes space, and something might have to be moved farther away from the middle to accommodate it, adding an extra cycle in delay to reach that unit. the basic amdahl's law equation does not take into account this trade-off. a. if the new fast floating-point unit speeds up floating-point operations by, on average, 2ă—, and floating-point operations take 20% of the original program's execution time, what is the overall speedup (ignoring the penalty to any other instructions)? b. now assume that speeding up the floating-point unit slowed down data cache accesses, resulting in a 1.5ă— slowdown (or 2/3 speedup). data cache accesses consume 10% of the execution time. what is the overall speedup now? c. after implementing the new floating-point operations, what percentage of execution time is spent on floating-point operations? what percentage is spent on data cache accesses?

Learning sign language is an example of a(n) learning sign language is an example of a(n)