21 votes 21 votes Let $f(n)= Ω(n), g(n)= O(n)$ and $h(n)= Ѳ(n)$. Then $[f(n). g(n)] + h(n)$ is: Ω (n) O (n) Ѳ (n) None of these Algorithms asymptotic-notation + – Pranay Datta 1 asked Jun 10, 2015 Pranay Datta 1 18.5k views answer comment Share Follow See all 19 Comments See all 19 19 Comments reply Show 16 previous comments Gupta731 commented Dec 12, 2018 reply Follow Share Any process without any assumptions? 0 votes 0 votes Naveen Kumar 3 commented Dec 12, 2018 reply Follow Share https://cs.stackexchange.com/questions/101328/let-fn-omegan-gn-on-and-hn-thetan-then-fn-gnhn-is#comment216175_101328 A is correct. 2 votes 2 votes nadeshseen commented Oct 9, 2019 reply Follow Share how did you assume f(n) is Ω(1) and h(n) is Ω(n)? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes [f(n).g(n)] + h(n) [O(n).☊(n)] + ⊖(n) //* since b/w O(n) and ☊(n) .........O(n) is the dominating one*// O(n) + ⊖(n) O(n) bgfbfg answered Jun 30, 2015 bgfbfg comment Share Follow See 1 comment See all 1 1 comment reply Verma Ashish commented Oct 3, 2018 reply Follow Share It will be O(n²) and Ω(n). Arjun sir explained it very well. 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes check this solution. Rudra Pratap answered Jul 26, 2018 Rudra Pratap comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes https://gateoverflow.in/226416/time-complexity yuviabhi answered Jun 14, 2019 yuviabhi comment Share Follow See all 0 reply Please log in or register to add a comment.