What happens if you forget to update the next pointer of a node when deleting it in a singly linked list?
Select an option to see the answer and solution.
Data Structure · all questionsLinked Lists in Data Structures
Linked Lists in Data Structures
practice.
Practice every MCQ with options. Use Show answers when you want the correct option and solution.
103
Questions
3/6
Page
Pick an option on a question to see the right answer and solution.
Which of the following correctly describes a skip list?
Select an option to see the answer and solution.
How do you efficiently find the kth to last element in a singly linked list?
Select an option to see the answer and solution.
Which of the following operations is most efficient in a singly linked list?
Select an option to see the answer and solution.
In a linked list, what is a dummy node typically used for?
Select an option to see the answer and solution.
In the above question would using arrays and swaping of elements in place of xor linked list would have been more efficient?
Select an option to see the answer and solution.
What are the disadvantages in implementing buddy system algorithm for free lists?
Select an option to see the answer and solution.
The self organizing list improves . . . . . . . .
Select an option to see the answer and solution.
Which of the following is true about a triply linked list?
Select an option to see the answer and solution.
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;
}Options are not available for this question.
Select an option to see the answer and solution.
Which among the following is a typical declaration of an unrolled linked list in C?
Options are not available for this question.
Select an option to see the answer and solution.
Assume there is a free list which contains nodes and is filled with a value if it is already assigned and the value will be the size of requested block else will be 0.
z = startpoint;
while ((z < end) && \\ didn't reach end
(*z <= len)) \\ too small to satisfy request
{
assign this block
}Select an option to see the answer and solution.
What does first and last nodes of a xor linked lists contain ? (let address of first and last be A and B)
Select an option to see the answer and solution.
Which of the following data structure is preferred to have lesser search time when the list size is small?
Select an option to see the answer and solution.
What is xor linked list?
Select an option to see the answer and solution.
What are implicit and explicit implementations of freelists?
Select an option to see the answer and solution.
Which among the following is the time complexity for inserting an element in an unrolled linked list?
Select an option to see the answer and solution.
Which of the following method performs poorly when elements are accessed in sequential order?
Select an option to see the answer and solution.
Skip lists are similar to which of the following datastructure?
Select an option to see the answer and solution.
What technique is used in Transpose method?
Select an option to see the answer and solution.