GATE 2024 Algorithms Foundation Quiz 66

Consider the following statement:

S1 : f(n) = O[f(n)]²

S2 : f(n) =

Which of the following statement(s) is/are correct?

An algorithm A with the time complexity of O(log log n) takes 200 seconds to execute the given data. B takes 150 seconds for the same algorithm on the same machine for a data size of 256. The data size of A is_____.

Which of the given statement(s) on asymptotic notations is/are CORRECT ?

Find the solution to the following recurrence given that n is a power of 2.

Which of the following is True?