Computer Science and Engineering Data Structures - 2 Experiments

Aim

Overview

Recap

Pretest

Selection Sort

Aim Concept Algorithm Demo Practice Exercise Quiz

Code Assessment

Analysis

Aim Overview Time and Space Complexity Demo Comparison with other Algorithms Quiz

Posttest

Selection Sort

Choose difficulty:

Beginner

Intermediate

Advanced

1. Selection sort has the same average-case time complexity as worst-case time complexity.

a: True Explanation

Explanation

b: False Explanation

Explanation

2. In which case can selection sort be used?

a: For a fast and efficient sorting Explanation

Explanation

b: For memory efficient sorting Explanation

Explanation

c: Sorting without comparisons Explanation

Explanation

d: None of the above Explanation

Explanation

3. Pick the incorrect step in selection sorting.

a: Find the smallest element with the least index, such that index≤i≤N-1. Explanation

Explanation

b: Swap the element at index i with the element at index i+1. Explanation

Explanation

c: Swap the smallest element found with the element at index i. Explanation

Explanation

d: None of the above Explanation

Explanation

4. What are the correct intermediate steps when you perform Selection Sort on [2, 7, -3, 5]?

a: [-3, 2, 7, 5] -> [-3, 2, 5, 7] Explanation

Explanation

b: [-3, 7, 2, 5] -> [-3, 2, 7, 5] -> [-3, 2, 5, 7] Explanation

Explanation

c: [-3, 7, 5, 2] -> [-3, 2, 5, 7] Explanation

Explanation

d: [-3, 7, 2, 5] -> [-3, 5, 2, 7] -> [-3, 2, 5, 7] Explanation

Explanation

5. How many loops are there in the selection sort code?

a: One loop Explanation

Explanation

b: Two nested loops Explanation

Explanation

c: Two separate loops Explanation

Explanation

d: Three separate loops Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)