With a suitable parallel processor, a search for the largest of 1,000,000 numbers requires (2*lg N), or ____ steps.
A)1
B)500
C)40
D)1,000,000

Name: With a suitable parallel processor, a search for the largest of 1,000,000 numbers requires (2*lg N), or ____ steps. A)1 B)500 C)40 D)1,000,000
Brand: Quizplus
Rating: 4.8 (43 reviews)

Question

Quizplus · Accepted Answer

The correct answer is based on the formula given, which is (2*lg N). Here, N = 1,000,000. The logarithm base 2 of 1,000,000 is approximately 20, so (2*lg N) = 2*20 = 40 steps.

With a Suitable Parallel Processor, a Search for the Largest