Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Notations
Recent questions tagged asymptotic-notations
0
votes
2
answers
1
Chose the correct big- Θ expression to describe: T(N) = T(N / 2) + Log(N/2); T(1) = 1
I
ahmed malik
asked
in
Algorithms
Mar 5
by
ahmed malik
80
views
algorithms
time-complexity
asymptotic-notations
2
votes
0
answers
2
GATE CSE 2023 | Question: 19
Let $f$ and $g$ be functions of natural numbers given by $f(n)=n$ and $g(n)=n^{2}.$ Which of the following statements is/are $\text{TRUE}?$ $f \in O(g)$ $f \in \Omega(g)$ $f \in o(g)$ $f \in \Theta(g)$
admin
asked
in
Algorithms
Feb 15
by
admin
1.2k
views
gatecse-2023
algorithms
asymptotic-notations
multiple-selects
1-mark
3
votes
1
answer
3
GATE CSE 2023 | Question: 44
Consider functions $\textsf{Function_1}$ and $\textsf{Function_2}$ ... $f_{1}(n) \in \omega\left(f_{2}(n)\right)$ $f_{1}(n) \in O(n)$
admin
asked
in
Algorithms
Feb 15
by
admin
1.3k
views
gatecse-2023
algorithms
asymptotic-notations
multiple-selects
2-marks
0
votes
0
answers
4
Asymptotic Notation
Let $f(n)$ be a positive increasing function. Consider the below two statements: S1: if an algorithm is $\Theta(f(n))$ in the average case, then it is $\Omega(f(n))$ in the worst case. S2: if an algorithm is $\Theta(f(n))$ in the average case, then it is ... understand it mathematically. Also, $g(n) = \Theta(f(n))$ actually means $g(n)$ belongs to the set $\Theta(f(n))$, right?
kira000
asked
in
Algorithms
Jan 17
by
kira000
123
views
asymptotic-notations
algorithms
time-complexity
0
votes
0
answers
5
Test series
Can anyone solve this recurrence relation T(n) = 3T(n-1) + O(n^2) Its ans is O(3^n n^2)
MonuKhan
asked
in
Algorithms
Jan 12
by
MonuKhan
275
views
recurrence-relation
algorithms
time-complexity
asymptotic-notations
0
votes
1
answer
6
Asymptotic notations
Can we write f(2$^{n/a}$) = Θ(2$^{n}$) for any integer a >0?
Chaitanya Kale
asked
in
Algorithms
Nov 10, 2022
by
Chaitanya Kale
157
views
asymptotic-notations
algorithms
time-complexity
1
vote
2
answers
7
Analysis of algorithms
Is ln(n!)=theta(n ln(n))?
nbhatt
asked
in
Algorithms
Nov 3, 2022
by
nbhatt
174
views
algorithms
asymptotic-notations
0
votes
1
answer
8
Analysis of algorithms
If big oh is possible for an algorithm but big Omega is not,then is it small o?
nbhatt
asked
in
Algorithms
Nov 3, 2022
by
nbhatt
94
views
algorithms
asymptotic-notations
0
votes
1
answer
9
how to solve T(n)=4T(√n)+3^5n with master theorem
how do i apply master theorem to this?
mdboi
asked
in
Algorithms
Oct 29, 2022
by
mdboi
357
views
algorithms
recurrence-relation
master-theorem
asymptotic-notations
0
votes
1
answer
10
how to solve T(n)=2T(n/2)−n^3n with master theorem
how do i apply master theorem to this? T(n)=2T(n/2)−n^3n
mdboi
asked
in
Algorithms
Oct 28, 2022
by
mdboi
190
views
algorithms
master-theorem
recurrence-relation
asymptotic-notations
0
votes
1
answer
11
𝑇(𝑛)=16𝑇(𝑛/4)+5𝑛^3 using the master theorem
how do i apply master theorem to this? 𝑇(𝑛)=16𝑇(𝑛/4)+5𝑛^3
mdboi
asked
in
Algorithms
Oct 28, 2022
by
mdboi
183
views
algorithms
master-theorem
recurrence-relation
asymptotic-notations
time-complexity
0
votes
0
answers
12
PhD Admissions Written Test (Basic)
Let A be a sorted array of distinct integers of length n. Design an algorithm to find an index i such that A[i] = i if such an index exists. If there are more than one such indices, you may output any one ... −1. The asymptotic time complexity of the fastest algorithm for this problem, assuming the array is already available, is Θ ______________________________
rsansiya111
asked
in
Others
Sep 10, 2022
by
rsansiya111
199
views
sorting
array
time-complexity
asymptotic-notations
0
votes
0
answers
13
Asymptotic Functions
Consider f(n) and g(n) be asymptotic non-negative functions. So here can we say that min(f(n), g(n)) = Θ(f(n) + g(n)) My proof for this For f(n) = Θ(g(n)) c1*g(n) $\leq $ f(n) $\leq $ c2*g(n) such that c1, c2 >0 Considering the above definition ... ) So thus we can say that min(f(n), g(n)) = Θ(f(n) + g(n)) Is this the correct way? What would be the correct answer?
Chaitanya Kale
asked
in
Algorithms
Aug 29, 2022
by
Chaitanya Kale
186
views
algorithms
asymptotic-notations
0
votes
0
answers
14
Best Open Video Playlist for Asymptotic Worst-Case Time and Space Complexity Topic | Algorithm
Please list out the best free available video playlist for Asymptotic Worst-Case Time and Space Complexity from Algorithm as an answer here (only one playlist per answer). We'll then select the best playlist ... are more likely to be selected as best. For the full list of selected videos please see here
makhdoom ghaya
asked
in
Study Resources
Aug 18, 2022
by
makhdoom ghaya
106
views
go-classroom
video-links
missing-videos
free-videos
asymptotic-notations
time-complexity
space-complexity
1
vote
1
answer
15
#doubt
BigO notation of T(n)=T(n-1)+ √n ; n>=1 =0. ; Otherwise
Subbu.
asked
in
Algorithms
Jul 18, 2022
by
Subbu.
240
views
algorithms
asymptotic-notations
time-complexity
0
votes
0
answers
16
Iteration Functions (Cormen)
Iterative functions: f(n)= n/logn c=2 What is f*(n) ? How to solve this question?
mb14
asked
in
Algorithms
Jul 6, 2022
by
mb14
157
views
algorithms
asymptotic-notations
Page:
1
2
3
4
5
6
...
18
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
My journey from being a MSc student to AIR 239 in GATE CSE 2023 and qualified UGC-NET JRF.
NEEPCO Recruitment 2023
GATE CSE 2023 Results
IIIT Banglore MTech 2023-24
IIIT-Delhi MTech 2023-24
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.7k)
Non GATE
(1.3k)
Others
(2.5k)
Admissions
(653)
Exam Queries
(844)
Tier 1 Placement Questions
(17)
Job Queries
(76)
Projects
(9)
Unknown Category
(866)
Recent questions tagged asymptotic-notations
Recent Blog Comments
Sir can you please provide some good resources...
Where can we see the responses of the form filled?
congrats pranab
Congratulations @Pranab Paul 10 🥳
sir give access to these tests at least mid May...