M

Mr. Dubey • 100.69K Points
Coach

Q. A sorting algorithm is stable if

  • (A) its time complexity is constant irrespective of the nature of input
  • (B) preserves the original order of records with equal keys
  • (C) its space complexity is constant irrespective of the nature of input
  • (D) it sorts any volume of data in a constant time
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Related MCQs

Q. The Boolean expression Y(A, B, C) = A + BC is to be realized using 2-input gates of only one type. What is the minimum number of gates required for th

Q. A 2 bit binary multiplier can be implemented using ?

Q. A 64-bit word consists of ________ ?

Q. By adding recirculating lines to a 4-bit parallel-in, serial-out shift register, it becomes a ________, ________, and ________-out register ?

Q. String with zero characters is called ________ string.

Q. A capacitor is generally a

Q. In a computer the data transfer between hard disk and CPU is nearly the same as that between diskette and CPU.

Q. In a P-type semiconductor, minority carriers are ?

Q. A fully controlled converter uses

Q. Transmit time is the time taken by the electrons on holes to pass from

Question analytics