Gate CS-2009 Question Paper With Solutions

Q. 4 The running time of an algorithm is represented by the following recurrence relation:

Gate CS-2009 Question Paper With Solutions

Which one of the following represents the time complexity of the algorithm ?

Gate CS-2009 Question Paper With Solutions

Answer: (A)

Explanation:

Gate CS-2009 Question Paper With Solutions

Learn More:   Gate EC-2020 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here