Question
a.
constant
b.
quardratic
c.
exponential
d.
none of the mentioned
Posted under Discrete Mathematics
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. If for an algorithm time complexity is given by O((3⁄2)ⁿ) then complexity will be ___________
Similar Questions
Discover Related MCQs
Q. The time complexity of binary search is given by ___________
View solution
Q. The time complexity of the linear search is given by ___________
View solution
Q. Which algorithm is better for sorting between bubble sort and quicksort?
View solution
Q. Time complexity of the binary search algorithm is constant.
View solution
Q. The binary notation of 231 is ___________
View solution
Q. The decimal notation of 101010101 is ___________
View solution
Q. The binary notation of ABBA is ___________
View solution
Q. The hexadecimal notation of (1011 0111 1011)₂ is ___________
View solution
Q. The octal expansion of (10 1011 1011)₂ is ___________
View solution
Q. The hexadecimal expansion of (177130)₁₀ is ___________
View solution
Q. The greatest common divisor of 414 and 662 is?
View solution
Q. The greatest common divisor of 12 and 18 is?
View solution
Q. The decimal expansion of (2AE0B)₁₆ is?
View solution
Q. The greatest common divisor of 7 and 5 is?
View solution
Q. The quotient when 19 is divided by 6 is?
View solution
Q. The remainder when 111 is divided by 12 is?
View solution
Q. The quotient and remainder when -1 is divided by 3 is?
View solution
Q. The value of 12 mod 3 is?
View solution
Q. The value of 155 mod 9 is?
View solution
Q. Is 17 congruent to 4 modulo 6.
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Discrete Mathematics? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!
