GATE 2013 · session-1
Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers using selection sort?
Related Algorithms PYQs
Two alternative packages A and B are available for processing a database having 10k records. Package A requires 0.0001n² time unit…
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices?
The number of elements that can be sorted in Θ(log n) time using heap sort is
Consider the following function: ```c int unknown(int n){ int i, j, k=0; for (i=n/2; i<=n; i++) for (j=2; j<=n; j…
Consider the following operation along with Enqueue and Dequeue operations on queues, where k is a global parameter. MultiDequeue(…
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.