0 votes 0 votes Algorithms test-series + – soumayan bandhu asked Nov 9, 2017 soumayan bandhu 592 views answer comment Share Follow See all 8 Comments See all 8 8 Comments reply Show 5 previous comments Anjan commented Nov 9, 2017 reply Follow Share Theta(n) = n , g(n) may take values n,n^2,n^3..... , h(n) may take values 1,logn,...n f(n)+g(n).h(n) = n + {n or n^2 or n^3....} {1,logn,,,,n} =n + {n,nlogn,n^2,....} that means lower bound is n it can't go below n at any case. Option C. 5 votes 5 votes SHUBHAM SHASTRI commented Nov 9, 2017 reply Follow Share ok got it.. 0 votes 0 votes Rishabh Gupta 2 commented Nov 9, 2017 reply Follow Share https://gateoverflow.in/150229/asymptotic-notations 0 votes 0 votes Please log in or register to add a comment.