UNIT 4-SORTING IN PYTHON Quiz

UNIT 4-SORTING IN PYTHON Quiz

1st Grade

10 Qs

quiz-placeholder

Similar activities

Algorithms

Algorithms

1st - 5th Grade

10 Qs

B Words GCSE Computer Science

B Words GCSE Computer Science

1st - 10th Grade

15 Qs

Divide and conquer

Divide and conquer

1st Grade

10 Qs

Sorting Algorithms Quiz 1

Sorting Algorithms Quiz 1

1st Grade

10 Qs

Algorithm Quiz

Algorithm Quiz

1st - 2nd Grade

15 Qs

REVISION ON ICT(Y1)

REVISION ON ICT(Y1)

1st Grade

10 Qs

Binary and Linear

Binary and Linear

1st - 5th Grade

10 Qs

BÀI 8. SẮP XẾP VÀ LỌC DỮ LIỆU

BÀI 8. SẮP XẾP VÀ LỌC DỮ LIỆU

1st - 12th Grade

10 Qs

UNIT 4-SORTING IN PYTHON Quiz

UNIT 4-SORTING IN PYTHON Quiz

Assessment

Quiz

Computers

1st Grade

Medium

Created by

DHASAMALIKA S

Used 2+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the Bubble sort algorithm?

Bubble sort is a method for organizing bubbles in a bubble bath.

Bubble sort is a type of soap used for washing dishes.

Bubble sort is a popular dance move at parties.

Bubble sort is a simple sorting algorithm that repeatedly steps through the list, compares adjacent elements and swaps them if they are in the wrong order.

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How does the Bubble sort algorithm work?

Bubble sort randomly shuffles the elements in the list.

Bubble sort compares every element with the first element and swaps them if they are in the wrong order.

Bubble sort only compares elements at even indices and swaps them if they are in the wrong order.

Bubble sort compares adjacent elements and swaps them if they are in the wrong order.

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Explain the Selection sort algorithm.

Selection sort is a type of data structure

Selection sort algorithm is not efficient and should not be used

Selection sort is a simple sorting algorithm that works by repeatedly finding the minimum element from the unsorted part of the array and putting it at the beginning.

Selection sort works by sorting the array in descending order

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the main idea behind the Selection sort algorithm?

To repeatedly select the largest element from the unsorted part and move it to the end of the sorted part

To randomly shuffle the input list

To divide the input list into two parts: the sorted part and the unsorted part, and then repeatedly select the smallest element from the unsorted part and move it to the end of the sorted part.

To sort the input list in descending order

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

What is the time complexity of the Selection sort algorithm?

O(n)

O(n!)

O(log n)

O(n^2)

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Describe the Insertion sort algorithm.

Insertion sort is the most efficient sorting algorithm for large lists.

Insertion sort is not a sorting algorithm.

Insertion sort is a complex sorting algorithm that builds the final sorted array all at once.

Insertion sort is a simple sorting algorithm that builds the final sorted array one item at a time. It is much less efficient on large lists than more advanced algorithms such as quicksort, heapsort, or merge sort.

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

How does the Insertion sort algorithm work?

It removes the smallest element from the list

It randomly shuffles the list

It iterates through the list and moves each element to its correct position.

It compares each element with the middle element

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?