Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
mkg243001
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by mkg243001
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
Feb 15, 2017
DS
gatecse-2017-set1
data-structures
linked-list
normal
+
–
1
answer
2
Two languages reducible to each other in polynomial time. Which is false option for them?
If Language L1 is reducible to L2 and L2 reducible to L1, then shouldn't they both be Recursively Enumerable Languages? I am really confused with the option given. Source : testbook.com live test on 3rd January, 2016
If Language L1 is reducible to L2 and L2 reducible to L1, then shouldn't they both be Recursively Enumerable Languages? I am really confused with the option given.Source ...
675
views
commented
Jun 18, 2016
Theory of Computation
recursive-and-recursively-enumerable-languages
normal
compound-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register