What happens if a node cannot fit an element in an unrolled 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
4/6
Page
Pick an option on a question to see the right answer and solution.
Unrolled linked-list requires more storage space for pointers compared to a singly linked list.
Select an option to see the answer and solution.
What datastructures can be used in implementing a free list?
Select an option to see the answer and solution.
Consider the 2-level skip list
How to access 38?
How to access 38?
Select an option to see the answer and solution.
To which datastructure are skip lists similar to in terms of time complexities in worst and best cases?
Select an option to see the answer and solution.
The worst case running time of a linear search on the self organizing list is . . . . . . . .
Select an option to see the answer and solution.
Is a skip list like balanced tree?
Select an option to see the answer and solution.
For which of the following purpose a top pointer can be used?
Select an option to see the answer and solution.
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));
}Select an option to see the answer and solution.
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?
Select an option to see the answer and solution.
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
_______________________
_______________________Options are not available for this question.
Select an option to see the answer and solution.
The nodes in a skip list may have many forward references. their number is determined
Select an option to see the answer and solution.
What is a skip list?
Select an option to see the answer and solution.
Which of the following is a drawback of an unrolled linked list?
Select an option to see the answer and solution.
Which of the following is not the properties of XOR lists?
Select an option to see the answer and solution.
Which of the following is true about the Move-To-Front Method for rearranging nodes?
Select an option to see the answer and solution.
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)
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)
Select an option to see the answer and solution.
Where does a triply linked list contains an extra pointer in comparison to a doubly linked list?
Select an option to see the answer and solution.
How are free blocks linked together mostly and in what addressing order?
Select an option to see the answer and solution.
Symbol tables during compilation of program is efficiently implemented using . . . . . . . .
Select an option to see the answer and solution.