0 votes 0 votes Algorithms asymptotic-notation algorithms time-complexity + – GateAspirant999 asked Feb 2, 2017 GateAspirant999 389 views answer comment Share Follow See all 2 Comments See all 2 2 Comments reply Smriti012 commented Feb 2, 2017 reply Follow Share Only A is true! 0 votes 0 votes Ashwani Kumar 2 commented Feb 2, 2017 reply Follow Share If the question is T1(n) = O(F(n)) and T2(n) = O(F(n)) then we can say T1(n) = max( F(n), F(n) ) = O(F(n)) which is option A. Isn't it...?? Why they have not used upper bound with T1 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes Option a Purvi Agrawal answered Feb 3, 2017 Purvi Agrawal comment Share Follow See 1 comment See all 1 1 comment reply Ashwani Kumar 2 commented Feb 3, 2017 reply Follow Share How..?? 0 votes 0 votes Please log in or register to add a comment.
0 votes 0 votes only A is true Chandrabhan Vishwa 1 answered Jun 28, 2018 Chandrabhan Vishwa 1 comment Share Follow See all 0 reply Please log in or register to add a comment.