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
0
votes
1
answer
1
Prove that n! = Ω(n^100)
wtquevb123
asked
in
Algorithms
Mar 14
by
wtquevb123
53
views
theory-of-computation
algorithms
time-complexity
0
votes
1
answer
2
Sorting Algorithm
For flag based approach in Bubble sort we can check first by a flag if the list is sorted or not in O(n), and if it is sorted, then no need to sort and the operation ends in Best case = O(n). Why isn't the same concept applicable to selection sort? Why it never comes down from O(n$^2$)?
Mrityudoot
asked
in
Algorithms
Mar 7
by
Mrityudoot
119
views
algorithms
sorting
time-complexity
asymptotic-notation
1
vote
1
answer
3
GATE CSE 2024 | Set 1 | Question: 7
Given an integer array of size $N$, we want to check if the array is sorted (in either ascending or descending order). An algorithm solves this problem by making a single pass through the array and comparing each element of the array only with its adjacent elements. The ... $\Omega(N)$ but not $\mathrm{O}(N)$ neither $\mathrm{O}(N)$ nor $\Omega(N)$
Arjun
asked
in
Algorithms
Feb 16
by
Arjun
2.9k
views
gatecse2024-set1
algorithms
time-complexity
5
votes
1
answer
4
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 17
Consider the following function. If $n$ and $\mathrm{k}$ are positive integers, then the least value of $\mathrm{k}$ such that $\mathrm{f}(\mathrm{k})>n$ is approximately $\log _2\left(\log _2 n\right)$ $\log _2 n$ $n \log _2 n$ $2^n$
GO Classes
asked
in
Algorithms
Feb 5
by
GO Classes
441
views
goclasses2024-mockgate-14
algorithms
identify-function
time-complexity
1-mark
4
votes
1
answer
5
GO Classes Test Series 2024 | Mock GATE | Test 14 | Question: 46
We have a procedure $P(n)$ that makes multiple calls to a procedure $Q(m)$, and runs in polynomial time in $n$. Unfortunately, a significant flaw was discovered in $Q(m)$, and it had to be replaced by $R(m)$, which runs in exponential ... $P(n)$ runs in polynomial time in $n$ if, for each call $Q(m),m \underline<\log \;n.$
GO Classes
asked
in
Algorithms
Feb 5
by
GO Classes
387
views
goclasses2024-mockgate-14
algorithms
asymptotic-notation
time-complexity
2-marks
7
votes
3
answers
6
GO Classes Test Series 2024 | Mock GATE | Test 13 | Question: 40
You are given a complete binary tree (each level must be full except the last) on $n$ vertices. Each vertex $v$ is labeled by an integer value $x_v$. Say that a vertex is a local minimum if its label is less than the labels of each of its ... minimum in the tree? $\theta(n)$ $\theta(\sqrt{n})$ $\theta(\log n)$ $\theta(n \log n)$
GO Classes
asked
in
DS
Jan 28
by
GO Classes
705
views
goclasses2024-mockgate-13
goclasses
data-structures
binary-tree
time-complexity
2-marks
5
votes
1
answer
7
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 30
Consider the following pseudocode for a function that operates on an $\textsf{N}$ element array $\textsf{A[1],A[2]},\dots,\textsf{A[N]}$ of integers. function mystery (A[1...N]) { int i,j,position,tmp; for i=1 to N { position= ... ; } } If $\textsf{N = 100,}$ how many times is the comparison $\textsf{A[j] < A[position]}$ checked?
GO Classes
asked
in
Algorithms
Jan 21
by
GO Classes
468
views
goclasses2024-mockgate-12
goclasses
numerical-answers
algorithms
identify-function
time-complexity
2-marks
3
votes
3
answers
8
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 54
Of the following, which gives the best upper bound for the value of $f(N)$ where $f$ is a solution to the recurrence $ f(2 N+1)=f(2 N)=f(N)+\log N \text { for } N \geq 1, $ with $f(1)=0?$ $O(\log N)$ $O(N \log N)$ $O\left((\log N)^2\right)$ $O(N)$
GO Classes
asked
in
Algorithms
Jan 21
by
GO Classes
790
views
goclasses2024-mockgate-12
goclasses
algorithms
recurrence-relation
time-complexity
2-marks
12
votes
2
answers
9
GO Classes Test Series 2024 | Mock GATE | Test 11 | Question: 50
Given an unsorted array of $n$ distinct elements, you want to find this set of $\log n$ elements: those at positions $1,2,4,8,16, \ldots, n/2$ if array were sorted. In other words, find the largest element, the second largest element, the ... the subarray) $\Theta(\log n)$ $\Theta(n)$ $\Theta(n \log n)$ $\Theta\left(n^{2}\right)$
GO Classes
asked
in
Algorithms
Jan 13
by
GO Classes
916
views
goclasses2024-mockgate-11
goclasses
algorithms
merging
time-complexity
2-marks
1
vote
1
answer
10
made-easy
Rohit Chakraborty
asked
in
GATE
Jan 7
by
Rohit Chakraborty
139
views
made-easy-test-series
time-complexity
functions
multiple-selects
0
votes
1
answer
11
ISRO 2024
The complexity of matrix multiplication of two matrices A and B whose orders are $m \times n$ and $n \times p$ respectively is $\text{O(m} \times p)$ $\text{O(m} \times n^2 \times p)$ $\text{O(m} \times n \times p^2)$ $\text{O(m} \times n \times p)$
Ramayya
asked
in
Algorithms
Jan 7
by
Ramayya
220
views
isro-2024
algorithms
time-complexity
matrix-chain-ordering
1
vote
1
answer
12
UGC NET CSE | June 2008 | Part 2 | Question: 23
Which of the following is true for a sorted list with ' $n$ ... $\mathrm{O}(\log n)$ time.
admin
asked
in
Others
Jan 6
by
admin
120
views
ugcnetcse-june2008-paper2
sorting
array
time-complexity
0
votes
1
answer
13
#Applied Course
In a variant of quick sort, the n/10th smallest element is selected in every recursive call using a Θ(n) time algorithm, which is the worst-case time complexity for this sorting algorithm. T(n)=T(n/10)+T(9n/10)+O(n) This is what I tried according ... is getting calculated by o(n) in every recursive call can someone clarify this line what will be the effect of this on an algorithm?
Dknights
asked
in
Algorithms
Dec 16, 2023
by
Dknights
174
views
time-complexity
0
votes
1
answer
14
TS
$\text{Please explain True or False and Why ?}$ $\text{1. f(n) = O(f(n/2))}$ $\text{2. f(n) = O($f(n)^{2}$) }$
Jiten008
asked
in
Algorithms
Dec 2, 2023
by
Jiten008
232
views
algorithms
time-complexity
asymptotic-notation
functions
1
vote
1
answer
15
algorithm time complexity madeeasy
Consider the problem that given a set Sof n integers and another integer x, whether or not there exist two elements in S whose sum is exactly x. What is the worst case time complexity for the most efficient algorithm which solves the given problem? Is not it work like subset sum problem in dynamic programming? Then complexity should be O(n^2). How O(n logn)?
Sajal Mallick
asked
in
Algorithms
Nov 28, 2023
by
Sajal Mallick
453
views
algorithms
time-complexity
made-easy-test-series
made-easy-booklet
0
votes
0
answers
16
algorithm time complexity madeeasy ots
What will be the complexity?
Sajal Mallick
asked
in
Algorithms
Nov 28, 2023
by
Sajal Mallick
173
views
algorithms
time-complexity
made-easy-test-series
made-easy-booklet
job
scheduling
0
votes
0
answers
17
Algorithm Madeeasy Workbook
As we have to select maximal set of “non overlapping” activities. So like job scheduling algo of greedy we can solve it. So according to that complexity must be O(n logn). But ans is (b). Anyone please explain.
Sajal Mallick
asked
in
Algorithms
Nov 27, 2023
by
Sajal Mallick
170
views
made-easy-booklet
algorithms
time-complexity
greedy-algorithm
algorithm-design
0
votes
0
answers
18
Michael Sipser Decidability Problem
Is the following language decidable or not? If you deem it decidable, you need to give an algorithm and analyse its running time. If not decidable, you need to prove it. L = {M | M is a Turing machine and L(M) ∈ TIME(2^n)}
baofbuiafbi
asked
in
Theory of Computation
Nov 14, 2023
by
baofbuiafbi
139
views
theory-of-computation
time-complexity
michael-sipser
Page:
1
2
3
4
5
6
...
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:...