Computer Science and Engineering Data Structures - 2 Experiments

Aim

Overview

Recap

Pretest

Radix Sort

Aim Concept Algorithm Demo Practice Exercise Quiz

Code Assessment

Analysis

Aim Overview Time and Space Complexity Stable and Comparison sort Comparison with other Algorithms Quiz

Posttest

Radix Sort

Choose difficulty:

Beginner

Intermediate

Advanced

1. Pick the incorrect option

a: Radix sort uses buckets to hold numbers with the same value for the digit in consideration Explanation

Explanation

b: Radix sort can perform better than bubble sort Explanation

Explanation

c: Radix sort does not require any extra space Explanation

Explanation

d: Radix sort starts with the least significant bit Explanation

Explanation

2. Which extra data structure is used in radix sort?

a: Heap Explanation

Explanation

b: Array Explanation

Explanation

c: Queue Explanation

Explanation

d: None of the above Explanation

Explanation

3. Radix Sort has worse space complexity than Bubble Sort

a: True Explanation

Explanation

b: False Explanation

Explanation

4. Radix sort is a generalization of which sorting algorithm

a: Bubble Sort Explanation

Explanation

b: Counting Sort Explanation

Explanation

c: Selection Sort Explanation

Explanation

d: Merge Sort Explanation

Explanation

5. Radix sort can perform better than comparison based sorting

a: True Explanation

Explanation

b: False Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

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