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
0
votes
3
answers
1
Asympotic Notation
100nlogn = O(nlogn) How they are equal?
asked
Jan 11, 2018
in
Algorithms
by
iarnav
Loyal
(
8.5k
points)

132
views
timecomplexity
algorithms
asymptoticnotations
+5
votes
0
answers
2
Time Complexity
T(n) $\leq$ T($\frac{n}{5}$) + T($\frac{7n}{10}$) + 15n T(n) $\leq$ 5 when n $<$ 6
asked
Jan 9, 2018
in
Algorithms
by
Mk Utkarsh
Boss
(
36.6k
points)

127
views
timecomplexity
algorithms
asymptoticnotations
recursion
+2
votes
0
answers
3
Asymptoticnotations
Let f(n)=O(n),g(n)=O(n) and h(n)=Ѳ(n). Then [f(n).g(n)]+h(n) is: Ω (n) O (n) Ѳ (n) None of these
asked
Jan 3, 2018
in
Algorithms
by
VS
Boss
(
10.9k
points)

67
views
asymptoticnotations
+1
vote
1
answer
4
#time complexity
asked
Dec 28, 2017
in
Algorithms
by
Abhijeet_Kumar
Junior
(
625
points)

93
views
algorithms
timecomplexity
asymptoticnotations
+1
vote
1
answer
5
Maths Sum_of_AP/GP Sum_of_AP*GP
How to solve such ques? Answer is in asymptotic notation : S1 = theta (n), S2= theta (n log n)
asked
Dec 24, 2017
in
Algorithms
by
stanchion
Junior
(
555
points)

107
views
sequenceseries
permutationandcombination
asymptoticnotations
+3
votes
2
answers
6
ISRODEC201718
Consider the recurrence equation $T(n) =\begin{cases} 2T(n1), & \text{if }n>0 \\ 1, & \text{otherwise} \end{cases}$ Then $T(n)$ is (in $big\, O$ order) $O(n)$ $O(2^n)$ $O(1)$ $O(\log n)$
asked
Dec 17, 2017
in
Algorithms
by
gatecse
Boss
(
17.5k
points)

1.4k
views
isrodec2017
recurrence
asymptoticnotations
0
votes
1
answer
7
Asymtotic notations
In the context of merge sort, which of the following are true? $1.\ T(n)\ =\ o(n^2)\\ 2.\ T(n)\ =\ O(n^2)\\3.\ T(n)\ =\ \omega(n)\\4.\ T(n)\ =\ \Omega(n) $
asked
Dec 13, 2017
in
Algorithms
by
Tuhin Dutta
Boss
(
10.6k
points)

151
views
algorithms
asymptoticnotations
timecomplexity
+12
votes
1
answer
8
TIFR2018B5
Which of the following functions, given by there recurrence, grows the fastest asymptotically ? T(n) = 4T$\left ( \frac{n}{2} \right )$ + 10n T(n) = 8T$\left ( \frac{n}{3} \right )$ + 24n$^{2}$ T(n) = 16T$\left ( \frac{n}{4} \right )$ + 10n$^{2}$ T(n) = 25T$\left ( \frac{n}{5} \right )$ + 20$\left ( n log n \right )^{1.99}$ They all are asymptotically the same
asked
Dec 10, 2017
in
Algorithms
by
Arjun
Veteran
(
431k
points)

639
views
tifr2018
asymptoticnotations
recurrence
+10
votes
2
answers
9
TIFR2018A3
Which of the following statements is TRUE for all sufficiently large integers n ? $2^{2^{\sqrt{\log \log n}}} <2^{\sqrt{\log n}} < n$ $2^{\sqrt{\log n}}<n<2^{2^{\sqrt{\log \log n}}}$ $n<2^{\sqrt{\log n}}<2^{2^{\sqrt{\log \log n}}}$ $n<2^{2^{\sqrt{\log \log n}}} <2^{\sqrt{\log n}}$ $2^{\sqrt{\log n}}<2^{2^{\sqrt{\log \log n}}} < n$
asked
Dec 10, 2017
in
Algorithms
by
Arjun
Veteran
(
431k
points)

465
views
tifr2018
asymptoticnotations
0
votes
0
answers
10
MadeEasy Test Series: Algorithms  Asymptotic Notations
asked
Dec 6, 2017
in
Algorithms
by
charul
Junior
(
823
points)

133
views
madeeasytestseries
algorithms
asymptoticnotations
0
votes
0
answers
11
Is there any difference between the orders we get by applying masters theorem vs Substitution method?
asked
Dec 6, 2017
in
Algorithms
by
Harish Kumar 2
Junior
(
829
points)

57
views
asymptoticnotations
timecomplexity
+3
votes
1
answer
12
Time Complexity
T(n) = T(n/2) + 2T(n/5) + T(n/10) + 4n What is the time complexity for the recursion above?
asked
Dec 5, 2017
in
Algorithms
by
Warlock lord
Active
(
3.3k
points)

245
views
timecomplexity
algorithms
asymptoticnotations
recursion
0
votes
0
answers
13
Time Complexity
hope(n){ if (n == 1) G(n) else F() + hope(n/2); } What is the time complexity for the given function, if the function G' and function F' take O(1) and O(n) unit of time respectively. My views: If we take the recursion in the form of "T(n) = T ... being called 'log n' times as well? Why can't the answer be O(nlogn) since F() (whose complexity is O(n)) is called 'log n' times?
asked
Dec 5, 2017
in
Algorithms
by
Warlock lord
Active
(
3.3k
points)

116
views
timecomplexity
algorithms
asymptoticnotations
recursion
0
votes
1
answer
14
Time complexity
Worst case time complexity of following code? Please explain in detail. void function(int n) { int count = 0; for (int i=0; i<n; i++) for (int j=i; j< i*i; j++) if (j%i == 0) { for (int k=0; k<j; k++) printf("*"); } }
asked
Dec 4, 2017
in
Algorithms
by
♥_Less
Junior
(
939
points)

186
views
timecomplexity
algorithms
programminginc
asymptoticnotations
+2
votes
2
answers
15
Doubt Algorithms Gate 2003
2^2n =O(2^n) True or False Its false but why
asked
Nov 26, 2017
in
Algorithms
by
aka 53
(
243
points)

204
views
gate2003
algorithms
asymptoticnotations
0
votes
0
answers
16
Doubt Algorithms
I wanted to know how θ is derived for a problem. Can we write it directly Example n^4 + n^3+ n^2 Here worst case will be n^4 since it is the term with highest power(worst). Similarly can i get θ
asked
Nov 25, 2017
in
Algorithms
by
aka 53
(
243
points)

87
views
algorithms
timecomplexity
asymptoticnotations
+1
vote
1
answer
17
Internet
for ( i= 1; i<=n; i++) for(j=n/3: j<=2n; j=j+n/3) sum =sum+1; What will be O and θ for this
asked
Nov 23, 2017
in
Algorithms
by
aka 53
(
243
points)

98
views
algorithms
asymptoticnotations
+1
vote
1
answer
18
Time Complexity of the following code
for i < 1 to n for j < 1 to n/2 X = X + 1 (i and j both are incrementing by 1) Outer runs for n times and inner for n/2 So will it be n(n/2) => O(n^2) times...
asked
Nov 22, 2017
in
Algorithms
by
aka 53
(
243
points)

300
views
timecomplexity
algorithms
asymptoticnotations
0
votes
0
answers
19
time complexity
please explain the answer in detail
asked
Nov 21, 2017
in
Algorithms
by
nikkey123
Active
(
1.2k
points)

122
views
timecomplexity
algorithms
asymptoticnotations
+1
vote
1
answer
20
made easy test series
asked
Nov 19, 2017
in
Algorithms
by
kamakshi
Junior
(
593
points)

127
views
asymptoticnotations
0
votes
1
answer
21
MadeEasy Subject Test: Algorithms  Asymptotic Notations
explain this answer.
asked
Nov 19, 2017
in
Algorithms
by
nikkey123
Active
(
1.2k
points)

73
views
madeeasytestseries
algorithms
asymptoticnotations
+2
votes
1
answer
22
Time complexity of divide and conquer
asked
Nov 18, 2017
in
Algorithms
by
Parshu gate
Active
(
3.1k
points)

479
views
algorithms
divideandconquer
asymptoticnotations
+2
votes
3
answers
23
Time complexity
T(n)=2T(n1)1 , for n>0 1 , otherwise What is the time complexity
asked
Nov 16, 2017
in
Algorithms
by
student2018
Junior
(
947
points)

554
views
timecomplexity
algorithms
asymptoticnotations
+1
vote
0
answers
24
Asymptotic notations / time complexity
int unknown(int n) { inti, j, k = 0; for (i = n/2; i<= n; i++) for (j = 2; j <= n; j = j * 2) k = k + n/2; return k; } What is the returned value of the above function? (GATE CS 2013) (a) Ѳ(n2) (b) Ѳ(n2 log n) (c) Ѳ(n3) (d) Ѳ(n3 log n)
asked
Nov 14, 2017
in
Algorithms
by
NIKU
(
163
points)

221
views
asymptoticnotations
algorithms
growthrate
timecomplexity
functions
+3
votes
0
answers
25
Algo: Small oh notataion
This is a snapshot from coreman. Here if i want to prove this example $2n^2$ = $o(n^2)$ And if i take c=3, then $2n^2$ < $3n^2$ Now for all n0 and c=3 it will hold and this will be true .I know this proof i gave is wrong.But what exactly is wrong ?
asked
Nov 14, 2017
in
Algorithms
by
rahul sharma 5
Boss
(
25.6k
points)

73
views
algorithms
asymptoticnotations
timecomplexity
+4
votes
1
answer
26
time complexity
Determine the time complexity of the program segment given below: i= n; while (i>0) { k=1; for (j=1; j<=n; j+=k) { k++; } i= i/2; } (A) O(n2) (B) O(n.log n) (C) O(log2 n) (D) O(log n√n)
asked
Nov 12, 2017
in
Algorithms
by
Parshu gate
Active
(
3.1k
points)

173
views
timecomplexity
algorithms
asymptoticnotations
+4
votes
0
answers
27
Asymptotic Notation
Assume that f(n) and g(n) are two functions, such that f(n)=O(g(n)). Which of the following always hold? A)$f(n)=O((f(n))^{2})$ B)$f(n)=\Omega ((f(n))^{2})$ C)$g(n)=O ((f(n))^{2})$ D)$g(n)=\Omega (g(n))$
asked
Nov 10, 2017
in
Algorithms
by
srestha
Veteran
(
119k
points)

145
views
timecomplexity
algorithms
asymptoticnotations
+2
votes
1
answer
28
How to determine the time complexity of this loop?
// func() is any constant root function for (int i = n; i > 0; i = func(i)) { // some O(1) expressions or statements } "In this case, i takes values n, n1/k, (n1/k)1/k = n1/k2, ... do we calculate that there are logk(log(n)) iterations? Source: http://www.geeksforgeeks.org/timecomplexitylooploopvariableexpandsshrinksexponentially/
asked
Nov 7, 2017
in
Algorithms
by
Narasimhan
(
115
points)

373
views
algorithms
asymptoticnotations
timecomplexity
spacecomplexity
nongate
+3
votes
1
answer
29
Time Complexity
T(n)=4 T(n/2) + n2 21/2 I have solved this by back substitution .. and it forms equations of the form 4k T(n/2k) + k n2 21/2 its giving time complexity as n2 + n2 log2n the answer is Theta(n2.5). i have two questions .. a) how can we get Theta(n2.5). b) is n2 log2n Asymptotically faster than n2 ?
asked
Nov 5, 2017
in
Algorithms
by
shaurya vardhan
Active
(
2.2k
points)

180
views
timecomplexity
algorithms
asymptoticnotations
0
votes
2
answers
30
Fibonacci Series Complexity
PLEASE EXPLAIN HOW TO APPROACH THESE KIND OF PROBLEMS
asked
Nov 5, 2017
in
Algorithms
by
Parshu gate
Active
(
3.1k
points)

228
views
timecomplexity
algorithms
asymptoticnotations
fibonaccisequenceapplication
Page:
« prev
1
2
3
4
5
6
7
8
9
10
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
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged asymptoticnotations
Recent Blog Comments
@nkg_master9  For getting selected for the...
Nowhere it's mentioned.
@bond  Is it mentioned that you have to score at...
I think cutoff won't cross 85
Cut off will be between 95115 not more than that.
50,737
questions
57,378
answers
198,522
comments
105,314
users