Linked Lists in Data Structures MCQ question and answer with solution Page-6 section-1

51.
Which among the following is a typical declaration of an unrolled linked list in C?

A.

#define SIZE N                                                             
struct node 
{                                                                           
    int node_count;                                                     
    int arr[SIZE];                                              
    struct node *next;                              
};

B.

#define SIZE N                                                            
struct node 
{                                                                                                                              
    int arr[SIZE];                                              
    struct node *prev;      
    struct node *top;                        
};

C.

#define SIZE N                                                          
struct node 
{                                                                           
    int node_count;                                                                                           
    struct node *next;                              
};

D.

#define SIZE N                                                         
struct node 
{                                                                           
    int node_count;                                                     
    int arr[SIZE];                                                                           
};

Answer & Solution Discuss in Board Save for Later

52.

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?

A. code for first fit

B. code for best fit

C. code for worst fit

D. none of the mentioned

Answer & Solution Discuss in Board Save for Later

53.
What does first and last nodes of a xor linked lists contain ? (let address of first and last be A and B)

A. NULL xor A and B xor NULL

B. NULL and NULL

C. A and B

D. NULL xor A and B

Answer & Solution Discuss in Board Save for Later

54.
Which of the following data structure is preferred to have lesser search time when the list size is small?

A. search tree

B. sorted list

C. self organizing list

D. linked list

Answer & Solution Discuss in Board Save for Later

55.
What is xor linked list?

A. uses of bitwise XOR operation to decrease storage requirements for doubly linked lists

B. uses of bitwise XOR operation to decrease storage requirements for linked lists

C. uses of bitwise operations to decrease storage requirements for doubly linked lists

D. just another form of linked list

Answer & Solution Discuss in Board Save for Later

56.
What are implicit and explicit implementations of freelists?

A. garbage collection and new or malloc operators respectively

B. new or malloc and garbage collection respectively

C. implicit implementation is not favored

D. explicit implementation is not favored

Answer & Solution Discuss in Board Save for Later

57.
Which among the following is the time complexity for inserting an element in an unrolled linked list?

A. O(1)

B. O(n)

C. O(log n)

D. O(n²)

Answer & Solution Discuss in Board Save for Later

58.
Which of the following method performs poorly when elements are accessed in sequential order?

A. count method

B. move to front method

C. transpose meth

D. ordering method

Answer & Solution Discuss in Board Save for Later

59.
Skip lists are similar to which of the following datastructure?

A. stack

B. heap

C. binary search tree

D. balanced binary search tree

Answer & Solution Discuss in Board Save for Later

60.
What technique is used in Transpose method?

A. searched node is swapped with its predecessor

B. node with highest access count is moved to head of the list

C. searched node is swapped with the head of list

D. searched nodes are rearranged based on their proximity to the head node

Answer & Solution Discuss in Board Save for Later

Linked Lists in Data Structures MCQ question and answer with solution

51. Which among the following is a typical declaration of an unrolled linked list in C?

Answer & Solution

Answer & Solution

53. What does first and last nodes of a xor linked lists contain ? (let address of first and last be A and B)

Answer & Solution

54. Which of the following data structure is preferred to have lesser search time when the list size is small?

Answer & Solution

55. What is xor linked list?

Answer & Solution

56. What are implicit and explicit implementations of freelists?

Answer & Solution

57. Which among the following is the time complexity for inserting an element in an unrolled linked list?

Answer & Solution

58. Which of the following method performs poorly when elements are accessed in sequential order?

Answer & Solution

59. Skip lists are similar to which of the following datastructure?

Answer & Solution

60. What technique is used in Transpose method?

Answer & Solution

Read More Section(Linked Lists in Data Structures)

51.
Which among the following is a typical declaration of an unrolled linked list in C?

53.
What does first and last nodes of a xor linked lists contain ? (let address of first and last be A and B)

54.
Which of the following data structure is preferred to have lesser search time when the list size is small?

55.
What is xor linked list?

56.
What are implicit and explicit implementations of freelists?

57.
Which among the following is the time complexity for inserting an element in an unrolled linked list?

58.
Which of the following method performs poorly when elements are accessed in sequential order?

59.
Skip lists are similar to which of the following datastructure?

60.
What technique is used in Transpose method?