NIELIT Scientific Assistant A 2020 November: 101

gatecse asked Dec 9, 2020 • recategorized Jul 5, 2022 by Lakshman Bhaiya

905 views

3 votes

What is the time complexity of the following recursive function?

int ComputFun(int n)
{
    if(n<=2)
       return 1;
    else
        return (ComputFun(floor(sqrt(n)))+n);
}

$\Theta(n)$
$\Theta(\log n)$
$\Theta(n\log n)$
$\Theta(\log \log n)$

Algorithms
nielit-sta-2020
algorithms
recursion
time-complexity

+ –

gatecse asked Dec 9, 2020 • recategorized Jul 5, 2022 by Lakshman Bhaiya

gatecse

905 views

See all

0 Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

1 votes

$\text{Option D is correct.}$

GATE2007-45

Hira Thakur answered Dec 11, 2020 • edited Mar 7, 2021 by Hira Thakur

Hira Thakur

See all

0 Please log in or register to add a comment.

Voting & Accepting an answer helps improve the community

Answer:

← Previous Next →

← Previous in category Next in category →

Related questions

1 votes

1 answer

gatecse asked Dec 9, 2020

669 views

NIELIT Scientific Assistant A 2020 November: 64
Which of the following is a correct time complexity to solve the $0/1$ knapsack problem where $n$ and $w$ represents the number of items and capacity of knapsack respectively? $O(n)$ $O(w)$ $O(nw)$ $O(n+w)$

Which of the following is a correct time complexity to solve the $0/1$ knapsack problem where $n$ and $w$ represents the number of items and capacity of knapsack respecti...

gatecse

669 views

gatecse asked Dec 9, 2020

Algorithms
nielit-sta-2020
algorithms
dynamic-programming
easy
knapsack-problem
time-complexity

+ –

1 votes

1 answer

gatecse asked Dec 9, 2020

546 views

NIELIT Scientific Assistant A 2020 November: 63
What is the product of following matrix using Strassen's matrix multiplication algorithm? $ A=\begin {bmatrix} 1&3\\ 5 &7 \end{bmatrix} \;\;\;\;\;\; B=\begin {bmatrix} 8&4\\ 6 &2 \end{bmatrix} $ $C_{11}=80; C_{12}=07;C_{21}=15;C_{22}=34$ ... $C_{11}=15; C_{12}=07;C_{21}=80;C_{22}=34$ $C_{11}=26; C_{12}=10;C_{21}=82;C_{22}=34$

What is the product of following matrix using Strassen’s matrix multiplication algorithm?$$ A=\begin {bmatrix} 1&3\\ 5 &7 \end{bmatrix} \;\;\;\;\;\; B=\begin {b...

gatecse

546 views

gatecse asked Dec 9, 2020

Algorithms
nielit-sta-2020
algorithms
divide-and-conquer

+ –

1 votes

1 answer

gatecse asked Dec 9, 2020

410 views

NIELIT Scientific Assistant A 2020 November: 65
Finding the location of the element with a given value is : Traversal Search Sort None of the options

Finding the location of the element with a given value is :TraversalSearchSortNone of the options

gatecse

410 views

gatecse asked Dec 9, 2020

Algorithms
nielit-sta-2020
algorithms
searching

+ –

1 votes

1 answer

gatecse asked Dec 9, 2020

630 views

NIELIT Scientific Assistant A 2020 November: 79
Which of the following algorithms can be used to most efficiently find whether a cycle is present in a given graph? Prim’s Minimum Spanning Tree Algorithm Breadth First Search Depth First Search Kruskal’s Minimum Spanning Tree Algorithm

Which of the following algorithms can be used to most efficiently find whether a cycle is present in a given graph?Prim’s Minimum Spanning Tree AlgorithmBreadth First S...

gatecse

630 views

gatecse asked Dec 9, 2020

Algorithms
nielit-sta-2020
algorithms
graph-algorithms

+ –

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true

0 reply

Please log in or register to add a comment.

Please log in or register to answer this question.

1 Answer

0 reply

Please log in or register to add a comment.

Related questions

0

0