In the MAC address table, a dynamic RAM is utilised to store MAC addresses. Assume the table size is 8000 and the memory access time is 100 nanoseconds. What is the worst-case look-up time if a binary search is employed to locate an address?

Systems Architecture
7th Edition
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Stephen D. Burd
Chapter9: Computer Networks
Section: Chapter Questions
Problem 16VE
icon
Related questions
Question

In the MAC address table, a dynamic RAM is utilised to store MAC addresses. Assume the table size is 8000 and the memory access time is 100 nanoseconds. What is the worst-case look-up time if a binary search is employed to locate an address?

Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Properties of Different Architectures
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning