Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged goclasses_wq9
9
votes
2
answers
1
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 8
If $f(n) = O(g(n))$ and $f(n) = \Omega(g(n)),$ then it is always true that $f(n) = o(g(n)).$ $f(n) = \theta(g(n)).$ $f(n) = \omega(g(n)).$ both A and B are always true.
If $f(n) = O(g(n))$ and $f(n) = \Omega(g(n)),$ then it is always true that$f(n) = o(g(n)).$$f(n) = \theta(g(n)).$$f(n) = \omega(g(n)).$both A and B are always true.
GO Classes
512
views
GO Classes
asked
May 4, 2022
Programming in C
goclasses_wq9
goclasses
algorithms
asymptotic-notation
1-mark
+
–
5
votes
2
answers
2
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 12
Which of the following statement(s) is/are true? If $\text{T1}(x) = \text{O}(f(x))$ and $\text{T2}(x) = \text{O}(g(x))$ then $\text{T1}(x) + \text{T2}(x) = \text{O} (\max(f(x), g(x))$ If $\text{T}(x) = \text{O}(cf(x)),$ ... then $\text{T1}(x) \ast \text{T2}(x) = \text{O}(f(x) \ast g(x))$ $2^{(n+1)} = \text{O}(2^{n} ).$
Which of the following statement(s) is/are true?If $\text{T1}(x) = \text{O}(f(x))$ and $\text{T2}(x) = \text{O}(g(x))$ then $\text{T1}(x) + \text{T2}(x) = \text{O} (\max(...
GO Classes
568
views
GO Classes
asked
May 4, 2022
Programming in C
goclasses_wq9
goclasses
algorithms
asymptotic-notation
multiple-selects
2-marks
+
–
7
votes
2
answers
3
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 13
Consider two statements below - $\text{S1}:$ For all positive $f(n), f(n) + o(f(n)) = \theta(f(n)).$ $\text{S2}:$ For all positive $f(n), g(n)$ and $h(n),$ if $f(n) = O(g(n))$ ... $\text{S1}$ is True but $\text{S2}$ is False. $\text{S2}$ is True but $\text{S1}$ is False. Both are True. Both are False.
Consider two statements below -$\text{S1}:$ For all positive $f(n), f(n) + o(f(n)) = \theta(f(n)).$$\text{S2}:$ For all positive $f(n), g(n)$ and $h(n),$ if $f(n) = O(g(n...
GO Classes
1.6k
views
GO Classes
asked
May 4, 2022
Programming in C
goclasses_wq9
goclasses
algorithms
asymptotic-notation
2-marks
+
–
7
votes
2
answers
4
GO Classes Weekly Quiz 9 | Data Structures | Linked List | Question: 14
Which of the following(s) is/are true? If $f(n) = O(n^2)$ then $f(n) = O(n).$ If $f(n)$ is $O(3^{\log_{10}n}),$ then $f(n)$ is $O(n^2).$ The function $f(n) = \lg(n!) = O(n \lg n).$ Growth of the sum $1 + \frac{1}{2} + \frac{1}{3} + \dots + \frac{1}{n}$ can be described by $\theta(\log n).$
Which of the following(s) is/are true?If $f(n) = O(n^2)$ then $f(n) = O(n).$If $f(n)$ is $O(3^{\log_{10}n}),$ then $f(n)$ is $O(n^2).$The function $f(n) = \lg(n!) = O(n \...
GO Classes
866
views
GO Classes
asked
May 4, 2022
Programming in C
goclasses_wq9
goclasses
algorithms
asymptotic-notation
multiple-selects
2-marks
+
–
To see more, click for the
full list of questions
or
popular tags
.
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register