M

Mr. Dubey • 52.30K Points
Coach 

Q. Give timing complexities of three sorting algorithms bubble sort,selection sort,insertion sort respectively.

(A) 0(log n), 0(log n), o(log n)
(B) o(n2), o(n2), o(n2)
(C) o(n2), o(n log n), o(n log n)
(D) o(n log n), o(n2), o(n log n)
Correct : Option (B)

Share

Discusssion

Login to discuss.

Related MCQs

Q. In 8 connected region if one pixel is (2,3) then remaining neighboring pixels are

Q. The state of a flip-flop can be switched by changing its ________ signals ?

Q. The use of ........ instruments is merely confined within laboratories instruments. as standardizing ?

Q. Base-to-emitter voltage is forward-biased transistor decreases with the increase of temperature at the following rate ?

Q. Tabular method of simplification is convenient as long as the number of variables does not exceed ?

Q. The NAND-NAND realization is equivalent to ?

Q. The available power required at a receiving antenna is 106 Watts. Transmitting and receiving antennas have gain of 40 dB each. The carrier frequency i

Q. Indicate which one of the following is NOT and advantage of FM over AM ?

Q. In an inside test if number of intersections is odd then point is ---------------- of the polygon. Note : intersection point is not a vertex

Q. The function F(A, B, C) = (1, 2, 3, 5, 7) is equivalent to ?