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 growthrate
0
votes
1
answer
1
Asymptotic Notation theta property
If $T1(n) = \Theta(f(n))$ & $T2(n) = \Theta(f(n))$ Then, Is $T1(n) + T2(n) = O(f(n))$ If yes, then how?
asked
May 26
in
Algorithms
by
shubhojit1412
(
5
points)

141
views
asymptoticnotations
algorithms
timecomplexity
growthrate
+1
vote
1
answer
2
Asymptotic Notations with condition
Identify the FALSE statement: $A)$ $f(n)=\theta(f(\frac{n}{2})$ $implies$ $f(n^{2})=\theta(f(\frac{n^{2}}{2}))$ $B)$ $f(n)=O(g(n))$ $implies$ $log(f(n))=O(log(g(n)))$ where $n\geq2$ $C)$ $f(n)=O(g(n))$ $implies$ $2^{f(n)}=O(2^{g(n)})$ $D)$ $f(n)+g(n)=\theta(Max(f(n),g(n)))$
asked
Nov 1, 2018
in
Algorithms
by
Lakshman Patel RJIT
Veteran
(
55k
points)

78
views
algorithms
asymptoticnotations
growthrate
+1
vote
2
answers
3
Asymptotic Notations
Consider the following statements: $(1)$ Any two functions $f,g$ are always comparable under big Oh,that is $f=O(g)$ or $g=O(f)$ $(2)$ If $f=O(g)$ and $f=O(h)$ then $g(n)=\theta(h)$ $A)$ $(1)$ is true $(2)$ is false $B)$ $(1)$ is false $(2)$ is true $C)$ Both are false $D)$ Both are true
asked
Nov 1, 2018
in
Algorithms
by
Lakshman Patel RJIT
Veteran
(
55k
points)

109
views
algorithms
asymptoticnotations
timecomplexity
growthrate
+1
vote
0
answers
4
Order of growth
1.What is exact difference between order of growth of the function and asymptomatic growth of the functions? Please suggest on above point.
asked
Sep 7, 2018
in
Algorithms
by
Mayankprakash
Junior
(
997
points)

36
views
algorithms
growthrate
+2
votes
1
answer
5
Asymptotic Notation
Given h(n) < f(n) < g(n). statement 1: h(n)=O(f(n)); g(n)=Ω(f(n)) Statement 1 is True / False?
asked
Jan 21, 2018
in
Algorithms
by
hacker16
Active
(
2.7k
points)

215
views
asymptoticnotations
algorithms
timecomplexity
growthrate
+2
votes
0
answers
6
DAA: growth of functions
Can someone please prove or disprove the following conjecture? 1. Let f(n) be a asymptotically positive function. $f(n) + o(f(n)) = \Theta(f(n))$ Note that this is smalloh.
asked
Dec 21, 2017
in
Algorithms
by
Manu Thakur
Boss
(
43.8k
points)

196
views
algorithms
growthrate
timecomplexity
+2
votes
1
answer
7
Which function has asymptotically larger growth rate n^{logn} or logn^{n}
asked
Dec 18, 2017
in
Algorithms
by
Durgesh Singh
Junior
(
755
points)

146
views
recurrence
growthrate
algorithms
+1
vote
0
answers
8
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)

216
views
asymptoticnotations
algorithms
growthrate
timecomplexity
functions
+1
vote
1
answer
9
AsymptoticNotations
Let f(n), g(n) & h(n) be 3 nonnegative functions defined as follows: $f(n) = O(g(n))\; \; \; g(n) \neq O(f(n))$ $g(n) = O(h(n))\; \; \; h(n) = O(g(n))$ Which of the following is false? (A). f(n) + g(n) = O(h(n)) (B). f(n) = O(h(n)) (C). $h(n) \neq O(f(n))$ (D). $f(n).h(n) \neq O(g(n).h(n))$
asked
Aug 23, 2017
in
Algorithms
by
Victor0001
(
23
points)

118
views
algorithms
growthrate
asymptoticnotations
+1
vote
1
answer
10
Asymptotic Notations
Let f(n), g(n) & h(n) be 3 nonnegative functions defined as follows: $f(n) = O(g(n))\; \; \; g(n) \neq O(f(n))$ $g(n) = O(h(n))\; \; \; h(n) = O(g(n))$ Which of the following is false? (A). f(n) + g(n) = O(h(n)) (B). f(n) = O(h(n)) (C). $h(n) \neq O(f(n))$ (D). $f(n).h(n) \neq O(g(n).h(n))$
asked
Aug 23, 2017
in
Algorithms
by
Victor0001
(
23
points)

137
views
algorithms
asymptoticnotations
growthrate
functions
+1
vote
0
answers
11
Asymptotic Notation
Let f(n), g(n) & h(n) be 3 nonnegative functions defined as follows: $f(n) = O(g(n))\; \; \; g(n) \neq O(f(n))$ $g(n) = O(h(n))\: \: \: h(n) = O(g(n))$ Which of the following is false? (A). f(n) + g(n) = O(h(n)) (B). f(n) = O(h(n)) (C). $h(n) \neq O(f(n))$ (D). $f(n).h(n) \neq O(g(n).h(n))$
asked
Aug 23, 2017
in
Algorithms
by
Victor0001
(
23
points)

206
views
asymptoticnotations
algorithms
growthrate
+2
votes
0
answers
12
ASYMPTOTIC GROWTH
Consider the case: f(n) = O(g(n)). Then, following two statements are claimed to be inferred from the above case. Statement I: 2f(n) = O(2g(n)) Statement II: 2g(n) = O(2f(n)) Choose the correct option from the given. Both correct. Both incorrect S1 correct, S2 false S2 false,S1 correct
asked
Feb 4, 2017
in
Algorithms
by
sushmita
Boss
(
17.3k
points)

163
views
timecomplexity
asymptoticnotations
growthrate
algorithms
+1
vote
1
answer
13
exponential growth
asked
Dec 1, 2016
in
Numerical Ability
by
Sanjay Sharma
Boss
(
48.8k
points)

249
views
growthrate
+1
vote
1
answer
14
What is the ascending order of the following growth functions?
asked
Jun 15, 2016
in
Algorithms
by
jagadeesha kanihal
(
59
points)

331
views
algorithms
growthrate
To see more, click for the
full list of questions
or
popular tags
.
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
ECIL Interview Experience
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
Follow @csegate
Recent questions tagged growthrate
Recent Blog Comments
@Ayush Upadhyaya Thank you so much! ^_^
@JashanAroraNo No. Don't directly say no.Think a...
@jeetYes, I am sorry for that.I saw ECIL Advt...
Congratulations man! A little question, please?...
Is IT eligible to apply in ECIL because they only...
50,645
questions
56,586
answers
195,788
comments
101,838
users