Search results for sorting+made-easy-test-series / GATE Overflow for GATE CSE

3 votes

3 answers

1

Made Easy Test Series: Algorithm-Sorting
An array $A$ of size n is known to be sorted except for the first $k$ elements and the last $k$ elements, where $k$ is a constant. Which of the following algorithms will be the best choice for sorting the array $A?$ $a)$ ... sorts part by part using pivot. So, why not will it be answer?? How do we know it is asking for almost sorted array??

An array $A$ of size n is known to be sorted except for the first $k$ elements and the last $k$ elements, where $k$ is a constant. Which of the following algorithms will ...

srestha

1.9k views

srestha asked May 12, 2019

1 votes

5 answers

2

made easy test series:algorithms,sorting
why not merge sort?we don’t swap in merge sort,we just create auxillary arrays and merge them by changing elements in the original array.should we consider that as a swap?

why not merge sort?we don’t swap in merge sort,we just create auxillary arrays and merge them by changing elements in the original array.should we consider that as a sw...

hitesh159

2.1k views

hitesh159 asked Apr 16, 2019

0 votes

2 answers

3

MadeEasy Test Series: Algorithms - Sorting
Consider the following scenario during insertion sort when the array looks like the following: {25,75,95,125,80,5,10} The number of comparisons that it will further take for the array to be completely sorted are______?

Consider the following scenario during insertion sort when the array looks like the following:{25,75,95,125,80,5,10}The number of comparisons that it will further take fo...

Somoshree Datta 5

1.6k views

Somoshree Datta 5 asked Oct 20, 2018

0 votes

1 answer

4

MadeEasy Subject Test 2019: Algorithms - Sorting
Which of the following input will give best case time for selection sort? (A) 1 2 3 4 5 6 7 8 9 10 (B) 2 3 1 5 9 7 8 6 10 (C) 10 9 8 7 6 5 4 3 2 1 (D) All of above take same amount of time

Which of the following input will give best case time for selection sort?(A) 1 2 3 4 5 6 7 8 9 10(B) 2 3 1 5 9 7 8 6 10(C) 10 9 8 7 6 5 4 3 2 1 (D) All of above take same...

Rajat Agrawal007

4.6k views

Rajat Agrawal007 asked Dec 17, 2018

3 votes

4 answers

5

MadeEasy Test Series: Algorithms - Sorting
Consider a scenario of modified quick sort, where we have given an input sorted array A[1 .. . n], all elements of array are distinct and n >=3. Pivot is the median of set of 3 elements [First element, middle element, and last element]. What will be worst case time complexity of modified quick sort? a.O($n^{2}$) b.O(nlogn) c.O($n^{2}$logn) d.O(nloglogn)

Consider a scenario of modified quick sort, where we have given an input sorted array A[1 .. . n], all elements of array are distinct and n >=3. Pivot is the median of se...

newdreamz a1-z0

1.6k views

newdreamz a1-z0 asked Jan 21, 2019

2 votes

1 answer

6

MadeEasy Test Series: Algorithms - Sorting
An array of size n is known to be sorted except for the 1st k elements and the last k elements, where k is a constant. which of the following algorithm is the best choice for sorting the array A? Quick Sort or Insertion Sort? given answer is the insertion ... k), and it will take O(klogk) in average case and O(k^2) in the worst case. what's wrong in that?

An array of size n is known to be sorted except for the 1st k elements and the last k elements, where k is a constant. which of the following algorithm is the best choice...

aambazinga

852 views

aambazinga asked Dec 15, 2018

3 votes

1 answer

7

MadeEasy Test Series 2017: Algorithms - Sorting
Given a set of n distinct integers, it is required to determine the three smallest integers of this array using comparisons, The no of comparison needed are (A) n + O( log n ) (B) n + O( 1 ) (C) O ( n ) (D) O ( log2n ) ANSWER GIVEN ::- A

Given a set of n distinct integers, it is required to determine the three smallest integers of this array using comparisons, The no of comparison needed are (A) n + O( ...

VIKRAM KASANA

1.1k views

VIKRAM KASANA asked Dec 30, 2017

1 votes

1 answer

8

Made Easy Test Series:Algorithm
Given a sorted array of distinct integer $A\left [ 1,2,....n \right ]$, the tightest upper bound to check the existence of any index $i$, for which $A[i]=i$ ... index and then checking if $A[i]=i$, but answer given as $O(log n).$Please help me out, which will be correct answer?

Given a sorted array of distinct integer $A\left [ 1,2,....n \right ]$, the tightest upper bound to check the existence of any index $i$, for which $A[i]=i$ is equal to _...

srestha

786 views

srestha asked Apr 28, 2019

0 votes

2 answers

9

MadeEasy Subject Test: Algorithms - Sorting
a. i>0,K>0, a[K]> a[max] b. i>0,K<0, a[K]< a[max] c. i<0,K>0, a[K]> a[max] d. i>0,K>0, a[K]< a[max]

a. i>0,K>0, a[K] a[max]b. i>0,K<0, a[K]< a[max]c. i<0,K>0, a[K] a[max]d. i>0,K>0, a[K]< a[max]

naveen81

729 views

naveen81 asked Jan 30, 2017

0 votes

1 answer

10

Made Easy Test Series: Algo- Mathematical Solution
Through an experiment, it is found that selection sort performs $5000$ comparisons when sorting an array of size $k.$ If the size of array is doubled, what will be the number of comparisons? will it be $\left ( 5000 \right )^{2}$ or $\left ( 5000 \right )\times 4$. Someone check plz

Through an experiment, it is found that selection sort performs $5000$ comparisons when sorting an array of size $k.$ If the size of array is doubled, what will be the nu...

srestha

452 views

srestha asked May 6, 2019

4 votes

1 answer

11

ME Mock 4
Consider a new sorting algorithm similar to the BubbleSort algorithm, called RumbleSort. Given an array as input, RumbleSort attempts to sort the array and produces a sorted array as output. Here's the pseudo-code for RumbleSort. With regards to the above RumbleSort ... algorithm will work correctly for a given input is $\mathcal Ο(n^2)$ Which of the above statements is/are true?

Consider a new sorting algorithm similar to the BubbleSort algorithm, called RumbleSort. Given an array as input, RumbleSort attempts to sort the array and produces a sor...

balchandar reddy san

1.3k views

balchandar reddy san asked Jan 30, 2019

2 votes

4 answers

12

MadeEasy Subject Test 2019: Algorithms - Sorting
Suppose there are 4 sorted list of 16 elements each. If we merge these lists into a single sorted list of 64 elements. The key comparisons that are needed in the worst case using an efficient algorithm are

Suppose there are 4 sorted list of 16 elements each. If we merge these lists into a single sorted list of 64 elements. The key comparisons that are needed in the worst ca...

Ramij

2.3k views

Ramij asked Dec 20, 2018

0 votes

2 answers

13

MadeEasy Test Series: Algorithms - Sorting
Which of the following sorting techniques have best time complexity, if complexity is measured in terms of number of comparison? A Insertion sort B Selection sort C Merge sort D QuickSort

Which of the following sorting techniques have best time complexity, if complexity is measured in terms of number of comparison? A Insertion sortB Selection sortC Merge s...

rahul sharma 5

1.0k views

rahul sharma 5 asked Dec 8, 2017

0 votes

0 answers

14

MadeEasy Test Series: Programming & DS - Sorting
An array A of size n is known to be sorted except for the first k elements and the last k elements, where k is a constant. Which of the following algorithms will be the best choice for sorting the array A? a-Insertion Sort b-Bubble sort c-Quicksort d-Selection sort

An array A of size n is known to be sorted except for the first k elements and the last k elements, where k is a constant. Which of the following algorithms will be the b...

Shamim Ahmed

649 views

Shamim Ahmed asked Jan 1, 2019

0 votes

0 answers

15

MadeEasy Test Series: Algorithms - Sorting
Which of the following sorting algorithm represented by above code?

Which of the following sorting algorithm represented by above code?

Abhishek Kumar 38

628 views

Abhishek Kumar 38 asked Dec 19, 2018

0 votes

2 answers

16

ME TEST SERIES

Shankar Kakde

250 views

Shankar Kakde asked Jan 10, 2019

0 votes

0 answers

17

#Sorting
Consider the following statements: S1 : On any random input insertion sort is work more efficiently than bubble sort. S2 : Average number of comparison of insertion sort is better than bubble sort by constant factor. If efficiency, is considered as number of comparison to sort an array [input], then which of the following is correct?

Consider the following statements:S1 : On any random input insertion sort is work more efficiently than bubble sort.S2 : Average number of comparison of insertion sort ...

himgta

529 views

himgta asked Oct 29, 2018

1 votes

0 answers

18

MadeEasy Test Series: Algorithms - Sorting
Please Justify Statements which are true and which are false by an Example: Consider the following statements : S1 :While performing quick sort at any iteration only 1 element can be present at its correct position. S2 : The running time of ... ' passes in order to solve the single source shortest path problem on G'. Which of the following is correct ?

Please Justify Statements which are true and which are false by an Example:Consider the following statements :S1 :While performing quick sort at any iteration only 1 ele...

Na462

1.4k views

Na462 asked Apr 30, 2018

4 votes

1 answer

19

MadeEasy Subject Test: Algorithms - Sorting
Consider the following statements: S1 : On any random input insertion sort is work more efficiently than bubble sort. S2 : Average number of comparison of insertion sort is better than bubble sort by constant factor. If efficiency, is considered as number of comparison to sort an array [input], then which of the above statement is correct?

Consider the following statements:S1 : On any random input insertion sort is work more efficiently than bubble sort.S2 : Average number of comparison of insertion sort ...

charul

1.9k views

charul asked Nov 27, 2017

1 votes

1 answer

20

me test series
Given two unsorted singly-linked lists each with n distinct elements. There exists an efficient intersection algorithm, that computes and returns a new list with common elements between the input lists. How much time does the intersection algorithm requires in worst case, if it is allowed to ... only? answer is qiven as O(nlogn)...........i think it should be O(n^2)...please verify

Given two unsorted singly-linked lists each with n distinct elements. There exists an efficient intersection algorithm, that computes and returns a new list with common e...

eyeamgj

957 views

eyeamgj asked Jan 29, 2018

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true