GATE 2022
Consider reversing a singly linked list. Which statement is true about the time complexity of algorithms that solve this problem using O(1) additional space?
Related Programming & Data Structures PYQs
Suppose we are given n keys, m hash table slots, and two simple uniform hash functions h1 and h2. Further suppose our hashing sche…
What is printed by the following ANSI C program? ```c #include<stdio.h> int main(int argc, char *argv[]) { int x = 1, z[2] = {10…
Suppose a binary search tree with 1000 distinct elements is also a complete binary tree. The tree is stored using the array repres…
What is printed by the following ANSI C program? ```c #include<stdio.h> int main(int argc, char *argv[]) { int a[3][3][3] = {{…
What is printed by the following ANSI C program? ```c #include<stdio.h> int main(int argc, char *argv[]){ char a = 'P'; char b…
Consider the queues Q1 containing four elements (head to tail: 1, 2, 3, 4) and Q2 containing none (Initial State). The only operat…
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.