Data analysis question paper

Name

1.T(P) is taken by a program is the -----?

• compile time
• Run time
• compile and run time
• none of the above

2.Analyse the complexity of the following codes

• O(N)
• O(N*log(N))
• O(N * Sqrt(N))
• O(N*N)
• None of the above

3. Analyse the time complexity of the following codes

• O(N)
• O(Sqrt(N))
• O(N / 2)
• O(log N)
• None of the above

4..Analyse the time complexity of the following codes

• O(N)
• O(Sqrt(N))
• O(N / 2)
• O(log N)
• None of the above

5.Which of the following best describes the useful criterion for comparing the efficiency of algorithms?

• Time
• Memory
• None of the above
• Both time and memory

6.Algorithm A and B have a worst-case running time of O(n) and O(logn), respectively. Therefore, algorithm B always runs faster than algorithm A.

• True
• False

7.Find the time complexity of the following code snippet

• O(log n)
• O(N / 2)
• O(n llog n)
• None of the above

8.Why should we care about time complexitys?

• it can solve problem easily
• It can run method faster
• it makes softwares to be fast and smooth

9.write the output after appliying a PRIMS algorithm

• 10
• 12
• 13
• 15
• None of the above