Computer Science, asked by siddharthmak23, 7 months ago

For a 2 bit pattern history associated with a 1 bit branch predictor, identify a shortest
pattern of taken and not taken branches that when repeated forever will result in a 0% prediction hit rate (again, assuming no aliasing of any kind). Your answe
should
be of a form of some pattern of T and N Explain your answer.

Answers

Answered by simadey12369
0

Answer:

yes

Explanation:

because I am incredibly

Similar questions