Question

(MAC) A dynamic RAM is used to hold MAC address in the MAC address table. Suppose the table size was 8000 and that the memory access time was 100 ns. Assuming that a binary search was used to find an address, what would be the worst-case look-up time?

EXPERT ANSWER

A binary search algorithm takes the middle data of an arranged array and compares the data with what it is looking for.