GATE 2005
What is the worst-case time complexity of searching for an element in a singly linked list containing n elements?
Related Programming & Data Structures PYQs
Consider the following C-program: ```c double foo(double); /* Line 1 */ int main() { double da, db; // input da db = f…
Consider the following C-program: ```c void foo(int n, int sum) { int k = 0, j = 0; if (n == 0) return; k = n % 10; …
What does the following C-statement declare? int (*f)(int *);
Postorder traversal of a given binary search tree, T produces the following sequence of keys: 10, 9, 23, 22, 27, 25, 15, 50, 95, 6…
How many distinct binary search trees can be created out of 4 distinct keys?
In a complete k-ary tree, every internal node has exactly k children. The number of leaves in such a tree with n internal nodes is…
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.