1 votes 1 votes 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) Algorithms asymptotic-notation algorithms time-complexity + – bts1jimin asked Jan 12, 2019 bts1jimin 578 views answer comment Share Follow See all 3 Comments See all 3 3 Comments reply Magma commented Jan 12, 2019 reply Follow Share C ) ?? 0 votes 0 votes bts1jimin commented Jan 12, 2019 reply Follow Share yes how? 0 votes 0 votes OneZero commented Jan 12, 2019 reply Follow Share Ώ(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) 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Please correct me if the explanation is wrong. preeti0448 answered May 2, 2022 preeti0448 comment Share Follow See all 0 reply Please log in or register to add a comment.