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
Recent questions tagged asymptotic-notation
0
votes
0
answers
31
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, 2023
by
kira000
473
views
asymptotic-notation
algorithms
time-complexity
1
vote
0
answers
32
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, 2023
by
MonuKhan
623
views
recurrence-relation
algorithms
time-complexity
asymptotic-notation
0
votes
1
answer
33
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
286
views
asymptotic-notation
algorithms
time-complexity
1
vote
2
answers
34
Analysis of algorithms
Is ln(n!)=theta(n ln(n))?
nbhatt
asked
in
Algorithms
Nov 3, 2022
by
nbhatt
384
views
algorithms
asymptotic-notation
0
votes
1
answer
35
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
287
views
algorithms
asymptotic-notation
1
vote
1
answer
36
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
1.0k
views
algorithms
recurrence-relation
master-theorem
asymptotic-notation
1
vote
2
answers
37
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
761
views
algorithms
master-theorem
recurrence-relation
asymptotic-notation
1
vote
1
answer
38
𝑇(𝑛)=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
731
views
algorithms
master-theorem
recurrence-relation
asymptotic-notation
time-complexity
0
votes
0
answers
39
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
468
views
sorting
array
time-complexity
asymptotic-notation
0
votes
0
answers
40
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
426
views
algorithms
asymptotic-notation
0
votes
0
answers
41
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 ... 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 17, 2022
by
makhdoom ghaya
200
views
go-classroom
video-links
missing-videos
free-videos
asymptotic-notation
time-complexity
space-complexity
1
vote
1
answer
42
#doubt
BigO notation of T(n)=T(n-1)+ √n ; n>=1 =0. ; Otherwise
Subbu.
asked
in
Algorithms
Jul 18, 2022
by
Subbu.
464
views
algorithms
asymptotic-notation
time-complexity
0
votes
0
answers
43
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
291
views
algorithms
asymptotic-notation
3
votes
1
answer
44
GO Classes Test Series 2023 | Algorithms | Test 2 | Question: 8
Let $T(n)$ be $ T(n)=T(n-1)+n^{2} $$ T(1) = 1 $ What will be asymptotic bound on $T(n) ?$ $\Theta\left(\mathrm{n}^ 2\right)$ $\Theta\left(n^ 3\right)$ $\Theta\left(n^ 4\right)$ $\Theta\left(n^ 2 \log n\right)$
GO Classes
asked
in
Algorithms
Jun 19, 2022
by
GO Classes
286
views
goclasses2024-algo-2-weekly-quiz
goclasses
algorithms
recurrence-relation
asymptotic-notation
time-complexity
2-marks
Page:
« prev
1
2
3
4
5
6
7
...
19
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged asymptotic-notation
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...