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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
Blogs
New Blog
Exam Category
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions.
Search results for asymptoticnotations
+14
votes
8
answers
1
GATE2017104
Consider the following functions from positive integers to real numbers: $10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: (A) $\log_{2}n$, $\frac{100}{n}$, $10$, $\sqrt{n}$, $n$ (B) $\frac ... 100}{n}$, $\sqrt{n}$, $\log_{2}n$, $n$ (D) $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
asked
Feb 14
in
Algorithms
by
khushtak
Boss
(
7.9k
points)

1.6k
views
gate20171
algorithms
asymptoticnotations
normal
+22
votes
3
answers
2
GATE200429
The tightest lower bound on the number of comparisons, in the worst case, for comparisonbased sorting is of the order of $n$ $n^2$ $n \log n$ $n \log^2n$
asked
Sep 19, 2014
in
Algorithms
by
Kathleen
Veteran
(
67.7k
points)

2.5k
views
gate2004
algorithms
sorting
asymptoticnotations
easy
+2
votes
2
answers
3
Time complexity
T(n)=2T(n1)1 , for n>0 1 , otherwise What is the time complexity
asked
Nov 16
in
Algorithms
by
student2018
Active
(
1.1k
points)

74
views
timecomplexity
algorithms
asymptoticnotations
+4
votes
2
answers
4
Time Complexity
Consider the following function Void func(int n){ Int k=n; Int i=0; for(;i<n;i++){ while(k>1){ k>>=1; } } What is the worst case time complexity of the function?
asked
Nov 2
in
Algorithms
by
shaurya vardhan
Active
(
2.1k
points)

73
views
timecomplexity
algorithms
asymptoticnotations
recursion
programminginc
+1
vote
1
answer
5
Time complexity of divide and conquer
asked
5 days
ago
in
Algorithms
by
Parshu gate
Loyal
(
3.7k
points)

53
views
algorithms
divideandconquer
asymptoticnotations
+3
votes
0
answers
6
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
in
Algorithms
by
rahul sharma 5
Veteran
(
17.7k
points)

30
views
algorithms
asymptoticnotations
timecomplexity
0
votes
1
answer
7
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
22 hours
ago
in
Algorithms
by
aka 53
(
95
points)

34
views
algorithms
asymptoticnotations
+3
votes
1
answer
8
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
in
Algorithms
by
shaurya vardhan
Active
(
2.1k
points)

53
views
timecomplexity
algorithms
asymptoticnotations
+3
votes
1
answer
9
Time complexity
Solve the following recurrence relation $T(n)=4T(n/2)+n^2 \sqrt 2$
asked
Oct 9
in
Algorithms
by
Shivi rao
Junior
(
845
points)

150
views
timecomplexity
algorithms
asymptoticnotations
0
votes
0
answers
10
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
2 days
ago
in
Algorithms
by
aka 53
(
95
points)

42
views
timecomplexity
algorithms
asymptoticnotations
+2
votes
0
answers
11
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
in
Algorithms
by
Parshu gate
Loyal
(
3.7k
points)

43
views
timecomplexity
algorithms
asymptoticnotations
+2
votes
0
answers
12
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
in
Algorithms
by
srestha
Veteran
(
70.4k
points)

46
views
timecomplexity
algorithms
asymptoticnotations
0
votes
0
answers
13
time complexity
please explain the answer in detail
asked
3 days
ago
in
Algorithms
by
nikkey123
Active
(
1.1k
points)

29
views
timecomplexity
algorithms
asymptoticnotations
0
votes
0
answers
14
made easy test series
asked
4 days
ago
in
Algorithms
by
kamakshi
(
351
points)

47
views
asymptoticnotations
+4
votes
1
answer
15
What can be the big oh?
What will be the Big Oh for $n!$ ? As we can deduce log($n!$) = O(log n) . Is there any proof like we have for log($n!$) ?
asked
Oct 23
in
Algorithms
by
Manish Chetwani
(
297
points)

82
views
asymptoticnotations
algorithms
+2
votes
1
answer
16
Time Complexity
Consider the following code….. Search(int n){ if(n<2) then return; else{ s=0; for(i=1;i<=8;i++){ Search(n/2); } for(i=1;i<n*n;i++){ for(j=1;j<n;j=j*2){ s=s+i; } } } } Assume s is a global variable.Find the complexity of the given Search(n)?
asked
Nov 2
in
Algorithms
by
shaurya vardhan
Active
(
2.1k
points)

51
views
timecomplexity
algorithms
asymptoticnotations
recursion
programminginc
+4
votes
1
answer
17
Algo: Time complexity
T(n) = 4T(n/2) + n2.$\sqrt{2}$ In thetha notation?
asked
Oct 18
in
Algorithms
by
rahul sharma 5
Veteran
(
17.7k
points)

104
views
timecomplexity
algorithms
asymptoticnotations
0
votes
2
answers
18
Fibonacci Series Complexity
PLEASE EXPLAIN HOW TO APPROACH THESE KIND OF PROBLEMS
asked
Nov 5
in
Algorithms
by
Parshu gate
Loyal
(
3.7k
points)

58
views
timecomplexity
algorithms
asymptoticnotations
fibonaccisequenceapplication
+1
vote
0
answers
19
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
in
Algorithms
by
Narasimhan
(
93
points)

59
views
algorithms
asymptoticnotations
timecomplexity
spacecomplexity
nongate
0
votes
0
answers
20
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
in
Algorithms
by
NIKU
(
225
points)

28
views
asymptoticnotations
algorithms
growthrate
timecomplexity
functions
Page:
1
2
3
...
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
Jobs @cvppindia
How to be productive?For all Members,GATE Aspirants, everybody associated with "GO Family"
How to Do preparation for Gate2018
How to write nice answers/questions in GO
Organizing NET Questions
Follow @csegate
Gatecse
Search results for asymptoticnotations
Recent Blog Comments
Hi Guys, I think this is not correct. ISRO ...
NIELIT specifically mailed that they decided ...
is there any chances of changing the exam date??
ISRO and NIELIT Exam on the same day i.e 17th ...
greatly said @papesh sir
29,138
questions
36,959
answers
92,026
comments
34,803
users