Login
Register
Dark Mode
Brightness
Ambient Glow – Questions list
Register
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Notations
Recent questions tagged asymptotic-notations
2
2 votes
2
2 answers
274
274 views
GO Classes Test Series 2025 | NIELIT Mock Test 1 | Question: 85
Let $n$ be a positive integer.Consider the two statements below:$\text{S1:}$ If $f(n)>g(n)$ for all $n$ then $g(n)$ is ALWAYS o( $f(n))$. where $o$ is small-oh.$\text{S2:...
GO Classes
274
views
asked
May 5, 2025
Others
goclasses2025-nielit-mock-1
goclasses
algorithms
asymptotic-notations
one-mark
+
–
0
0 votes
1
1 answer
559
559 views
Gate zeal test series
Rohit0911
559
views
asked
Jan 13, 2025
Programming in C
time-complexity
asymptotic-notations
+
–
2
2 votes
1
1 answer
773
773 views
Made Easy Workbook
int main(){ int c = 0; for(int i = 1; i < n : i++){ for(int j = i + 1; j <= n; j++){ for(int k = 1; k <= j; k++){ c = c + 1; } } } return 0; }What will be the itme comple...
Aman Koli
773
views
asked
Dec 23, 2024
Algorithms
algorithms
asymptotic-notations
time-complexity
+
–
1
1 vote
1
1 answer
231
231 views
CMI2024-A: 7
Consider the following two recurrence relations:$T_{1}(n)=T_{1}\left(\frac{n}{2}\right)+T_{1}\left(\frac{n}{3}\right)+\Theta(n), T_{1}(1)=2$$T_{2}(n)=T_{2}\left(\frac{2 n...
admin
231
views
asked
Nov 25, 2024
Algorithms
cmi2024
recurrence-relation
algorithm-design
asymptotic-notations
+
–
0
0 votes
0
0 answers
210
210 views
CMI2023-A: 8
Let $f: \mathbb{N} \rightarrow \mathbb{N}$ and $g: \mathbb{N} \rightarrow \mathbb{N}$ be functions over the set $\mathbb{N}$ of natural numbers. We will say:$f(n)=O(g(n))...
admin
210
views
asked
Nov 13, 2024
Theory of Computation
cmi2023
asymptotic-notations
functions
+
–
Page:
« prev
1
2
3
4
5
6
7
...
22
next »