Test: Sorting - 1 - CUET Humanities MCQ

# Test: Sorting - 1 - CUET Humanities MCQ

Test Description

## 10 Questions MCQ Test Computer Science Practice Tests: CUET Preparation - Test: Sorting - 1

Test: Sorting - 1 for CUET Humanities 2024 is part of Computer Science Practice Tests: CUET Preparation preparation. The Test: Sorting - 1 questions and answers have been prepared according to the CUET Humanities exam syllabus.The Test: Sorting - 1 MCQs are made for CUET Humanities 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Sorting - 1 below.
Solutions of Test: Sorting - 1 questions in English are available as part of our Computer Science Practice Tests: CUET Preparation for CUET Humanities & Test: Sorting - 1 solutions in Hindi for Computer Science Practice Tests: CUET Preparation course. Download more important topics, notes, lectures and mock test series for CUET Humanities Exam by signing up for free. Attempt Test: Sorting - 1 | 10 questions in 10 minutes | Mock test for CUET Humanities preparation | Free important questions MCQ to study Computer Science Practice Tests: CUET Preparation for CUET Humanities Exam | Download free PDF with solutions
Test: Sorting - 1 - Question 1

### Which of the following sorting algorithms has the lowest best case time complexity?

Detailed Solution for Test: Sorting - 1 - Question 1

Best case time complexity of bubble sort is O(n).

Test: Sorting - 1 - Question 2

### What is the complexity of bubble sort algorithm?

Detailed Solution for Test: Sorting - 1 - Question 2

f(n) = (n - 1) + (n + 2) ...
Hence, option 2 is the correct answer.

 1 Crore+ students have signed up on EduRev. Have you?
Test: Sorting - 1 - Question 3

### What is the best case complexity of bubble sort?

Detailed Solution for Test: Sorting - 1 - Question 3

Best case is that in which the algorithm stops itself, once a pass makes no changes.
The only need is to do n comparisons. So, the best case complexity is O(n).

Test: Sorting - 1 - Question 4

Array a = 5, 1, 4, 2, 8
What is the outcome of the first pass of bubble sort?

Detailed Solution for Test: Sorting - 1 - Question 4

First Pass:
(5 1 4 2 8) (1 5 4 2 8), Here, algorithm compares the first two elements and swaps them.
(1 5 4 2 8) (1 4 5 2 8), Swap since 5 > 4
(1 4 5 2 8) (1 4 2 5 8), Swap since 5 > 2
(1 4 2 5 8) (1 4 2 5 8), Now, since these elements are already in order (8 > 5), algorithm does not swap them.

Test: Sorting - 1 - Question 5

The total number of average comparisons in bubble sort is

Detailed Solution for Test: Sorting - 1 - Question 5

Bubble sort (seeking sort) is a simple sorting algorithm. In this, we compare each pair of adjacent items and swap them if they are in wrong order.
Number of comparisons in bubble sort = (n - 1) + (n - 2) + ... + (3) + (2) + (1) = n(n-1)/2
So, the complexity of bubble sort will be o(n2). Average comparisons will be o(n2).
Therefore, option 2 is the correct answer.

Test: Sorting - 1 - Question 6

What is the worst case space complexity of selection sort?

Detailed Solution for Test: Sorting - 1 - Question 6

Selection sort is a sorting algorithm, specifically an in-place comparison sort. It has space complexity of O(n) in the worst case.

Test: Sorting - 1 - Question 7

Selection sort's worst case time complexity is

Detailed Solution for Test: Sorting - 1 - Question 7

The worst case time complexity of selection sort is O(N2).

Test: Sorting - 1 - Question 8

Selection sort's average case space complexity is

Detailed Solution for Test: Sorting - 1 - Question 8

Selection sort's average case space complexity is O.

Test: Sorting - 1 - Question 9

What is the worst case running time of insertion sort, if the number of elements is n?

Detailed Solution for Test: Sorting - 1 - Question 9

The worst case is when the elements are in reverse order. In this case, the maximum number of key comparisons is possible.
Hence, the total number of comparisons is

Test: Sorting - 1 - Question 10

Which of the following types of sort algorithm keeps the left side of the array sorted until the whole array is sorted?

Detailed Solution for Test: Sorting - 1 - Question 10

Insertion sort is a sort algorithm that keeps the left side of the array sorted until the whole array is sorted.

## Computer Science Practice Tests: CUET Preparation

28 tests
Information about Test: Sorting - 1 Page
In this test you can find the Exam questions for Test: Sorting - 1 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Sorting - 1, EduRev gives you an ample number of Online tests for practice

28 tests