The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent questions tagged asymptoticnotations
Notations
+1
vote
2
answers
1
MIT ASSIGNMENT
Find the complexity of the following function when called with some integer n: void foo(n) { int i,j,k,x=0; for (i=1 ; i ≤ n ; i++) for (j=1 ; j ≤ i * i ; j++) { for ( k = 1 ; k ≤ j ; k++) { x=x+10; } }
asked
Sep 28, 2018
in
Algorithms
by
sushmita
Boss
(
17.6k
points)

144
views
algorithms
timecomplexity
asymptoticnotations
0
votes
2
answers
2
MIT ASSIGNMENT
FIND THE TIME COMPLEXITY int i=1,j; for(;i <= n;i + +) { for(j = i; j <= nlogn; j∗ = 2) { sum + +; } }
asked
Sep 28, 2018
in
Algorithms
by
sushmita
Boss
(
17.6k
points)

119
views
algorithms
timecomplexity
asymptoticnotations
0
votes
1
answer
3
MIT assigment
Arrange the following functions in their increasing order of complexities. $f(n) = n ^{0.999999} * logn$ ($log n$ is not in power) $g(n) = 10000 n$ $h(n) = n^{2}$ $k(n) = (1.000001)^{n}$ $p(n) =\large \frac{2 ^{√n}}{ n^{2}}$ $q(n) = \Large \frac{n^{1.000001}}{logn}$
asked
Sep 28, 2018
in
Algorithms
by
sushmita
Boss
(
17.6k
points)

198
views
timecomplexity
algorithms
asymptoticnotations
0
votes
0
answers
4
mit assignment
State true/false f(n) != O(g(n)) and g(n) != O(f(n))
asked
Sep 28, 2018
in
Algorithms
by
sushmita
Boss
(
17.6k
points)

69
views
algorithms
timecomplexity
asymptoticnotations
0
votes
0
answers
5
Cormen Appendix A
Why does (1/3+1/c) <=1?
asked
Sep 22, 2018
in
Algorithms
by
Noddy
(
33
points)

30
views
algorithms
asymptoticnotations
timecomplexity
0
votes
1
answer
6
Asymptoticnotations
f(n)=2(log2 n)2 , g(n)=log2n+1 How to give relation between them?.
asked
Sep 22, 2018
in
Algorithms
by
Vishnathan
Junior
(
513
points)

63
views
timecomplexity
asymptoticnotations
0
votes
1
answer
7
timecomplexcity
for(i=0;i<n;i++) for(j=0;j<i;j++) for(k=0;k<j;k++) what is the time complexity of above psudo code? explain.
asked
Sep 21, 2018
in
Algorithms
by
balaganesh
(
131
points)

70
views
timecomplexity
algorithms
asymptoticnotations
0
votes
1
answer
8
Algorithms Complexity
asked
Sep 21, 2018
in
Algorithms
by
Vaishnavi01
(
153
points)

117
views
algorithms
timecomplexity
asymptoticnotations
0
votes
1
answer
9
Time complexity of code given
asked
Sep 17, 2018
in
Algorithms
by
GateAspirant999
Active
(
2.5k
points)

107
views
#time
timecomplexity
asymptoticnotations
0
votes
0
answers
10
Time Complexity
Please help with the following in Time Complexity. 1)Show that the following orderofmagnitude results hold: a)3n=O(n!) b)(n3 2n)/(n+1)=theta(n2) c)n3 /log(n+1)=O(n3) but not O(n2) 2)What is wrong with the following argument? x=O(n4),y=O(n2),therefore x/y=O(n2). 3) What is ... the following argument? f(n)=O(n2)+O(n), so that f(n)g(n)=O(n2 )+O(n)O(n2). Therefore, f(n)g(n)=O(n)
asked
Sep 10, 2018
in
Algorithms
by
Devshree Dubey
Boss
(
13.8k
points)

75
views
timecomplexity
algorithms
asymptoticnotations
0
votes
0
answers
11
Algorithm
How is Σ (1/k * log k) = O( n log n) for k=1 to n?
asked
Sep 7, 2018
in
Algorithms
by
Nidhi Budhraja
(
205
points)

48
views
algorithms
timecomplexity
asymptoticnotations
0
votes
2
answers
12
alagorithms analysis
The running time of an algorithm is given by T(n)=T(n1)+T(n2)T(n3), ifn>3 =n, otherwise The order of this algorithm is a)n b)log n c)n^n d)n^2 explain !
asked
Sep 5, 2018
in
Algorithms
by
balaganesh
(
131
points)

73
views
algorithms
asymptoticnotations
0
votes
0
answers
13
time complexity
I got this question from here https://gateoverflow.in/169286/timecomplexity Is this Question Correct i have doubt . If correct please explain Which of the following statements is/are TRUE? $i)$ The time complexity of recurrence relation $A(n) = 3A(n/2)+n^{2} $is ... $O( 7 ^ {n/53})$ is asymptotically faster But i am not able to get the answer because of question statement .
asked
Aug 22, 2018
in
Algorithms
by
Rishav Kumar Singh
Loyal
(
5.6k
points)

145
views
timecomplexity
asymptoticnotations
recurrence
0
votes
1
answer
14
Time Complexity
What would be the asymptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list? a) O(1) b) O(n) c) θ(n) d) θ(1)
asked
Aug 19, 2018
in
Programming
by
pradeepchaudhary
Active
(
1.2k
points)

41
views
asymptoticnotations
datastructures
0
votes
1
answer
15
Asymptotic Notation (Ex 34(h))
Let $f(n)$ and $g(n)$ be asymptotically positive functions. Prove or disprove below fact (h) $f(n)+o(f(n))=\Theta(f(n))$ is it true?
asked
Aug 15, 2018
in
Algorithms
by
Ayush Upadhyaya
Boss
(
28.9k
points)

89
views
asymptoticnotations
0
votes
2
answers
16
masters theorem
Solution using back substitution method T(n) = 2T(n/2) + nlogn ? detailed solution please. ans is nlognlogn or n(logn)^2
asked
Aug 10, 2018
in
Algorithms
by
manvi_agarwal
(
111
points)

117
views
timecomplexity
algorithms
mastertheorem
asymptoticnotations
recurrence
0
votes
3
answers
17
Time Complexity
What is the time complexity of the following? for(i=0; i < n *n ; i = i *i) print("*");
asked
Aug 9, 2018
in
Algorithms
by
smsubham
Boss
(
11.4k
points)

107
views
timecomplexity
algorithms
asymptoticnotations
0
votes
1
answer
18
Masters Theorem
How can we apply Masters theorem to these equations : T(n) = 16*T(n/4) + n! and T(n) = 4*T(n/2) + cn Please explain the process.
asked
Aug 6, 2018
in
Algorithms
by
Rahul Ranjan 1
(
129
points)

166
views
mastertheorem
timecomplexity
algorithms
asymptoticnotations
recurrence
+1
vote
0
answers
19
Algorithms
Solve the recurrence relation $T(n) = T(\sqrt{n}) + n$
asked
Jul 27, 2018
in
Algorithms
by
gauravkc
Loyal
(
7.8k
points)

195
views
algorithms
asymptoticnotations
timecomplexity
+1
vote
1
answer
20
UBC Intermediate Algorithm Design and Analysis (CPSC 320) Summer 2009
Analyze the runtime of the following piece of code. Give a bound using Θ notation. function Pesky(n) r ←0; for i ←1 to n do for j ←1 to i do for k ← j to i+j do r ←r + 1; return r;
asked
Jul 26, 2018
in
Algorithms
by
Rishav Kumar Singh
Loyal
(
5.6k
points)

82
views
asymptoticnotations
algorithms
+2
votes
2
answers
21
Testseries algorithms
What is the time complexity of following function fun()? Assume that log(x) returns log value in base 2. void fun() { int i, j; for (i=1; i<=n; i++) for (j=1; j<=log(i); j++) printf("GeeksforGeeks"); }
asked
Jul 26, 2018
in
Algorithms
by
Rishav Kumar Singh
Loyal
(
5.6k
points)

238
views
asymptoticnotations
algorithms
+1
vote
1
answer
22
GeeksForGeeks analysisofalgorithmsquestion192
Consider the following two functions. What are time complexities of the functions? int fun1(int n) { if (n <= 1) return n; return 2*fun1(n1); } int fun2(int n) { if (n <= 1) return n; return fun2(n1) + fun2(n1); } (A) O(2^n) for both fun1 ... O(2^n) for fun2() (C) O(2^n) for fun1() and O(n) for fun2() (D) O(n) for both fun1() and fun2()
asked
Jul 25, 2018
in
Algorithms
by
Rishav Kumar Singh
Loyal
(
5.6k
points)

93
views
asymptoticnotations
algorithms
+1
vote
0
answers
23
GeeksForGeeks analysisofalgorithms Question 15
In a modified merge sort, the input array is splitted at a position onethird of the length(N) of the array. What is the worst case time complexity of this merge sort?
asked
Jul 25, 2018
in
Algorithms
by
Rishav Kumar Singh
Loyal
(
5.6k
points)

51
views
asymptoticnotations
0
votes
0
answers
24
Introduction to Algorithm  Cormen
I didn't understand BigO notation: This is CORMEN exercise problem  3.12 Solution link: https://www.csee.umbc.edu/~nam1/TA/HWSols/hw1sol.pdf
asked
Jul 23, 2018
in
Algorithms
by
Swapnil Naik
Active
(
3.2k
points)

68
views
algorithms
asymptoticnotations
0
votes
1
answer
25
Masters theorem
Solve by using master's theorem
asked
Jul 17, 2018
in
Algorithms
by
bts
(
129
points)

125
views
timecomplexity
mastertheorem
algorithms
asymptoticnotations
recurrence
0
votes
2
answers
26
time complexity
Given f(n) = θ(n), g(n) = Ω(n), h(n) = O(n). Then f(n) + [g(n) ⋅ h(n)] = ? how to solve??
asked
Jul 15, 2018
in
Puzzles
by
vijju532
Active
(
1.1k
points)

155
views
timecomplexity
algorithms
asymptoticnotations
datastructures
+1
vote
1
answer
27
design and analysis of algorithms.
which of the following estimates are true? Explain with valid reasons. a) (2n)! is theta (n)! b) log((2n)!) is theta (log(n)!)
asked
Jul 14, 2018
in
Algorithms
by
AIkiran01
(
119
points)

346
views
asymptoticnotations
algorithms
+1
vote
0
answers
28
AlgorithmsTime Complexity
What is the time complexity of the below code? for($k=n^{10};k \geq 5;k=k^{\frac{1}{7}},k=k^2$) { $k=k^5;$ $k=k10$ } My answer comes to be $O(log_{\frac{7}{10}}log_5(n^{10}))$ Please verify.
asked
Jul 14, 2018
in
Algorithms
by
Ayush Upadhyaya
Boss
(
28.9k
points)

173
views
timecomplexity
algorithms
asymptoticnotations
+4
votes
0
answers
29
time complexity
for(int i=0; i < n; i++) { for(int j=0; j < (2*i); j+=(i/2)) { cout<<"Hello Geeks"; } } is it o(nlogn)??
asked
Jul 10, 2018
in
Algorithms
by
vijju532
Active
(
1.1k
points)

302
views
timecomplexity
algorithms
asymptoticnotations
+2
votes
2
answers
30
what is the time complexity for the below question ?
For the below code : foo() { for(i=1;i<=n;i++) { for(j=0;j<i;j++) { for(k=0;k<j;k++) c++; } } } Here k is executing j1 times and j is executing i times and i is executing n^2 times , so first ... getting order of n^8 .But this is getting too large , I checked with an example , it is not matching ,So please correct where I went wrong .
asked
Jun 28, 2018
in
Algorithms
by
radha gogia
Loyal
(
6.4k
points)

199
views
algorithms
timecomplexity
asymptoticnotations
Page:
« prev
1
2
3
4
5
6
7
8
...
11
next »
Quick search syntax
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
Recent Posts
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Management Trainee Recruitment COAL INDIA 2020
ECIL Interview Experience
Follow @csegate
Recent questions tagged asymptoticnotations
Recent Blog Comments
it's depends year to year
What was the average cutoff that was maintained...
@Shivateja MST I don't think it will go high
http://univ.tifr.res.in/gs2020/Test_Results/INT_Sh...
TIFR interview shortlist is published.
50,741
questions
57,240
answers
198,008
comments
104,599
users