Assume your computer is able to complete 1 double floating-point operations per cycle when operands are in registers and it takes an additional delay of 10 cycles to read/write any operand from/to memory. The clock frequency of your computer is 4 Ghz. How long (in seconds) will it take for your computer to finish the following algorithm DGEMM0 and DGEMM1 respectively for n=2000? How much time (in seconds) is wasted on reading/writing operands from/to memory for both algorithms? Assume arithmetic computations and memory transfers do not overlap.

Create a function (prob3_6) that will do the following: input a positive scalar integer x. if x is odd, multiply it by 3 and add 1. if the given x is even, divide it by 2. repeat this rule on the new value until you get 1, if ever. your program will output how many operations it had to perform to get to 1 and the largest number along the way. for example, start with the number 3: because 3 is odd, we multiply by 3 and add 1 giving us 10. 10 is even so we divide it by 2, giving us 5. 5 is odd so we multiply by 3 and add one, giving us 16. we divide 16 (even) by two giving 8. we divide 8 (even) by two giving 4. we divide 4 (even) by two giving 2. we divide 2 (even) by 2 to give us 1. once we have one, we stop. this example took seven operations to get to one. the largest number we had along the way was 16. every value of n that anyone has ever checked eventually leads to 1, but it is an open mathematical problem (known as the collatz conjectureopens in new tab) whether every value of n eventually leads to 1. your program should include a while loop and an if-statement.

What is the total number of time zones that can be configured to show by default in a calendar in outlook 2016?

Approximately what portion of global employers tends to use social media websites to hire new employees?