Suppose we have a deeply pipelined processor, for which we implement a branch-target buffer for the conditional branches only. assume that the misprediction penalty is always four cycles and the buffer miss penalty is always three cycles. assume a 90% hit rate, 80% accuracy, and 10% branch frequency. how much faster is the processor with the branchtarget buffer versus a processor that has a fixed two-cycle branch penalty? assume a base clock cycle per instruction (cpi) without branch stalls of 1.

What is the algorithm for building a binary tree program

Write a program that begins by reading in a series of positive integers on a single line of input and then computes and prints the product of those integers. integers are accepted and multiplied until the user enters an integer less than 1. this final number is not part of the product. then, the program prints the product. if the first entered number is negative or 0, the program must print “bad input.” and terminate immediately. next, the program determines and prints the prime factorization of the product, listing the factors in increasing order. if a prime number is not a factor of the product, then it

Write a function named printfloatrepresentation(float number) that will print the floating point representation of a number using the format given below. (sign bit) exponent in binary (assumed bit).significandfor example if the number passed an argument is 71 yourprogram should print (0) 10000101 (1).00011100000000000000000similarly if the number passed to the function as argument is -71 the program should print (1) 10000101 (1).00011100000000000000000