41. What happens if you forget to update the next pointer of a node when deleting it in a singly linked list?
42. Which of the following correctly describes a skip list?
43. How do you efficiently find the kth to last element in a singly linked list?
44. Which of the following operations is most efficient in a singly linked list?
45. In a linked list, what is a dummy node typically used for?
46. In the above question would using arrays and swaping of elements in place of xor linked list would have been more efficient?
47. What are the disadvantages in implementing buddy system algorithm for free lists?
48. The self organizing list improves . . . . . . . .
49. Which of the following is true about a triply linked list?
50. Consider the following pseudocode of insertion in XOR list and write the approximate code snippet of it.
void xor-linked-list insert(struct node **head_ref, int value)
{
node *new_node = new (struct node);
new_node->value = value;
new_node->nodepointerxored = xor (*head_ref, NULL);
if (*head_pointer == NULL)
{
printf("invalid");
}
else
{
let b,c,d are nodes and a is to be inserted at beginning,
a address field must contain NULL xor b and b
address filed must be a xor c.
}
*head_pointer = new_node;
}
void xor-linked-list insert(struct node **head_ref, int value)
{
node *new_node = new (struct node);
new_node->value = value;
new_node->nodepointerxored = xor (*head_ref, NULL);
if (*head_pointer == NULL)
{
printf("invalid");
}
else
{
let b,c,d are nodes and a is to be inserted at beginning,
a address field must contain NULL xor b and b
address filed must be a xor c.
}
*head_pointer = new_node;
}Read More Section(Linked Lists in Data Structures)
Each Section contains maximum 100 MCQs question on Linked Lists in Data Structures. To get more questions visit other sections.