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
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. For hardcopy of previous year questions please see
here
Recent questions tagged asymptoticnotations
Notations
0
votes
1
answer
1
Masters theorem
Solve by using master's theorem
asked
5 days
ago
in
Algorithms
by
bts
(
135
points)

61
views
timecomplexity
mastertheorem
algorithms
asymptoticnotations
recurrence
0
votes
1
answer
2
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
in
Puzzles
by
vijju532
(
291
points)

54
views
timecomplexity
algorithms
asymptoticnotations
datastructure
+1
vote
1
answer
3
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
in
Algorithms
by
AIkiran01
(
157
points)

89
views
asymptoticnotations
algorithms
+1
vote
0
answers
4
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
in
Algorithms
by
Ayush Upadhyaya
Boss
(
10.4k
points)

124
views
timecomplexity
algorithms
asymptoticnotations
+3
votes
0
answers
5
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
in
Algorithms
by
vijju532
(
291
points)

180
views
timecomplexity
algorithms
asymptoticnotations
+2
votes
2
answers
6
what is the time complexity for the below question ?
asked
Jun 28
in
Algorithms
by
radha gogia
Loyal
(
7.2k
points)

138
views
algorithms
timecomplexity
asymptoticnotations
+1
vote
1
answer
7
Self doubt
Consider the following functions
asked
Jun 28
in
Algorithms
by
Doley
(
119
points)

24
views
asymptoticnotations
0
votes
1
answer
8
what is the tightest bound for the below functions ?
asked
Jun 24
in
Algorithms
by
radha gogia
Loyal
(
7.2k
points)

65
views
algorithms
asymptoticnotations
0
votes
0
answers
9
Asymptotic Complexity
$T\left ( n,c \right )=\Theta \left ( n \right )$ for $c\leq 2$ $T\left ( c,n \right )=\Theta \left ( n \right )$ for $c\leq 2$ $T\left ( n,n \right )=\Theta \left ( n \right )+T\left ( n,\frac{n}{2} \right )$ How to find complexity for this recurrence relation?
asked
Jun 22
in
Algorithms
by
srestha
Veteran
(
89k
points)

74
views
algorithms
timecomplexity
asymptoticnotations
0
votes
0
answers
10
Time Complexity
What will be the time complexity of the following algorithm ? A(n){ if(n<=1) return 1; for(i=1;i<n;i++){ for(j=0;j<3;j++){ A(n1) } } }
asked
Jun 17
in
Algorithms
by
kartikeya2812
(
7
points)

70
views
timecomplexity
algorithms
asymptoticnotations
recursion
+1
vote
1
answer
11
Extended Master's Theorem $T(n)=n^{1/2}T(n^{1/2})+n$
asked
Jun 11
in
Algorithms
by
Hardik Maheshwari
(
59
points)

120
views
timecomplexity
algorithms
mastertheorem
asymptoticnotations
recurrence
0
votes
0
answers
12
Cormen 3rd edition Problem 32 part (f)
Indicate for pair of expressions (A,B) whether A is O, o, Ω, ω or of B? A = lg(n!) B = lg(n^n)
asked
Jun 11
in
Algorithms
by
Aarvi Chawla
(
29
points)

25
views
asymptoticnotations
+1
vote
2
answers
13
Cormen
T(n)=T(n1)+2n where T(1)=1 Solve recurrence relation
asked
Jun 8
in
Algorithms
by
vijju532
(
291
points)

87
views
recurrenceeqation
algorithms
asymptoticnotations
timecomplexity
0
votes
0
answers
14
Complexity
#DAA Prove that if: f(n) = amnm + am1nm1 + am2nm2 + am3nm3 + .........+ a1n + a0 then f(n) = O(nm) .
asked
Jun 6
in
Algorithms
by
Naveen Kumar 3
Active
(
1.3k
points)

32
views
algorithms
timecomplexity
asymptoticnotations
+1
vote
2
answers
15
Analysis of algorit
Which of the following statements is/are valid? 1. Time Complexity of QuickSort is Θ(n^2) 2. Time Complexity of QuickSort is O(n^2) 3. For any two functions f(n) and g(n), we have f(n) = Θ(g(n)) if and only if f(n) = O(g(n)) and f(n) = Ω(g(n)). 4. Time complexity of all computer algorithms can be written as Ω(1)
asked
Jun 6
in
Algorithms
by
jatinkumar
(
205
points)

54
views
timecomplexity
algorithms
asymptoticnotations
0
votes
1
answer
16
Big O
asked
May 10
in
Algorithms
by
Sanjay Sharma
Boss
(
48.6k
points)

66
views
asymptoticnotations
timecomplexity
0
votes
1
answer
17
Cormen 3rd edition Exercise 4.4.9
Use a recursion tree to give an asymptotically tight solution to the recurrence T(n) =T(an)+T((1a)n)+cn, where a is constant in the range 0<a<1 and c>0 is also a constant.
asked
Apr 27
in
Algorithms
by
Neha_16
(
291
points)

44
views
algorithms
asymptoticnotations
0
votes
1
answer
18
Asymtotic notation
Big Omega question : 5n+3>=C2n for which value of c and n condition satisfies?
asked
Apr 17
in
Algorithms
by
once_2019
(
291
points)

42
views
asymptoticnotations
0
votes
1
answer
19
Zeal Indore
Compute: T(n) = 2^nT(n/2) +n^n 1)theta(n^n) 2)theta(nlogn) 3)theta(n^nlogn) 4)none of these.
asked
Apr 15
in
Algorithms
by
Harshit Pandey
(
11
points)

64
views
algorithms

asymptoticnotations
0
votes
1
answer
20
time complexity
asked
Apr 11
in
Algorithms
by
Beyonder
Junior
(
617
points)

79
views
timecomplexity
algorithms
asymptoticnotations
programminginc
+2
votes
2
answers
21
Algorithms time Complexity
What is the time complexity of this code?
asked
Apr 5
in
Algorithms
by
gauravkc
Loyal
(
5.7k
points)

164
views
timecomplexity
algorithms
asymptoticnotations
0
votes
0
answers
22
Recurrence
When T(n) = a T(n/b) + f(n) If on solving we get g(n) as upper bound solution for the recurrence. Is f(n) = O( g(n) ) always correct?
asked
Apr 3
in
Algorithms
by
smsubham
Loyal
(
6.3k
points)

102
views
recurrence
timecomplexity
algorithms
asymptoticnotations
+1
vote
1
answer
23
Cormen 4.3.8
Find the solution of recurrence $T(n) = 4T(\frac{n}{2}) + n^{2}$ by substitution method.
asked
Apr 2
in
Algorithms
by
Mk Utkarsh
Boss
(
13k
points)

113
views
asymptoticnotations
algorithms
+1
vote
1
answer
24
Cormen 4.45
Use the recursion tree to determine a good asymptotic upper bound on the recurrence T(n)=T(n1)+T($\frac{n}{2}$)+n. Use substitution method to verify the answer.
asked
Mar 9
in
Algorithms
by
Tesla!
Boss
(
16.1k
points)

161
views
algorithms
asymptoticnotations
recurrenceeqation
timecomplexity
+1
vote
1
answer
25
Introduction to Algorithm 36
For a given constant c $\in \mathbb{R}$, we define the iterated function $f_{c}^{*}$ by $f_{c}^{*}$(n)=min{${i\geq 0: f^{(i)}(n)<c}$} For each of the following function f(n) and constants c, give as tight a bound as possible on $f_{c}^{*}$ f(n) c $f_{c}^{*}$(n) $\sqrt{n}$ 2 $\sqrt{n}$ 1 n/lg n 2
asked
Mar 7
in
Algorithms
by
Tesla!
Boss
(
16.1k
points)

42
views
algorithms
asymptoticnotations
+1
vote
2
answers
26
Doubt in Asymptotic Analysis
Find theta bound for f(n)=$n^2/2 n/2$
asked
Mar 6
in
Algorithms
by
Devshree Dubey
Boss
(
12.6k
points)

85
views
algorithms
asymptoticnotations
+2
votes
1
answer
27
Equivalent Complexity
Given f(n) = ω(n2). Which of the following can never hold? a. f(n) = O (n3) b. f(n) = Ω (n2) c. f(n) = θ (n2) d. f(n) = ω (n)
asked
Jan 30
in
Algorithms
by
Tuhin Dutta
Loyal
(
7.8k
points)

72
views
algorithms
asymptoticnotations
timecomplexity
+3
votes
1
answer
28
time complexity
time complexity questions like : h(n)=O(n2); f(n)= O(logn); g(n)=omega(n2); what is the complexity of :::: 1. h(n)g(n)=?? 2. h(n)f(n)=??? elaborate plz
asked
Jan 22
in
Algorithms
by
akankshadewangan24
Active
(
4k
points)

99
views
timecomplexity
asymptoticnotations
+2
votes
0
answers
29
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
in
Algorithms
by
hacker16
Active
(
2.7k
points)

107
views
asymptoticnotations
algorithms
timecomplexity
growthrate
+3
votes
1
answer
30
time complexity
asked
Jan 16
in
Algorithms
by
pranab ray
Junior
(
895
points)

121
views
timecomplexity
algorithms
asymptoticnotations
Page:
1
2
3
4
5
6
...
8
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
AAI Junior Exceutive(Information Technology)
The 2018 APL Problem Solving Contest
GO Classroom for GATE 2019
Mtech CSE  IITH (TA) Interview Experience
MS Programme @ IIT
Follow @csegate
Gatecse
Recent questions tagged asymptoticnotations
Recent Blog Comments
What about my order sir, when will it be shipped??
Will be sent by tomorrow.
@Arjun sir, please send the book to this ...
Oh. You weren't contacted? Anyway I'll send again ...
@Arjun Sir, My GO Book is returned back ...
37,162
questions
44,732
answers
127,401
comments
43,805
users