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
0
answers
1
Cormen Appendix A
Why does (1/3+1/c) <=1?
asked
3 days
ago
in
Algorithms
by
Noddy
(
27
points)

9
views
algorithms
asymptoticnotations
timecomplexity
0
votes
1
answer
2
Asymptoticnotations
f(n)=2(log2 n)2 , g(n)=log2n+1 How to give relation between them?.
asked
3 days
ago
in
Algorithms
by
Vishnathan
(
165
points)

24
views
timecomplexity
asymptoticnotations
0
votes
1
answer
3
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
4 days
ago
in
Algorithms
by
balaganesh
(
111
points)

31
views
timecomplexity
algorithms
asymptoticnotations
0
votes
0
answers
4
Algorithms Complexity
asked
4 days
ago
in
Algorithms
by
Vaishnavi01
(
115
points)

75
views
algorithms
timecomplexity
asymptoticnotations
0
votes
1
answer
5
Time complexity of code given
asked
Sep 17
in
Algorithms
by
GateAspirant999
Active
(
2.7k
points)

40
views
#time
timecomplexity
asymptoticnotations
0
votes
0
answers
6
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
in
Algorithms
by
Devshree Dubey
Boss
(
13.5k
points)

34
views
timecomplexity
algorithms
asymptoticnotations
0
votes
0
answers
7
time complexcity
Following algorithms can be used to sort n integers in range [1...n^3] in O(n) time? a)Heap sort b)Quick sort c)Merge sort d)Radix sort
asked
Sep 7
in
Algorithms
by
balaganesh
(
111
points)

21
views
time
timecomplexity
algorithms
asymptoticnotations
0
votes
0
answers
8
Algorithm
How is Σ (1/k * log k) = O( n log n) for k=1 to n?
asked
Sep 7
in
Algorithms
by
Nidhi Budhraja
(
97
points)

25
views
algorithms
timecomplexity
asymptoticnotations
0
votes
2
answers
9
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
in
Algorithms
by
balaganesh
(
111
points)

56
views
algorithms
asymptoticnotations
0
votes
0
answers
10
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 ... )$ so $O( 7 ^ {n/53})$ is asymptotically faster But i am not able to get the answer because of question statement .
asked
Aug 22
in
Algorithms
by
Rishav Kumar Singh
Active
(
4.2k
points)

67
views
timecomplexity
asymptoticnotations
recurrence
0
votes
1
answer
11
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
in
Programming
by
pradeepchaudhary
(
231
points)

21
views
asymptoticnotations
datastructure
0
votes
1
answer
12
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
in
Algorithms
by
Ayush Upadhyaya
Boss
(
12.6k
points)

42
views
asymptoticnotations
0
votes
2
answers
13
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
in
Algorithms
by
manvi_agarwal
(
109
points)

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

67
views
timecomplexity
algorithms
asymptoticnotations
0
votes
0
answers
15
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
in
Algorithms
by
Rahul Ranjan 1
(
151
points)

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

165
views
algorithms
asymptoticnotations
timecomplexity
+1
vote
1
answer
17
UBC Intermediate Algorithm Design and Analysis (CPSC 320) Summer 2009
asked
Jul 26
in
Algorithms
by
Rishav Kumar Singh
Active
(
4.2k
points)

43
views
asymptoticnotations
algorithms
+1
vote
2
answers
18
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
in
Algorithms
by
Rishav Kumar Singh
Active
(
4.2k
points)

53
views
asymptoticnotations
algorithms
+1
vote
1
answer
19
GeeksForGeeks analysisofalgorithmsquestion192
asked
Jul 25
in
Algorithms
by
Rishav Kumar Singh
Active
(
4.2k
points)

52
views
asymptoticnotations
algorithms
+1
vote
0
answers
20
GeeksForGeeks analysisofalgorithms Question 15
asked
Jul 25
in
Algorithms
by
Rishav Kumar Singh
Active
(
4.2k
points)

14
views
asymptoticnotations
0
votes
0
answers
21
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
in
Algorithms
by
Swapnil Naik
Junior
(
851
points)

44
views
algorithms
asymptoticnotations
0
votes
1
answer
22
Masters theorem
Solve by using master's theorem
asked
Jul 17
in
Algorithms
by
bts
(
149
points)

90
views
timecomplexity
mastertheorem
algorithms
asymptoticnotations
recurrence
0
votes
2
answers
23
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
(
441
points)

90
views
timecomplexity
algorithms
asymptoticnotations
datastructure
+1
vote
1
answer
24
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
(
163
points)

108
views
asymptoticnotations
algorithms
+1
vote
0
answers
25
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
(
12.6k
points)

150
views
timecomplexity
algorithms
asymptoticnotations
+4
votes
0
answers
26
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
(
441
points)

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

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

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

69
views
algorithms
asymptoticnotations
0
votes
0
answers
30
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
(
96.2k
points)

83
views
algorithms
timecomplexity
asymptoticnotations
Page:
1
2
3
4
5
6
...
9
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
Read/Unread questions
kvs pgt
Algorithms GO Classroom
Programming and DS GO Classroom
Discrete Mathematics GO Classroom
Follow @csegate
Gatecse
Recent questions tagged asymptoticnotations
Recent Blog Comments
following link is Kvs_Pgt_Question Paper...
@Arjun sir how to remove such post? should i hide...
[email protected]
.Plz do share @Sanjay sharma
Please post it as question
This is blog area post it as question
39,815
questions
46,793
answers
140,926
comments
58,854
users