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 time-complexity
1
vote
1
answer
151
TIFR CSE 2022 | Part B | Question: 3
Consider the problem of sorting $n$ single digit integers (base $10$). This problem can be solved in time $O(n \log n)$ but not $O(n \log \log n)$ $O(n \log \log n)$ but not $O(n)$ $O(n)$ but not $O(n / \log \log n)$ $O(n / \log \log n)$ None of the above.
admin
asked
in
Algorithms
Sep 1, 2022
by
admin
820
views
tifr2022
algorithms
sorting
time-complexity
1
vote
1
answer
152
TIFR CSE 2022 | Part B | Question: 4
Consider the following algorithm for computing the factorial of a positive integer $n$, specified in binary: prod ← 1 for i from 1 to n prod ← prod i output prod Assume that the number of bit operations required to multiply a $k$-bit positive integer with an $\ell$ ... $\omega(n \log n)$ $O\left(n^3\right)$ but $\omega\left(n^2\right) $ None of the above
admin
asked
in
Algorithms
Sep 1, 2022
by
admin
660
views
tifr2022
algorithms
identify-function
time-complexity
0
votes
0
answers
153
T(n) = 2^nT(n/2) + n^n find TC
T(n) = 2^nT(n/2) + n^n find TC
mohdraza
asked
in
Algorithms
Sep 1, 2022
by
mohdraza
278
views
algorithms
time-complexity
2
votes
0
answers
154
I-Gate Question
Consider the following algorithm, Dosomething( x, n) { m= n, temp= 1,z= x; while(m>0) do { while((m mod z)=0) do { m= Floor(m/2); z=z^2; } m = m-1, temp= temp* z; } return temp; } The complexity of above algorithm is Theta(log n) Theta(n log n) Theta(n^2) Theta(n)
loki2023
asked
in
Algorithms
Aug 23, 2022
by
loki2023
361
views
algorithms
time-complexity
i-gate-test-series
0
votes
0
answers
155
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
202
views
go-classroom
video-links
missing-videos
free-videos
asymptotic-notation
time-complexity
space-complexity
1
vote
1
answer
156
#doubt
BigO notation of T(n)=T(n-1)+ √n ; n>=1 =0. ; Otherwise
Subbu.
asked
in
Algorithms
Jul 18, 2022
by
Subbu.
466
views
algorithms
asymptotic-notation
time-complexity
0
votes
0
answers
157
what is the running time of the following iterative algorithm? b) It is possible to talk about the best, average and worst running times for this algorithm. Why?
usdid
asked
in
Algorithms
Jul 2, 2022
by
usdid
483
views
algorithms
time-complexity
3
votes
1
answer
158
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
289
views
goclasses2024-algo-2-weekly-quiz
goclasses
algorithms
recurrence-relation
asymptotic-notation
time-complexity
2-marks
3
votes
1
answer
159
GO Classes Test Series 2023 | Algorithms | Test 2 | Question: 12
Let $T(n)$ be $ T(n)=T(\sqrt{n})+1 $ What will be asymptotic bound on $T(n)$? $\Theta(\log n)$ $\Theta(\sqrt{n})$ $\Theta(\log \log n)$ $\Theta\left((\log n)^ 2\right)$
GO Classes
asked
in
Algorithms
Jun 19, 2022
by
GO Classes
220
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
8
9
10
11
...
53
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 time-complexity
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:...