Class 11 Understanding Sorting MCQ Quiz

Preview



1
Created on By Lucky

Class 11 Understanding Sorting Quiz

1 / 16

In ith pass of insertion sort, previous (i-1) element are already sorted.

 

2 / 16

 In ith pass of Bubble sort,sorting in ascending order, the  ith largest element is placed at ith last position .

 

3 / 16

Insertion sort is the fastest sorting algorithm.

 

4 / 16

Bubble sort is the fastest sorting algorithm.

5 / 16

The insertion sort algorithm will take maximum ____ passes to sort an array of  n elements

 

6 / 16

The algorithm that picks one element at a time from unsorted segment and places it to its correct position as the sort order in sorted segment is called ___ sort.

7 / 16

The Bubble sort algorithm will take maximum ____ passes to sort an array of  P elements.

 

8 / 16

The algorithm that sorts elements by comparing two adjacent elements and swapping them to be in the right order is called ___ sort.

 

9 / 16

____ refers to the arrangement of elements in a specific order.

 

10 / 16

Which of the following real time example is based on insertion sort?

 

11 / 16

For the list [ 34,8,14,51,32,21], how will the list elements look like after second pass in Insertion Sort ?

 

12 / 16

For the list [34,8,14,51,32,21], how will the list elements  look like after second  pass in Bubble sort ?

 

13 / 16

How many passes does a bubble sort algorithm take to sort an array of N elements ?

 

14 / 16

How many passes does an insertion sort algorithm take to sort an array of N elements?

 

15 / 16

Which of the following are sorting algorithms?

 

16 / 16

Arranging element of an array or a list in an order is known as _____.

 

Your score is

The average score is 31%

0%



 

Lesson tags: Class 11 Dictionary MCQ Quiz, python quiz class 11, python quiz for class 12
Back to: CBSE class 11 Computer Science Notes