MCQOPTIONS
Home
About Us
Contact Us
Bookmark
Saved Bookmarks
Testing Subject
General Aptitude
Logical and Verbal Reasoning
English Skills Ability
Technical Programming
Current Affairs
General Knowledge
Finance & Accounting
GATE (Mechanical Engineering)
Chemical Engineering
→
Data Structures and Algorithms
→
Evaluation Infix Expression Not Parenthesized
→
O(N_2N)?$
1.
O(N_2N)?$
A.
O(n<sup>2</sup>)
B.
O(n log n)
C.
O(2<sup>n</sup>) (n is the size of set)
Answer» C. O(2<sup>n</sup>) (n is the size of set)
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
The number of elements in the power set increases when there are duplicates present in the set.
What will be the auxiliary space requirement of the following code?
Choose the correct statement for the following code segment?
Number of elements in the power set of set S={1,2,2} will be?
O(N_2N)?$
a,b,ab,c,ac,bc,abc,
function returns true if N is odd
Number of elements in the power set of set S={1,2,3} will be?
What is meant by the power set of a set?
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies