Linked Lists In Data Structures — Part 2 MCQs with Explanations

Using two pointers (k steps apart) is the correct answer to “How do you efficiently find the kth to last element in a singly linked list”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

Insertion at the beginning is the correct answer to “Which of the following operations is most efficient in a singly linked list”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

To simplify insertion and deletion is the correct answer to “In a linked list, what is a dummy node typically used for”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

yes arrays would have been better than xor lists is the correct answer to “In the above question would using arrays and swaping of elements in place of xor linked list would have been more efficient”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

both a and c are correct is the correct answer to “What are the disadvantages in implementing buddy system algorithm for free lists”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

average access time is the correct answer to “The self organizing list improves . . . . . . . .”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

Dynamic in nature is the correct answer to “Which of the following is true about a triply linked list”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

node* next = XOR ((*head_ref)->npx, NULL); (*head_ref)->npx = XOR (new_node, next) is the correct answer to “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; }”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

#define SIZE N struct node { int node_count; int arr[SIZE]; struct node *next; } is the correct answer to “Which among the following is a typical declaration of an unrolled linked list in C”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

code for first fit is the correct answer to “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 } The above code represents what”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

NULL xor A and B xor NULL is the correct answer to “What does first and last nodes of a xor linked lists contain ? (let address of first and last be A and B)”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

self organizing list is the correct answer to “Which of the following data structure is preferred to have lesser search time when the list size is small”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

uses of bitwise XOR operation to decrease storage requirements for doubly linked lists is the correct answer to “What is xor linked list”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

garbage collection and new or malloc operators respectively is the correct answer to “What are implicit and explicit implementations of freelists”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

O(n) is the correct answer to “Which among the following is the time complexity for inserting an element in an unrolled linked list”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

move to front method is the correct answer to “Which of the following method performs poorly when elements are accessed in sequential order”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

balanced binary search tree is the correct answer to “Skip lists are similar to which of the following datastructure”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

searched node is swapped with its predecessor is the correct answer to “What technique is used in Transpose method”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

The elements are moved to the next node is the correct answer to “What happens if a node cannot fit an element in an unrolled linked list”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

False is the correct answer to “Unrolled linked-list requires more storage space for pointers compared to a singly linked list.”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

linked list or sort trees is the correct answer to “What datastructures can be used in implementing a free list”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

travel 20-30-35-38 is the correct answer to “Consider the 2-level skip list How to access 38”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

balanced binary search trees is the correct answer to “To which datastructure are skip lists similar to in terms of time complexities in worst and best cases”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

O(n) is the correct answer to “The worst case running time of a linear search on the self organizing list is . . . . . . . .”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

true is the correct answer to “Is a skip list like balanced tree”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

Storing equal values on the same level is the correct answer to “For which of the following purpose a top pointer can be used”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

type casting at return is missing is the correct answer to “What's wrong with this code which returns xor of two nodes address? //struct is common userdefined datatype in c/c++ and class is it's alternative struct node* XOR (struct node *a, struct node *b) { //this logic is used to fill the nodes with address of a xor linked list return ((int) (a) ^ (int) (b)); }”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

2 3 top → 3 5 top → 5 top → 5 6 is the correct answer to “Suppose, in a triply linked list, the elements 2, 3, 3, 5, 5, 5 and 6 are inserted in the given sequence. To which of the following elements will the top pointer point, if the linked list is traversed starting from the head”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

merge nodes a and a.next delete node a.next is the correct answer to “The algorithm given is for deleting an element in an unrolled linked list. What should be the correct statement for the blank given below? Find an element in node a a.data.delete(element) a.elementNum-- while a.elementNum < a.data.size / 2 put element from a.next.data in a.data a.next.elementNum-- a.elementNum++ if a.next.elementNum < a.next.data.size / 2 _______________________ _______________________”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

probabilistically is the correct answer to “The nodes in a skip list may have many forward references. their number is determined”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

a linkedlist that allows faster search within an ordered sequence is the correct answer to “What is a skip list”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

High overhead per node is the correct answer to “Which of the following is a drawback of an unrolled linked list”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

X⊕0 = 1 is the correct answer to “Which of the following is not the properties of XOR lists”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

may over-reward infrequently accessed nodes is the correct answer to “Which of the following is true about the Move-To-Front Method for rearranging nodes”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

true is the correct answer to “Are the below statements true about skiplists? In a sorted set of elements skip lists can implement the below operations i.given a element find closest element to the given value in the sorted set in O(logn) ii.find the number of elements in the set whose values fall a given range in O(logn)”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

Top of the node is the correct answer to “Where does a triply linked list contains an extra pointer in comparison to a doubly linked list”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

circular linked list and increasing addressing order is the correct answer to “How are free blocks linked together mostly and in what addressing order”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

a self organizing list is the correct answer to “Symbol tables during compilation of program is efficiently implemented using . . . . . . . .”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

i, ii, iii is the correct answer to “Which of the following statements are true? i) practical application of XOR linked lists are in environments with limited space requirements, such as embedded devices. ii)xor lists are not suitable because most garbage collectors will fail to work properly with classes or structures that don't contain literal pointers iii)in order to calculate the address of the next node you need to remember the address of the previous node iv)xor lists are much efficient than single, doubly linked lists and arrays”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.

struct node { int data; struct node *next; struct node *previous; struct node *top; } is the correct answer to “Which of the following is a typical declaration of a triply linked list in C”. This question is standard in competitive examination syllabi for Linked Lists In Data Structures.