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 equivalent of log100.

a: log10 Explanation

Explanation

b: 2log10 Explanation

Explanation

c: log1000 Explanation

Explanation

d: 0 Explanation

Explanation

2. If each element of the array is traversed N (size of the array) times, what is the time complexity of the algorithm?

a: O(N) Explanation

Explanation

b: O(N^2) Explanation

Explanation

c: O(2N) Explanation

Explanation

d: O(N^3) Explanation

Explanation

3. Pick the correct option.

a: Array has O(1) lookup time complexity Explanation

Explanation

b: The elements of an array are stored contiguously in memory Explanation

Explanation

c: Array can be used to implement stacks & queues Explanation

Explanation

d: All of the above Explanation

Explanation

4. What is the complexity of searching a number in an unsorted array?

a: O(N) Explanation

Explanation

b: O(N^2) Explanation

Explanation

c: O(NlogN) Explanation

Explanation

d: O(N^3) Explanation

Explanation

5. Space complexity refers to the amount of memory taken by the algorithm in asymptotic notation.

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)