search
Log In
1 vote
142 views
Let   f(n) =O(n), g(n)=Ώ(n) and h(n)=Θ(n). Then g(n)+f(n).h(n)  is _____?

a- Ω($n^{2}$)

b- Θ($n^{2}$)

c-Ω(n)

d-Θ(n)
in Algorithms 142 views
0
C ) ??
0
yes

how?
0

Ώ(n) + O(n)*ϴ(n) 

(minimum time taken : n) + (max time taken : n)*(average time taken : n) =

min time taken : n (or) max time taken : n^2

 in the given options we have Ώ(n) not O(n^2)

so Ώ(n)

Please log in or register to answer this question.

Related questions

1 vote
2 answers
1
361 views
If $T1(n) = \Theta(f(n))$ & $T2(n) = \Theta(f(n))$ Then, Is $T1(n) + T2(n) = O(f(n))$ If yes, then how?
asked May 26, 2019 in Algorithms shubhojit1412 361 views
2 votes
1 answer
2
285 views
Given h(n) < f(n) < g(n). statement 1: h(n)=O(f(n)); g(n)=Ω(f(n)) Statement 1 is True / False?
asked Jan 21, 2018 in Algorithms hacker16 285 views
4 votes
0 answers
3
202 views
Assume that f(n) and g(n) are two functions, such that f(n)=O(g(n)). Which of the following always hold? A)$f(n)=O((f(n))^{2})$ B)$f(n)=\Omega ((f(n))^{2})$ C)$g(n)=O ((f(n))^{2})$ D)$g(n)=\Omega (g(n))$
asked Nov 10, 2017 in Algorithms srestha 202 views
3 votes
1 answer
4
294 views
What is the time complexity to find Kth minimum element from a doubly linked list having 'n' elements? (A) O (n log K ) (B) O (n log n ) (C) O (K log n ) (D) O ( n )
asked Sep 26, 2017 in Algorithms Harsh Mehta 294 views
...