# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## Data Structure Questions and Answers-Selection Sort

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is an in-place sorting algorithm?

It needs O(1) or O(logn) memory to create auxiliary locations | |

The input is already sorted and in-place | |

It requires additional storage | |

None of the mentioned |

Question 1 Explanation:

Auxiliary memory is required for storing the data temporarily.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

In the following scenarios, when will you use selection sort?

The input is already sorted | |

A large file has to be sorted | |

Large values need to be sorted with small keys | |

Small values need to be sorted with large keys |

Question 2 Explanation:

Selection is based on keys, hence a file with large values and small keys can be efficiently sorted with selection sort.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is the worst case complexity of selection sort?

O(nlogn) | |

O(logn) | |

O(n) | |

O(n ^{2}) |

Question 3 Explanation:

Selection sort creates a sub-list, LHS of the 'min' element is already sorted and RHS is yet to be sorted. Starting with the first element the 'min' element moves towards the final element.

Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Select the appropriate code that performs selection sort.

int min; for(int j=0; j<arr.length-1; j++) { min = j; for(int k=j+1; k<= | |

int min; for(int j=0; j<arr.length-1; j++) { min = j; for(int k=j+1; k | |

int min; for(int j=0; j<arr.length-1; j++) { min = j; for(int k=j+1; k<=< | |

int min; for(int j=0; j<arr.length-1; j++) { min = j; for(int k=j+1; k<=< |

Question 4 Explanation:

Starting with the first element as 'min' element, selection sort loops through the list to select the least element which is then swapped with the 'min' element.

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is the advantage of selection sort over other sorting techniques?

It requires no additional storage space | |

It is scalable | |

It works best for inputs which are already sorted | |

It is faster than any other sorting technique |

Question 5 Explanation:

Since selection sort is an in-place sorting algorithm, it does not require additional storage.

There are 5 questions to complete.