The Gateway to Computer Science Excellence
+1 vote
91 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 by (199 points) | 91 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.

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
50,648 questions
56,422 answers
195,194 comments
99,825 users