Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
ZackKnight
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by ZackKnight
11
answers
1
GATE CSE 2017 Set 1 | Question: 08
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->next; } p->next = m; } Assuming that m and n ... append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.
Consider the C code fragment given below.typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->ne...
25.4k
views
commented
May 1, 2017
DS
gatecse-2017-set1
data-structures
linked-list
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register