Recent questions tagged time-complexity

Recent questions tagged time-complexity

0 votes

2 answers

1

Gate Applied Practice Test
Question--> The time required to find the 99th smallest element from a min heap of n elements is (given that we have access to the array elements)

lalitver10 asked in Programming Jan 13

112 views

0 votes

1 answer

2

Self doubts
T(n)=T(n/5)+T(7n/10)+an a: constant what will be the time complexity of the above recurrence relation?? Please share the approach for this kind of recurrence relation

lalitver10 asked in Algorithms Jan 4

122 views

0 votes

1 answer

3

#Made Easy Test Series
Find the time complexity of the given program

Nitesh_Yadav asked in Algorithms Jan 4

by Nitesh_Yadav

96 views

0 votes

1 answer

4

#self doubt
how to solve this?

samarpita asked in Algorithms Dec 29, 2021

137 views

0 votes

0 answers

5

NIELIT STA 2021
The time complexity of solving the Longest Common Subsequence problem using Dynamic Programming is: (m and n are lengths of subsequences) O(m.n) O(m+n) O(log m.n) O(m/n)

rsansiya111 asked in Algorithms Dec 6, 2021

53 views

0 votes

1 answer

6

#timecomplexity
We are having 4 sorted sub-lists of size n/4, What is the time complexity to merge them in a single sorted list?

Crackca asked in Algorithms Nov 20, 2021

70 views

3 votes

1 answer

7

Applied Gate Test Series
Consider the function given below ? Assume T(0) = 0 int fun( int n ) { if ( n <= 0 ) return 0; int i = random( n - 1 ); return fun(i) + fun(n - i - 1); } random(n) returns an integer in the range [0, n] in constant time What is the time complexity of the above function? $\Theta (n^{2})$ $\Theta (n)$ $\Theta (nlogn)$ None

Aashay kaurav asked in Algorithms Nov 16, 2021

by Aashay kaurav

141 views

2 votes

1 answer

8

Applied Test Series
The time required to determine the minimum element from the max heap of size O(log(n)) is given by

LRU asked in Algorithms Nov 3, 2021

by LRU

204 views

1 vote

1 answer

9

Applied Test Series
What is the correct order ?

LRU asked in Algorithms Nov 2, 2021

by LRU

116 views

2 votes

2 answers

10

Applied Test Series
Consider an array contains n integers, each integer belongs to {0, 1, 2}. What is the best case time complexity to sort an array?

LRU asked in Algorithms Oct 15, 2021

by LRU

275 views

1 vote

1 answer

11

Applied Test Series
Worst case time required to construct a balanced BST given a sorted array of integers which can be inserted in any order

LRU asked in Algorithms Oct 4, 2021

by LRU

142 views

1 vote

1 answer

12

Applied gate demo test
Consider the following function int foo(int n) { int p = 1 ; if (n && !(n&(n-1))) return n; while (p<n) { p <<= 1; } return p; } What is the worst case time complexity of function foo(n)

devilstephen7 asked in Algorithms Sep 20, 2021

by devilstephen7

157 views

6 votes

3 answers

13

GATE CSE 2021 Set 2 | Question: 2
Let $H$ be a binary min-heap consisting of $n$ elements implemented as an array. What is the worst case time complexity of an optimal algorithm to find the maximum element in $H$? $\Theta (1)$ $\Theta (\log n)$ $\Theta (n)$ $\Theta (n \log n)$

Arjun asked in DS Feb 18, 2021

by Arjun

3k views

6 votes

3 answers

14

GATE CSE 2021 Set 2 | Question: 8
What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size $n$? $\Theta ( \sqrt{n})$ $\Theta (\log _2(n))$ $\Theta(n^2)$ $\Theta(n)$

Arjun asked in Algorithms Feb 18, 2021

by Arjun

3.3k views

9 votes

3 answers

15

GATE CSE 2021 Set 1 | Question: 10
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$? $\Theta(n\log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta (1)$

Arjun asked in DS Feb 18, 2021

by Arjun

4k views

11 votes

5 answers

16

GATE CSE 2021 Set 1 | Question: 30
Consider the following recurrence relation. $T\left ( n \right )=\left\{\begin{array} {lcl} T(n ∕ 2)+T(2n∕5)+7n & \text{if} \; n>0\\1 & \text{if}\; n=0 \end{array}\right.$ Which one of the following options is correct? $T(n)=\Theta (n^{5/2})$ $T(n)=\Theta (n\log n)$ $T(n)=\Theta (n)$ $T(n)=\Theta ((\log n)^{5/2})$

Arjun asked in Algorithms Feb 18, 2021

by Arjun

8k views

2 votes

1 answer

17

NIELIT Scientific Assistant A 2020 November: 101
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)$

gatecse asked in Unknown Category Dec 9, 2020

215 views

0 votes

1 answer

18

UGCNET-Oct2020-II: 25
If algorithm $A$ and another algorithm $B$ take $\log_2 (n)$ and $\sqrt{n}$ microseconds, respectively, to solve a problem, then the largest size $n$ of a problem these algorithms can solve, respectively, in one second are ______ and ______. $2^{10^n}$ and $10^6$ $2^{10^n}$ and $10^{12}$ $2^{10^n}$ and $6.10^6$ $2^{10^n}$ and $6.10^{12}$

jothee asked in Algorithms Nov 20, 2020

by jothee

1.2k views

1 vote

1 answer

19

UGCNET-Oct2020-II: 52
The running time of an algorithm is $O(g(n))$ if and only if its worst-case running time is $O(g(n))$ and its best-case running time is $\Omega(g(n)) \cdot (O= \textit{ big }O)$ its worst-case running time is $\Omega (g(n))$ and its best-case running ... $(a)$ only $(b)$ only $(c)$ only $(d)$ only

jothee asked in Algorithms Nov 20, 2020

by jothee

533 views

2 votes

2 answers

20

NTA NET NOV2020( Big O )

Sanjay Sharma asked in CBSE/UGC NET Nov 17, 2020

by Sanjay Sharma

227 views

Page:

1
2
3
4
5
6
...
29
next »

Follow @gateoverflow

GATE Overflow

Recent questions tagged time-complexity

Search GATE Overflow