Question-67

Question-67

What is the largest n for which one can solve within one second using an algorithm that requires f(n) bit operations, where each bit operation is carried out in seconds, with these functions f(n) ?

For questions (a) to (c) , enter the exact answers. Enter brackets around exponents. Round your answers down to the nearest integer for all other parts. Note that log n = log₂ n.

a)     log n

n = ?

 

b)    n

n = ?

 

c)     n. log n

= ?

 

d)    

n = ?

 

e)    

n =?

 

Solution

a)log n =

n =

 

b) n =

 

c) n.log n =

Log =

=

 

d)  =

n =

~ 10000

 

e)  =

Log = log

n = 8. Log 10

~ 26