Let P be an array containing $n$ integers. Let $t$ be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of $n$ elements. Which one of the following choices is correct?

Select an option to check

Key concept

Searching, Sorting and Hashing

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Searching, Sorting and Hashing

Across GATE CS exams, Searching, Sorting, and Hashing are tested with a strong emphasis on exact comparison/swap counts, worst/best-case edge cases (especially for Quicksort and simultaneous min-max finding), trace-based simulation (such as step-by-step hashing probes and merge passes), and asymptotic tradeoffs for specialized or composite data inputs. Questions range from conceptual 1-mark classification to rigorous 2-mark NATs requiring precise manual execution of collision resolution or optimal merge trees.

Full Searching, Sorting and Hashing guide →

More on Searching, Sorting and Hashing

All 27 questions on Searching, Sorting and Hashing →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

Algorithms · Searching, Sorting and Hashing

Official IIT answer key · IIT Bombay · Audited Aug 2026

Take topic test

GATE CSE 2021 Set 1 Q2 · MCQ · 1 mark

Let P be an array containing $n$ integers. Let $t$ be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of $n$ elements. Which one of the following choices is correct?

Select an option to check

Key concept

Searching, Sorting and Hashing

Step-by-step verified solution

Examiner trap & misconception

Topic notes

How GATE tests Searching, Sorting and Hashing

Full Searching, Sorting and Hashing guide →

More on Searching, Sorting and Hashing

All 27 questions on Searching, Sorting and Hashing →

Independent practice explanation verified by the GateAI team. GATE is conducted by the IITs; question text follows the official paper.

Let P be an array containing $n$ integers. Let $t$ be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of $n$ elements. Which one of the following choices is correct?

Step-by-step verified solution

Check you can still solve Searching, Sorting and Hashing under a clock

More from GATE CSE 2021 Set 1

More on Searching, Sorting and Hashing

Let P be an array containing $n$ integers. Let $t$ be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of $n$ elements. Which one of the following choices is correct?

Step-by-step verified solution

Check you can still solve Searching, Sorting and Hashing under a clock

More from GATE CSE 2021 Set 1

More on Searching, Sorting and Hashing

Let P be an array containing nnn integers. Let ttt be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of nnn elements. Which one of the following choices is correct?

Step-by-step verified solution

Check you can still solve Searching, Sorting and Hashing under a clock

More from GATE CSE 2021 Set 1

More on Searching, Sorting and Hashing

Share this solution

Let P be an array containing nnn integers. Let ttt be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of nnn elements. Which one of the following choices is correct?

Step-by-step verified solution

Check you can still solve Searching, Sorting and Hashing under a clock

More from GATE CSE 2021 Set 1

More on Searching, Sorting and Hashing

Share this solution

Let P be an array containing $n$ integers. Let $t$ be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of $n$ elements. Which one of the following choices is correct?

Let P be an array containing $n$ integers. Let $t$ be the lowest upper bound on the number of comparisons of the array elements, required to find the minimum and maximum values in an arbitrary array of $n$ elements. Which one of the following choices is correct?