Test: Divide & Conquer- 1 - Computer Science Engineering (CSE) MCQ

# Test: Divide & Conquer- 1 - Computer Science Engineering (CSE) MCQ

Test Description

## 10 Questions MCQ Test GATE Computer Science Engineering(CSE) 2025 Mock Test Series - Test: Divide & Conquer- 1

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

### The way a card game player arranges his cards as he picks them up one by one, is an example of

Detailed Solution for Test: Divide & Conquer- 1 - Question 1

It is done only by insertion sort because in insertion sort we compare the one card to another all inserted card.

*Multiple options can be correct
Test: Divide & Conquer- 1 - Question 2

### You want to check whether a given set of items is sorted. Which of the following sorting methods will be the most efficient if it is already is sorted order?

Detailed Solution for Test: Divide & Conquer- 1 - Question 2

if we want to check if given input is sort or not then one pass of bubble sort and n pass of insertion sort with each has work of O(1) are best i.e.take O(n) time.

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

### Which of the following sorting methods will be the best if number of swappings done, is the only measure of efficiency?

Detailed Solution for Test: Divide & Conquer- 1 - Question 3

If number of swapping is the measure of efficiency of algorithm the selection sort is best since it cannot take swap more than O(n).

Test: Divide & Conquer- 1 - Question 4

You are asked to sort 15 randomly generated numbers. You should prefer

Detailed Solution for Test: Divide & Conquer- 1 - Question 4

In-order traversal of a Binary Search Tree lists the nodes in ascending order.

Test: Divide & Conquer- 1 - Question 5

As part of the maintenance work, you are entrusted with the work of rearranging the library books in a shelf in proper order, at the end of each day. The ideal choice will be

Detailed Solution for Test: Divide & Conquer- 1 - Question 5

Rearranging the library books in a shelf in proper order is same as arranging cards. So insertion sort should be preferred.

Test: Divide & Conquer- 1 - Question 6

Which of the following algorithms exhibits the unnatural behaviour that, minimum number of comparisons are needed if the list to be sorted is in the reverse order and maximum number of comparisons are needed if they are already in sorted order?

Detailed Solution for Test: Divide & Conquer- 1 - Question 6

Binary insertion sort take minimum comparison if the list to be sorted is in reverse order and maximum number of comparison if they already in sorted order.

Test: Divide & Conquer- 1 - Question 7

Which of the following sorting methods sorts a given set of items that is already in sorted order or in reverse sorted order with equal speed?

Detailed Solution for Test: Divide & Conquer- 1 - Question 7

Quick sort has two worst cases, when input is in either ascending or descending order, it takes same time O(n2).

Test: Divide & Conquer- 1 - Question 8

Which of the following algorithm design technique is used in the quick sort algorithm?

Detailed Solution for Test: Divide & Conquer- 1 - Question 8

Quick sort algorithm uses divide and conquer technique. It divides the data set every time on pivot element and keep on sorting each data set recursively.

Test: Divide & Conquer- 1 - Question 9

A binary search tree contains the values -1, 2, 3, 4, 5, 6, 7 and 8. The tree is traversed in preorder and the values are printed out. Which of the following sequences is a valid output?

Detailed Solution for Test: Divide & Conquer- 1 - Question 9

Preorder is root, left, right.

• So, option (b) can’t be a valid output. Since, 5 being the root and [312] a left sub-tree and [6487] being a right sub tree. But, 4 < 5, so not possible.
• In option (a), considering 5 as root, [786] becomes the right sub tree. Further, 7 being the root 6 can’t be apart of right sub-tree.
• Similarly, we can shown (c) can’t be a valid output.
• So, (d) can be the only possible valid output.
Test: Divide & Conquer- 1 - Question 10

Which of the following also called "diminishing interment sort"?

Detailed Solution for Test: Divide & Conquer- 1 - Question 10

The shell sort sometimes called the “diminishing increment sort" improves on the insertion sort by breaking the original list into a number of smaller sub list each of which is sorted using an insertion sort.

## GATE Computer Science Engineering(CSE) 2025 Mock Test Series

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

## GATE Computer Science Engineering(CSE) 2025 Mock Test Series

55 docs|215 tests