Welcome to the Sorting and Searching MCQs Page

Dive deep into the fascinating world of Sorting and Searching with our comprehensive set of Multiple-Choice Questions (MCQs). This page is dedicated to exploring the fundamental concepts and intricacies of Sorting and Searching, a crucial aspect of Data Structures and Algorithms. In this section, you will encounter a diverse range of MCQs that cover various aspects of Sorting and Searching, from the basic principles to advanced topics. Each question is thoughtfully crafted to challenge your knowledge and deepen your understanding of this critical subcategory within Data Structures and Algorithms.

Check out the MCQs below to embark on an enriching journey through Sorting and Searching. Test your knowledge, expand your horizons, and solidify your grasp on this vital area of Data Structures and Algorithms.

Note: Each MCQ comes with multiple answer choices. Select the most appropriate option and test your understanding of Sorting and Searching. You can click on an option to test your knowledge before viewing the solution for a MCQ. Happy learning!

Sorting and Searching MCQs | Page 23 of 24

Explore more Topics under Data Structures and Algorithms

01

Data Structures Basics

02

Data Types and Abstraction

03

Algorithm Complexity

04

Arrays and Pointers

05

Linked Lists

06

Stacks and Queues

07

Recursion

08

Trees

09

Graphs

10

String Operations

11

Object Oriented Programming

12

Dynamic Programming

Q221.

Topological sort can be implemented by?

Using Depth First Search

Using Breadth First Search

Using Depth and Breadth First Search

None of the mentioned

Discuss

Answer: (c).Using Depth and Breadth First Search

Q222.

Topological sort is equivalent to which of the traversals in trees?

Pre-order traversal

Post-order traversal

In-order traversal

Level-order traversal

Discuss

Answer: (a).Pre-order traversal

Q223.

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

Breadth First Search

Topological Sorting

Dijkstra’s Shortest path algorithm

Discuss

Answer: (c).Topological Sorting

Q224.

When the topological sort of a graph is unique?

When there exists a hamiltonian path in the graph

In the presence of multiple nodes with indegree 0

In the presence of single node with indegree 0

None of the mentioned

Discuss

Answer: (a).When there exists a hamiltonian path in the graph

Q225.

What is recurrence for worst case of QuickSort and what is the time complexity in Worst case?

Recurrence is T(n) = T(n-2) + O(n) and time complexity is O(n²)

Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n²)

Recurrence is T(n) = 2T(n/2) + O(n) and time complexity is O(nLogn)

Recurrence is T(n) = T(n/10) + T(9n/10) + O(n) and time complexity is O(nLogn)

Discuss

Answer: (b).Recurrence is T(n) = T(n-1) + O(n) and time complexity is O(n²)

Q226.

Which of the following is not a stable sorting algorithm?

Insertion sort

Selection sort

Bubble sort

Merge sort

Discuss

Answer: (b).Selection sort

Q227.

If the number of records to be sorted is small, then sorting can be efficient.

Merge

Heap

Selection

Bubble

Discuss

Answer: (c).Selection

Q228.

Suppose we have a O(n) time algorithm that finds median of an unsorted array. Now consider a QuickSort implementation where we first find median using the above algorithm, then use median as pivot. What will be the worst case time complexity of this modified QuickSort.

O(n² Logn)

O(n²)

O(n Logn Logn)

O(nLogn)

Discuss

Answer: (d).O(nLogn)

Q229.

Which of the following is not an in-place sorting algorithm?

Selection sort

Heap sort

Quick sort

Merge sort

Discuss

Answer: (d).Merge sort

Q230.

The complexity of sorting algorithm measures the as a function of the number n of items to be sorter.

average time

running time

average-case complexity

case-complexity

Discuss

Answer: (b).running time

Page 23 of 24

Welcome to the Sorting and Searching MCQs Page

Sorting and Searching MCQs | Page 23 of 24

Explore more Topics under Data Structures and Algorithms

Data Structures Basics

Data Types and Abstraction

Algorithm Complexity

Arrays and Pointers

Linked Lists

Stacks and Queues

Recursion

Trees

Graphs

String Operations

Object Oriented Programming

Dynamic Programming

Suggested Topics

Discrete Mathematics

Java Programming

Software Architecture and Design

Object Oriented Programming

Microprocessor

Operating System

Systems Analysis and Design Methods

Python

Cyber Security