# Sorting and Searching Mcqs

Our collections of Multiple choice questions and answers focuses on study of ” Sorting and Searching ” in Data Structures. These questions are chosen from a collection of most authoritative and best reference books on Data Structures. Our aim is to prepare an individual for competitive exams like NTS | GAT | ECAT | Data Warehouse jobs | Data Mining | DB administration jobs Software House and Computer Programmer jobs | University and College entrance exams and various tests and job interviews. One should practice our Mcqs to assimilate Sorting and Searching comprehensively.

1. Home
2. »
3. Computer Science Mcqs
4. »
5. Data Structures Mcqs
6. »
7. Sorting and Searching Mcqs

## 1. A desirable choice for the partitioning element in quick sort is

First element of the list

Last element of the list

Randomly chosen element of the list

Median of the list

O(n)

O(2n)

O(n^2)

O(log n)

## 3. A character of the data that binary search uses but the linear search ignores, is

Maximum value in the list

Minimum value in list

Length of the list

Order of the list

## 4. A characteristic of the data that binary search uses but the linear search ignores is the___________.

Order of the elements of the list.

Length of the list.

Maximum value in list.

Type of elements of the list.

## 5. A man wants to go different places in the world. He has listed them down all. But there are some places where he wants to visit before some other places. What application of graph can he use to determine that?

Depth First Search

Topological Sorting

Dijkstra’s Shortest path algorithm

Merge Sort

Quick Sort

Insertion Sort

Selection Sort

Serial

Binary

Parallel

Random

Heap sort

Quick sort

Bubble sort

Insertion sort

Heap sort

Quick sort

Selection sort

Insertion sort

Insertion sort

Selection sort

Heap sort

Quick sort

15

8

1

4

## 12. A sorting algorithm is stable if

Its time complexity is constant irrespective of the nature of input

Preserves the original order of records with equal keys

Its space complexity is constant irrespective of the nature of input

It sorts any volume of data in a constant time

Stable

Linear

External

Consistent

Binary Search

Linear Search

Tree Search

Hashing

## 15. After each iteration in bubble sort:

At least one element is at its sorted position

One less comparison is made in the next iteration

Both a & b are true

Neither a nor b is true

0Shares
Scroll to Top