Chapter 6: Sorting

Chapter 6: Sorting

1 / 50

Sorting is an example of:

Algorithm

Hardware

Network

OS

2 / 50

Sorting is used in:

Databases

Search engines

File systems

All

3 / 50

Worst case occurs when:

Sorted

Reverse

Random

None

4 / 50

Best case occurs when:

Sorted list

Reverse list

Random

None

5 / 50

Sorting reduces:

Searching time

Memory

CPU

None

6 / 50

Sorting complexity depends on:

Input size

Algorithm

Both

None

7 / 50

Which is unstable?

Bubble

Selection

Insertion

None

8 / 50

Which is stable?

Bubble

Insertion

Both

Selection

9 / 50

Stable sorting means:

Maintains order of equal elements

Changes order

Deletes elements

None

10 / 50

Fastest among simple sorts:

Bubble

Selection

Insertion

All same

11 / 50

Insertion sort uses:

Comparison

Swapping

Shifting

All

12 / 50

It works efficiently on:

Sorted data

Random data

Large data

None

13 / 50

Insertion sort shifts elements:

Left

Right

Both

None

14 / 50

Suitable for:

Large data

Small data

Infinite data

None

15 / 50

Insertion sort is:

Stable

Unstable

None

Recursive

16 / 50

Worst case complexity:

O(n²)

O(n)

O(log n)

O(1)

17 / 50

Best case complexity:

O(n)

O(n²)

O(log n)

O(1)

18 / 50

Insertion sort is similar to:

Playing cards arrangement

Queue

Stack

None

19 / 50

It inserts element into:

Unsorted part

Sorted part

Middle

None

20 / 50

Insertion sort builds:

Sorted list

Random list

Reverse list

None

21 / 50

Selection sort always runs in:

O(n)

O(n²)

O(log n)

O(1)

22 / 50

Selection sort is good for:

Small datasets

Large datasets

Infinite data

None

23 / 50

Selection sort compares:

Adjacent

All elements

Random

None

24 / 50

First pass places:

Largest element

Smallest element

Middle element

None

25 / 50

Selection sort performs:

Many swaps

Few swaps

No swaps

Infinite swaps

26 / 50

Selection sort is:

Stable

Unstable

Recursive

None

27 / 50

Time complexity:

O(n)

O(n²)

O(log n)

O(1)

28 / 50

Number of swaps in selection sort:

Maximum

Minimum

None

Equal

29 / 50

Selection sort divides list into:

Two halves

Sorted & unsorted

Equal parts

None

30 / 50

Selection sort selects:

Largest element

Smallest element

Middle element

Random

31 / 50

Bubble sort is inefficient for:

Small data

Large data

Medium data

None

32 / 50

Bubble sort is easy to:

Understand

Implement

Both

None

33 / 50

Best case complexity:

O(n²)

O(n)

O(log n)

O(1)

34 / 50

Bubble sort swaps when:

Elements equal

Wrong order

Sorted

None

35 / 50

Bubble sort is:

Stable

Unstable

Recursive

None

36 / 50

Worst-case complexity of bubble sort:

O(n)

O(n log n)

O(n²)

O(1)

37 / 50

Bubble sort is also called:

Exchange sort

Merge sort

Quick sort

Heap sort

38 / 50

Number of passes in bubble sort for n elements:

n

n-1

n+1

n/2

39 / 50

In bubble sort, largest element moves to:

Start

Middle

End

None

40 / 50

Bubble sort compares:

First and last

Adjacent elements

Random elements

None

41 / 50

Sorting arranges elements based on:

Condition

Size/value

Color

None

42 / 50

Sorting is a part of:

Networking

Programming

Hardware

OS

43 / 50

Sorting helps in:

Faster searching

Data duplication

Data deletion

None

44 / 50

Sorting is useful in:

Databases

Lists

Arrays

All

45 / 50

Sorting is mainly used for:

Searching

Organizing data

Deleting data

Printing

46 / 50

Which is NOT a sorting algorithm?

Bubble Sort

Selection Sort

Binary Search

Insertion Sort

47 / 50

Sorting improves:

Data access speed

Program size

Memory

None

48 / 50

Which type of data can be sorted?

Numbers

Strings

Both

None

49 / 50

Sorting can be done in:

Ascending order

Descending order

Both A and B

None

50 / 50

Sorting means arranging data in:

Random order

Specific order

Reverse only

None

Your score is

The average score is 0%