Recent questions tagged maximum-minimum / GATE Overflow for GATE CSE

0 votes

1 answer

1

Algorithms
Minimum no of comparisons required to find the minimum and maximum of n distinct elements

Minimum no of comparisons required to find the minimum and maximum of n distinct elements

Raghav Khajuria

339 views

Raghav Khajuria asked Oct 13, 2018

2 votes

2 answers

2

#Algorithms minimum number of comparisons required to find the minimum and the maximum of 101 numbers?

The minimum number of comparisons required to find the minimum and the maximum of 101 numbers is ________.When n is even then it's relatively easy, but how to deal with n...

iarnav

1.1k views

iarnav asked Mar 30, 2018

1 votes

1 answer

3

Number of comparisons (previous gate question)
Atmost how many comparisons are required to find out min and max in an array of n elements where n is even ? Answer is atmost 1.5n - 2 comparisons. For n=6, I tried manually and the number of comparisons comes out to be 8 but according to the formula it's 1.5(6) - 2 =7 which is lesser than 8 ! Where am I going wrong ?

Atmost how many comparisons are required to find out min and max in an array of n elements where n is even ?Answer is atmost 1.5n - 2 comparisons.For n=6, I tried manuall...

Rajesh R

640 views

Rajesh R asked Nov 9, 2017

2 votes

1 answer

4

doubt
what should be the minimum number of comparisons required to find the minimum and maximum of 100 numbers ?

what should be the minimum number of comparisons required to find the minimum and maximum of 100 numbers ?

Diksha Aswal

399 views

Diksha Aswal asked Sep 18, 2017

1 votes

1 answer

5

The minimum number of comparisons required
The minimum number of comparisons required to find the minimum and maximum of 60 numbers is..............

The minimum number of comparisons required to find the minimum and maximum of 60 numbers is..............

mystylecse

3.5k views

mystylecse asked Aug 15, 2017

4 votes

2 answers

6

max min in an array
Consider the problem of computing min-max in an unsorted array where min and max are minimum and maximum elements of array. Algorithm A1 can compute min-max in a1 comparisons without divide and conquer. Algorithm A2 can compute min-max in a2 comparisons by scanning the array linearly. What could be the relation between a1 and a2 considering the worst case scenarios?

Consider the problem of computing min-max in an unsorted array where min and max are minimum and maximum elements of array. Algorithm A1 can compute min-max in a1 compari...

deep05

3.0k views

deep05 asked Feb 27, 2017

2 votes

1 answer

7

Test Series
Assume that A be an array of 16 elements. What is the difference between maximum number of inversion and minimum number of inversion for the array with 16 elements?

Assume that A be an array of 16 elements. What is the difference between maximum number of inversion and minimum number of inversion for the array with 16 elements?

srestha

850 views

srestha asked Dec 22, 2016

0 votes

1 answer

8

what is "DAC Max-Min algorithm" | ME Basic test algorithms
Consider a set of 20 elements. To find maximum and minimum element in the given set, the minimum number of comparisons required is _________? (using DAC Max-Min algorithm)

Consider a set of 20 elements.To find maximum and minimum element in the given set, the minimum number of comparisons required is _________? (using DAC Max-Min algorithm)...

Aspi R Osa

1.5k views

Aspi R Osa asked Dec 14, 2015

23 votes

2 answers

9

TIFR CSE 2014 | Part B | Question: 10
Given a set of $n$ distinct numbers, we would like to determine both the smallest and the largest number. Which of the following statements is TRUE? These two elements can be determined using $O\left(\log^{100}n\right)$ ... comparisons do not suffice, however these two elements can be determined using $2(n - 1)$ comparisons. None of the above.

Given a set of $n$ distinct numbers, we would like to determine both the smallest and the largest number. Which of the following statements is TRUE?These two elements can...

makhdoom ghaya

5.4k views

makhdoom ghaya asked Nov 19, 2015

49 votes

7 answers

10

TIFR CSE 2014 | Part B | Question: 9
Given a set of $n$ distinct numbers, we would like to determine the smallest three numbers in this set using comparisons. Which of the following statements is TRUE? These three elements can be determined using $O\left(\log^{2}n\right)$ ... $O(n)$ comparisons. None of the above.

Given a set of $n$ distinct numbers, we would like to determine the smallest three numbers in this set using comparisons. Which of the following statements is TRUE?These ...

makhdoom ghaya

9.9k views

makhdoom ghaya asked Nov 19, 2015

31 votes

3 answers

11

TIFR CSE 2014 | Part B | Question: 6
Consider the problem of computing the minimum of a set of $n$ distinct numbers. We choose a permutation uniformly at random (i.e., each of the n! permutations of $\left \langle 1,....,n \right \rangle$ is chosen with probability $(1/n!)$ and we inspect the numbers in the order ... of times MIN is updated? $O (1)$ $H_{n}=\sum ^{n}_{i=1} 1/i$ $\sqrt{n}$ $n/2$ $n$

Consider the problem of computing the minimum of a set of $n$ distinct numbers. We choose a permutation uniformly at random (i.e., each of the n! permutations of $\left \...

makhdoom ghaya

2.6k views

makhdoom ghaya asked Nov 19, 2015

2 votes

1 answer

12

The Number of Comparisons is :

Payal Rastogi

1.4k views

Payal Rastogi asked Nov 15, 2015

89 votes

16 answers

13

GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________

The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________

go_editor

54.0k views

go_editor asked Sep 28, 2014

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