If algorithm A and another algorithm B take log₂(n) and √n microseconds, respectively, to solve a problem, then the largest size n of a problem these algorithms can solve. respectively. in one second are_ and _.

Question

Question

This question was previously asked in

UGC NET Computer Science (Paper 2) 2020 Official Paper

Answer 1

The correct answer is option 2.
Explanation:

A microsecond is 10^-6 seconds. Hence, one second =10⁶microseconds

One hour=60x60x106= 3.6x10⁹microseconds

One month=2.592x10¹²microseconds

One century=3.1104x1015microseconds

f(n)=logn in this case,the largest value n such that logn <=10⁶.

We rewrite as, 2^logn<= 2^{(10)^6}

thus, 2^1000000= (2¹⁰)¹⁰⁰⁰⁰⁰= (10³)100000 = 10³⁰⁰⁰⁰⁰

Hence, log2(n) and √n, In one second

\({2^{{{10}^6}}}and\;{10^{{12}}}\) the value will be 10⁶ and 10⁶

Hence the correct answer is option 2.