0 votes 0 votes Let $f\left ( n \right )$m $g\left ( n \right )$ and $h\left ( n \right )$ be functions whose domain is a subset of positive integers such that $f\left ( n \right )= O\left (n^{2}\right), g\left ( n \right )= O\left(n^{3}\right), h\left ( n \right )= O\left(n^{4}\right).$ Then: $f \left ( n \right ) +g \left ( n \right )= O \left(n^{3}\right)$ $h \left ( n \right ) -g \left ( n \right )=O \left ( n \right )$ $f \left ( n \right ).g \left ( n \right )=O\left( n^{4}\right)$ $h \left ( n \right ) .g \left ( n \right ) =O\left(n^{7}\right)$ Which of the above is/are incorrect? $(d)$ $only$ $(c)$ $only$ $(b)$ $and$ $(d)$ $only$ $(b)$ $and$ $(c)$ $only$ Algorithms tbb-mockgate-1 asymptotic-notation algorithms + – Bikram asked Jan 16, 2017 • edited Jan 9, 2020 by Arjun Bikram 633 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 2 votes 2 votes Here (a) is correct because f(n) = O(n^2) and g(n) = O(n^3), and f(n) + g(n) = O(n^3) (Addition Rule asymptotic behavior) Similarly item (d) is also correct according to the Multiplication Rule for asymptotic behavior. Hence the answer is (D). Bikram answered Jan 16, 2017 • selected Jan 17, 2017 by Bikram Bikram comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments vineet.ildm commented Feb 7, 2017 reply Follow Share oh no...question was asking which is incorrect.. sorry...i have to be more careful 1 votes 1 votes Bikram commented Feb 7, 2017 reply Follow Share @vineet why not read question carefully !! it says Which of the above is/are incorrect ? 0 votes 0 votes Shubham Aggarwal commented Jan 16, 2019 reply Follow Share can someone explain option b why it is wrong. 1 votes 1 votes Please log in or register to add a comment.