Home / Engineering / Data Structure and Algorithms (DSA) / Question

M

Mr. Dubey • 51.43K Points
Coach 

Q.) In selection sort of n elements,how many times is the swap function called in the complete execution of the algorithm?

(A) 1
(B) n-1
(C) n(n-1)/2
(D) none of these
Correct answer : Option (B) - n-1

Share

Previous

Next

Discusssion

Login to discuss.

Related MCQs on Data Structure and Algorithms (DSA)

Q. Consider an implementation of unsorted singly linked list. Suppose it has its representation with a head and tail pointer. Given the representation, which of the following operation can be implemented in O(1) time? i) Insertion at the front of the linked list ii) Insertion at the end of the linked list iii) Deletion of the front node of the linked list iv) Deletion of the last node of the linked lis

Q. A graph is said to be complete if there is an edge between every pair of vertices.

Q. If all the SCR’s of 3 phase PAC is replaced by diodes, they would be triggered

Q. The BJT is a device. The FET is a device.

Q. How many transistors must be used in a class B power amplifier to obtain the output for the full cycle of the signal?

Q. During a read operation the CPU fetches _.

Q. A variation of linked list is circular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is?

Q. Select the correct statement

Q. In power amplifiers, the output signal varies for a full 360º of the cycle.

Q. Which of the item below does not describe a common emitter amplifier?