identify any error(s) in the algorithm by using the completed trace table

show understanding that the set of instructions are grouped into instructions for: data movement (register to main memory and vice versa), input and output of data, arithmetic operations, unconditional and conditional jump instructions, compare instructions, modes of addressing: immediate, direct, indirect, indexed, relative (No particular instruction set will be expected but candidates should be familiar with the type of instructions given in the table on page 21.)

show understanding of how the performance of a binary search varies according to the number of data items