Register

Recent questions tagged time-complexity

1 votes
1 answer
361
Time complexity
User Avatar
2 votes
1 answer
364
#Ace_Test_series.
Consider the problem of construction of a minimum cost binary search tree for a given set of ‘$n$’ identifiers with their respective probabilities. The time complexity of the most efficient algorithm of the same is $O(n^2)$ $O(n^3)$ $O(n\log n)$ $O(n^3\log n)$
Consider the problem of construction of a minimum cost binary search tree for a given set of ‘$n$’ identifiers with their respective probabilities. The time complexit...
User Avatar
0 votes
1 answer
365
Ace Mock Test 4
c=0 for i $\leftarrow$ 1 to n for j $\leftarrow$ i+1 to n for k $\leftarrow$ 1 to j c = c + 1 The value of c is O(n$^{2}$) O(n$^{2}$.log n) O(n$^{3}$) O(n$^{3}$.log n)
c=0for i $\leftarrow$ 1 to n for j $\leftarrow$ i+1 to n for k $\leftarrow$ 1 to j c = c + 1 The value of c isO(n$^{2}$)O(n$^{2}$.log n)O(n$^{3}$)O(n$...
User Avatar
1 votes
1 answer
366
Time Complexity
I am unable to Find its time complexity using Iterative method… Will any one help me out with this . Thank you :)
I am unable to Find its time complexity using Iterative method…Will any one help me out with this .Thank you :)
User Avatar
2 votes
1 answer
369
Complexity
An unordered list contains n distinct elements. Number of comparisons to find element larger than second minimum is O(1) O(n) None
An unordered list contains n distinct elements. Number of comparisons to find element larger than second minimum isO(1)O(n)None
User Avatar
2 votes
1 answer
372
Finding the minimum element in a Heap
I was going through the heap concept and one question came into my mind what will be the best case time complexity of finding the minimum element in a max heap? Thank you:)
I was going through the heap concept and one question came into my mind what will be the best case time complexity of finding the minimum element in a max heap?Thank you:...
User Avatar
1 votes
1 answer
374
Asymptotic notation
Let f(n) =O(n), g(n)=Ώ(n) and h(n)=Θ(n). Then g(n)+f(n).h(n) is _____? a- Ω($n^{2}$) b- Θ($n^{2}$) c-Ω(n) d-Θ(n)
Let f(n) =O(n), g(n)=Ώ(n) and h(n)=Θ(n). Then g(n)+f(n).h(n) is _____?a- Ω($n^{2}$)b- Θ($n^{2}$)c-Ω(n)d-Θ(n)
User Avatar
0 votes
1 answer
376
Algorithm
What is the right answer?
What is the right answer?
User Avatar
1 votes
1 answer
378
MadeEasy Test Series: Algorithms - Time Complexity
Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?
Please show the ideal way to deal with such comparisons as I am getting g>=f IN genral what logic shall be followed to analyse such complex comparions?
User Avatar
0 votes
1 answer
379
UPPCL AE 2018:55
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in the list that is larger than the second minimum in the list is $\Theta(n \log n)$ $\Theta(n/ \log n)$ $\Theta(1)$ $\Theta(\log n)$
An unordered list contains $n$ distinct elements. The number of comparisons to find an element in the list that is larger than the second minimum in the list is$\Theta(n ...
User Avatar
0 votes
1 answer
380
UPPCL AE 2018:38
Which of the given options provides the increasing order of asymptotic complexity of functions $\text{f}_{1}, \text{f}_{2}, \text{f}_{3}$ and $ \text{f}_{4} $ ... $\text{f}_{4}, \text{f}_{3}, \text{f}_{2}, \text{f}_{1}$
Which of the given options provides the increasing order of asymptotic complexity of functions $\text{f}_{1}, \text{f}_{2}, \text{f}_{3}$ and $ \text{f}_{4} $ ?$\text{f}_...
User Avatar
1 votes
1 answer
382
Recurrence relation
T(n) = T(n/4) + T(3n/4) + n How to solve these type of problems? Can I solve this using master theorm by considering X = T(3N/4) +N THEN T(N) = T(N/4) +X CAN WE SOLVE LIKE THIS? PLEASE HELP
T(n) = T(n/4) + T(3n/4) + nHow to solve these type of problems?Can I solve this using master theorm by considering X = T(3N/4) +N THEN T(N) = T(N/4) +XCAN WE SOLVE LIKE T...
User Avatar
0 votes
1 answer
384
ME Testseries
What is the time complexity of the following program?
What is the time complexity of the following program?
User Avatar
0 votes
1 answer
385
Time Complexity of Code snippet
What will be the worst case time complexity for the following code segment? int count=0,N; for(i=0;i<N*2;i++){ for(j=0;j<i/3;i++){ for(k=0;k<j*j;k++){ count++; } } } Options: O(N^4) O(N^3) O(N^2) O(N)
What will be the worst case time complexity for the following code segment?int count=0,N; for(i=0;i<N*2;i++){ for(j=0;j<i/3;i++){ for(k=0;k<j*j;k++){ count++; } } }Option...
User Avatar
0 votes
1 answer
386
Time complexity
How to analyze this problem For (I=1;I<n;I++) { For (j=1;j<n;j=j+I) { Print("℅d℅d", I,j); } } Please suggest I'm detail how do we unroll I & j.
How to analyze this problem For (I=1;I<n;I++){ For (j=1;j<n;j=j+I){Print("℅d℅d", I,j);}} Please suggest I'm detail how do we unroll I & j.
User Avatar
0 votes
1 answer
387
UGC NET CSE | December 2018 | Part 2 | Question: 27
Match $\text{List I}$ with $\text{List II}$ ... $\text{(a)-(iii), (b)-(i), (c)-(iv), (d)-(ii)}$
Match $\text{List I}$ with $\text{List II}$ and choose the correct answer from the code given below.$\begin{array} {clcl} & \textbf{List I} & & \textbf{List II} \\ & \...
User Avatar
1 votes
2 answers
388
UGC NET CSE | December 2018 | Part 2 | Question: 29
Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node $a$, pointer to this node is $q$, from the list? $O(n \lg \: n)$ $O(n)$ $O(\lg \: n)$ $O(1)$
Consider a singly linked list. What is the worst case time complexity of the best-known algorithm to delete the node $a$, pointer to this node is $q$, from the list?$O(n ...
User Avatar
Page: