1 votes 1 votes which of the following estimates are true? Explain with valid reasons. a) (2n)! is theta (n)! b) log((2n)!) is theta (log(n)!) Algorithms asymptotic-notation algorithms + – AIkiran01 asked Jul 14, 2018 AIkiran01 1.9k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
4 votes 4 votes a) false b) true abhishekmehta4u answered Jul 14, 2018 abhishekmehta4u comment Share Follow See all 10 Comments See all 10 10 Comments reply Show 7 previous comments Mayankprakash commented Jul 15, 2018 reply Follow Share @shubham To the previous reply of Abhishek can I tell f(n) = omega(g(n)) as g(n) is lower bound or smaller to f(n)? Thanks 0 votes 0 votes Shubham Shukla 6 commented Jul 15, 2018 reply Follow Share @mayanprakash yes that you can say..! 1 votes 1 votes harishrajora commented Jul 17, 2018 reply Follow Share Can anyone specify any particular source or pdf or anything by which it is mentioned how to solve these type of questions? 0 votes 0 votes Please log in or register to add a comment.
