PDS - 04225 - Sorting Algorithms - Chapter 11 - Part 2

PDS - 04225 - Sorting Algorithms - Chapter 11 - Part 2

University

10 Qs

quiz-placeholder

Similar activities

Engineering ACW Semester 2 - #5 AI Part 2

Engineering ACW Semester 2 - #5 AI Part 2

University

15 Qs

GIS Unit-1

GIS Unit-1

University

15 Qs

Unit 2 - AI by Prof. R. Rajkumar

Unit 2 - AI by Prof. R. Rajkumar

University

15 Qs

DataQuest_Quiz

DataQuest_Quiz

University

15 Qs

Data Science Quiz

Data Science Quiz

University

12 Qs

III Year - UNIT I - Data Minig

III Year - UNIT I - Data Minig

University

10 Qs

OS QUIZ(UNIT-III)

OS QUIZ(UNIT-III)

University

10 Qs

Computer Security:Encryption

Computer Security:Encryption

10th Grade - University

10 Qs

PDS - 04225 - Sorting Algorithms - Chapter 11 - Part 2

PDS - 04225 - Sorting Algorithms - Chapter 11 - Part 2

Assessment

Quiz

Computers

University

Medium

Created by

Rafael Orta

Used 255+ times

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which algorithm matches this description: "a sorting algorithm that treats the input as two parts, a sorted part and an unsorted part, and repeatedly selects the proper next value to move from the unsorted part to the end of the sorted part."

Selection Sort

Insertion Sort

Radix Sort

Merge Sort

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which algorithm matches this description: "a sorting algorithm that treats the input as two parts, a sorted part and an unsorted part, and repeatedly inserts the next value from the unsorted part into the correct location in the sorted part."

Selection Sort

Insertion Sort

Merge Sort

Radix Sort

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which algorithm matches this description: "a sorting algorithm that treats the input as a collection of interleaved lists, and sorts each list individually with a variant of the insertion sort algorithm."

Selection Sort

Insertion Sort

Merge Sort

Shell Sort

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Assume shell sort and a list of 6 elements, with a gap value of 3, how many interleaved lists will be sorted?

1

2

3

6

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Assume shell sort and a list of 6 elements, with a gap value of 3, how many items will be in each interleaved list?

1

2

3

6

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Assume shell sort and a list of 6 elements, If a gap value of 2 is chosen, how many interleaved lists will be sorted?

1

2

3

6

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which algorithm matches this description: "a sorting algorithm that repeatedly partitions the input into low and high parts (each part unsorted), and then recursively sorts each of those parts."

Selection Sort

Insertion Sort

Shell Sort

Quicksort

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?

Discover more resources for Computers