Q. If for an algorithm time complexity is given by O(log₂n) then complexity will be ___________

View solution

Q. If for an algorithm time complexity is given by O(n) then the complexity of it is ___________

View solution

Q. If for an algorithm time complexity is given by O(n²) then complexity will ___________

View solution

Q. If for an algorithm time complexity is given by O((3⁄2)ⁿ) then complexity will be ___________

View solution

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