A pipeline (pipeline(a)) has initially seven segments as listed in Table1.1. It is compared to three other pipelines; Pipeline(b), Pipeline(c) and Pipeline(d). Find each pipeline clock cycle time in nano seconds, the total executing time for the indicated n tasks and the speed up ratio; (nk)/(n+k-1). Name Segment1 Segment2 Segment3 Segment4 Segment5 Segment6 Segment7
t t1 t2 t3 t4 t5 t6 t7
time in ns 135 115 155 225 95 75 40
tasks n 315
a- Pipeline(a) uses the original five segments as shown in Table
b- Pipeline(b) is the same as pipeline (a) with t4, split into 3 identical segments.
C- Pipeline(c) is the same as pipeline (a) with t2 and t3, combined into one segment
d- Pipeline(d) is the same as pipeline (a) with t4, split into 3 identical segments while t2, and t3 are combined into one segment.

Your program will make use of long long int variables for all calculations. note: the use of long long int requires that you have c++11 support. you should have this automatically if you are using a newer version of visual studio. the support is there for gcc as well, but you may need the -std=c++11 or -std=c++0x compiler flag. you first need to read in the total number of seconds. there is no prompt for the read (that is, you just do the cin without using a cout to display a prompt). this is going to seem a little strange when you are running your program in your ide

Write a function called checkfactor that takes two arrays of positive numbers, firstnumberrow and secondnumberrow. checkfactor checks if the first entry in firstnumberrow is divisible by the first entry in secondnumberrow, and performs the same operation on the next array elements until all entries have been checked. all the numbers are positive and the number of entries in the arrays are the same. the function should return the identified divisible numbers in two row arrays named firstdivisible and seconddivisible. restrictions: branches or loops should not be used. the code must use the internal mod and logical functions. hint: the mod function should be used to determine if two numbers are divisible. ex: for num1 and num2 if mod(num1,num2) is 0, then the two numbers are divisible. this is matlab

1. ask the user how many questions are in the quiz. 2. ask the user to enter the key (that is, the correct answers). there should be one answer for each question in the quiz, and each answer should be an integer. e. g., 34 7 13 100 81 3 9 10 321 12 might be the key for a 10-question quiz. you will need to store the key in an array. 3. ask the user to enter the answers for the quiz to be graded. there needs to be one answer for each question. note that these answers do not need to be stored; each answer can simply be compared to the key as it is entered. 4. when the user has entered all of the answers to be graded, print the number correct and the percent correct. 5. add a loop so that the user can grade any number of quizzes with a single key. after the results have been printed for each quiz, ask "grade another quiz? (y/n)." note: you only have one array (the key). you are not creating a new key for each set of quiz answers.