GATE CS 2024 | Set 1 | Question: 32 Consider the following recurrence relation: 𝑇(𝑛) = {√𝑛𝑇(√𝑛) + 𝑛)
GATE CS 2024 | Set 1 | Question: 32
Consider the following recurrence relation:
𝑇(𝑛) = {√𝑛𝑇(√𝑛) + 𝑛 for 𝑛 ≥ 1, 1 for 𝑛 = 1.
Which one of the following options is CORRECT?
(A)𝑇(𝑛) = Θ(𝑛 log log 𝑛)
(B)𝑇(𝑛) = Θ(𝑛 log 𝑛)
(C)𝑇(𝑛) = Θ(𝑛2 log 𝑛)
(D)𝑇(𝑛) = Θ(𝑛2 log log 𝑛)
Ans: (A)
0:00 Intro & Question
0:29 Solution
----------------------------------------------------
📗👩🏫Math Lecture for GATE CS • Mathematics Lectures for GATE CSE by ...
❓🙋♀️Math GATE PYQ : • Mathematics GATE CSE PYQ (2010-2024) ...
----------------------------------------------
❓🙋♀️GATE General Aptitude (GA) solved by Monalisa • General Aptitude PYQ solved by Monali...
----------------------------------------------------------------
📘👩🏫Algorithm Lectures : • Algorithm Lectures for GATE CSE by Mo...
❓🙋♀️Algorithm GATE PYQ: • Algorithm GATE CSE PYQ (2010-2024) so...
----------------------------------------------------------------
📙👩🏫Compiler Design Lectures : • Compiler Design Lectures for GATE Com...
❓🙋♀️Compiler Design PYQ : • Compiler Design PYQ(2010-2024) GATE C...
----------------------------------------------------------------------
📔👩🏫Theory Of Computation Lectures • TOC (Theory of Computation) Lectures ...
❓🙋♀️TOC GATE PYQ: • TOC (Theory of Computation) GATE CSE ...
-------------------------------------------------------------------
📒👩🏫Data Structure Lecture: • Data Structure Lecture for GATE Compu...
❓🙋♀️Data Structure PYQ: • Data Structure GATE CS PYQ(2010-2024)...
-----------------------------------------------------------------------
#gate_cs #gate #aptitude #generalaptitude #gate2024 #gateda #monalisacs #datascience #hashing