UGC/CBSE NET SOLVED QUESTION PAPERS.(Computer Science)
Thursday 28 May 2015
Q35,paper 2,J13. Give as good a big–O estimate as possible for the following functions :
(nlogn+n
2
)(n
3
+2) and (n!+2
n
) (n
3
+
log(n
2
+1))
(A) O(n
5
+2n
2
)
& O(n
3
*n!)
(B) O(n
5
) & O(n
3
*2
n
)
(C) O(n
5
) & O(n
3
* n!)
(D) O(n
5
+2n
2
) & O(n
3
*2
n
)
Answer C.
No comments:
Post a Comment
Note: only a member of this blog may post a comment.
Newer Post
Older Post
Home
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment
Note: only a member of this blog may post a comment.