Loading previous year questions
1 Qs · 2025 · 1 marks · 0 marks/paperStandard yield
In this topic, GATE evaluates the fundamental understanding of comparison-based bounds and logical deduction on unordered lists. Rather than standard search algorithms (linear/bina… Guide
Topic guide
In this topic, GATE evaluates the fundamental understanding of comparison-based bounds and logical deduction on unordered lists. Rather than standard search algorithms (linear/binary search), questions test the exact minimum number of comparisons needed to satisfy non-standard or relaxed selection conditions.
Minimum comparisons for relaxed selection criteria
rare · MCQ · 1 marks · 2025
Determining the minimum number of element-to-element comparisons required to identify an element satisfying a relaxed property (e.g., finding an element that is strictly not the maximum or not the minimum).
Non-extremal Identification Bound
Used when identifying any element guaranteed not to be the maximum (or minimum) from an unordered set of distinct elements by comparing any two arbitrary elements.
Introduction of conceptual 1-mark questions probing trivial lower bounds and careful reading of problem constraints rather than mechanical formula application.
2025
Easy items test simple deduction (e.g., comparing any two distinct elements immediately proves the smaller is not the maximum in 1 comparison). Medium/Hard variants extend to finding elements not in the top- or median boundaries with adversarial bounds.