What size dictionary can be accommodated by a spell-checker that uses 30 checks?
A)1.1 million words
B)1.1 billion words
C)1.1 trillion words
D)1.1 quadrillion words

Question

Quizplus · Accepted Answer

A spell-checker that uses 30 checks can accommodate a dictionary of 1.1 billion words, as it typically operates on a binary search algorithm, which can search through a list of items efficiently by repeatedly dividing the search interval in half. If a spell-checker can perform 30 checks, it can handle $2^{30}$ items, which equals approximately 1.1 billion.

What Size Dictionary Can Be Accommodated by a Spell-Checker That