GATE CS 2025 Set 1 — Question 62
Go beyond PYQs with Success TrackerAI-powered personalised practice and doubt support. Unlimited practice on eligible plans; AI usage limits apply.NAT+2 / -0MediumSingly Linked ListsLinked ListsProgramming & Data StructuresPointers & Pointer ArithmeticC ProgrammingStructures & Unions
Programming & Data Structures → C Programming → Pointers & Pointer Arithmetic
Last updated
Question
Let LIST be a datatype for an implementation of linked list defined as follows:Suppose a program has created two linked lists, L1 and L2, whose contents are given in the figure below (code for creating L1 and L2 is not provided here). L1 contains 9 nodes, and L2 contains 7 nodes.
Consider the following C program segment that modifies the list L1. The number of nodes that will be there in L1 after the execution of the code segment is ________ . (Answer in integer)
typedef struct list {
int data;
struct list *next;
} LIST;
int find (int query, LIST *list) {
while (list != NULL) {
if(list->data == query) return 1;
list = list->next;
}
return 0;
}
int main () {
... ... ...
ptr1=L1; ptr2=L2;
while (ptr1->next != NULL) {
query = ptr1->next->data;
if (find (query, L2))
ptr1->next = ptr1->next->next;
else ptr1 = ptr1->next;
}
... ... ...
return 0;
}
Correct answer
5 to 5
Solution
The code iterates through the linked list starting from the second node. For each node, it checks if its data exists in using the
Values in : Nodes in (from second node onwards) that are present in are: .
Note that the first node of (value 1) is also in , but the loop
Total number of nodes = 5.
find function. If it exists, the node is removed from by updating the next pointer of the previous node.Initial : Values in : Nodes in (from second node onwards) that are present in are: .
Note that the first node of (value 1) is also in , but the loop
while (ptr1->next != NULL) with query = ptr1->next->data only checks nodes from the second one onwards. After removing , the remaining nodes in are: . Total number of nodes = 5.
Continue learning with Success Tracker
A step still unclear? Work through it with support
Use Success Tracker to ask about the reasoning, then try another GATE CS question to check your understanding.
AI-powered practice· Unlimited practice on eligible plans
- PYQs with solutions
- Attempt available previous-year questions, then compare your reasoning with the worked solution. Coverage varies by stream.
- Practice that adapts
- Choose a topic, work on weaker areas and bookmark questions to revisit. Your attempts feed your progress tracking.
- AI doubt support
- Ask follow-up questions about a step or concept while practising, instead of stopping at the final answer.
Unlimited practice is available on eligible plans. Free practice and AI usage have limits; check the current plan allowances before choosing.
This page stays readable without an account. AI responses can be wrong; check them against the solution and source material.
More questions on C Programming
2026 Set 2 Q12The set T represents various traversals over binary tree. The set S represents the order of…2026 Set 2 Q19Consider the following three ANSI-C programs, P1, P2, and P3. P1 [code] P2 [code] **P3**…2026 Set 1 Q23Let be an odd number greater than 100. Consider a binary minheap with elements stored in an…2026 Set 1 Q24Consider a hash table that is initially empty. The hash table is maintained…2026 Set 1 Q27Consider the following C statements: Which of the following options is/are correct? [figure]