Answer :
Answer:
b) branch history table
Explanation:
Branch prediction in computer architecture which works by predicting or guessing which way an operation (conditional operation: like an if-else-operation) will go before it occurs. This operation is performed by a digital circuit known as branch predictor. Branch history table contains the address of the branch instruction. In branch history table, when there is a branch instruction, a bit is store to indicate if the branch was recently taken.
Answer:
b) branch history table
Explanation:
Branch history table is also known as BHT. It is a table which is usually two bit, counters saturating and is recorded by part of the branch address which is low bit of address. It was first put forward during the middle of 1980s. Branched history table makes use of tagged structure. It is used to predict an operation.