GATE 2025 · session-5
Suppose that insertion sort is applied to the array \( [1, 3, 5, 7, 9, 11, x, 15, 13] \) and it takes exactly two swaps to sort the array. Select all possible values of \( x \).
Related Programming, Data Structures and Algorithms PYQs
Consider a hash table of size 10 with indices \( \{0, 1, \dots, 9\} \), with the hash function \[ h(x) = 3x \, (mod \, 10), \] whe…
Consider the following Python declarations of two lists. \[ A = [1, 2, 3] \quad and \quad B = [4, 5, 6]. \] Which one of the follo…
For which of the following inputs does binary search take time \( O(\log n) \) in the worst case?
Consider the following Python code snippet. \[ A = \{"this", "that"\}, \quad B = \{"that", "other"\}, \quad C = \{"other", "this"\…
Let \( G \) be a simple, unweighted, and undirected graph. A subset of the vertices and edges of \( G \) are shown below. It is gi…
Consider the following Python code snippet. The value printed by the code snippet is 160 (answer in integer).
Free account benefits
Turn practice into measurable progress
Public PYQs and reference pages stay free. Sign in when you want GATEverse to remember what you studied and guide what to practise next.
Saved progressKeep answers, mock results and completion history across devices.
Adaptive practiceGet questions matched to your recent accuracy and difficulty level.
Bookmarks and notesBuild a personal revision list and record why a question was difficult.
Performance insightsSee weak subjects, accuracy trends, streaks and exam readiness.