1 votes 1 votes Algorithms asymptotic-notation algorithms + – Vaijenath Biradar asked Jan 19, 2016 Vaijenath Biradar 1.5k views answer comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments resuscitate commented Jan 24, 2016 reply Follow Share https://gateoverflow.in/11232/let-f-n-%CF%89-n-g-n-o-n-and-h-n-%D1%B3-n?show=11232#q11232 check this,and talk properly,you may do good or grt result,but pls learn how to talk with others,that is most important..i think your age is not < 20,so be mature.. and i asked that arjun sir.. –1 votes –1 votes Aspi R Osa commented Jan 24, 2016 reply Follow Share did you find it offensive? i am so sorry. its just that my sayantance forming is a little wierd. I just meant to ask that is it possible to do like that? :) 0 votes 0 votes Arjun commented Jan 24, 2016 reply Follow Share yes. f(n) >= n, g(n) <= n, we cannot determine g accurately. 0 votes 0 votes Please log in or register to add a comment.
2 votes 2 votes Actually none of the options are correct check this https://gateoverflow.in/36807/let-f-n-%CF%89-n-and-g-n-o-f-n-then-g-n-_______-assume-n-0-1-%CF%89-n-2-o-n-3-%CE%B8-n-4-%CF%89-1 shivanisrivarshini answered Jan 24, 2016 shivanisrivarshini comment Share Follow See all 0 reply Please log in or register to add a comment.
1 votes 1 votes NOTA . g(n) can be 1/N http://stackoverflow.com/questions/905551/are-there-any-o1-n-algorithms n Aspi R Osa answered Jan 24, 2016 Aspi R Osa comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes F(n)=omega(n)=n,$n^2$,$n^3$ etc So g(n)=O(n),O($n^2$),O($n^3$) etc , So option O(n) matches. chat28 answered Jan 20, 2016 • edited Jan 20, 2016 by chat28 chat28 comment Share Follow See all 9 Comments See all 9 9 Comments reply Show 6 previous comments chat28 commented Jan 20, 2016 reply Follow Share http://cs.stackexchange.com/questions/52069/nested-complexities I asked this is CS.stackexchange and got the following reply! 1 votes 1 votes Aspi R Osa commented Jan 24, 2016 reply Follow Share @Arjun sir: to the gate people know about these 1/n algorithms? i mean, is it considered in any of the books? 0 votes 0 votes Arjun commented Jan 24, 2016 reply Follow Share GATE people are IIT profs - until they outsource it which I do not think they will do as they are intelligent. So, they will mostly stick to standard definitions. And for GATE they usually won't ask boundary questions. 1 votes 1 votes Please log in or register to add a comment.