# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## Self Organizing List Multiple choice Questions and Answers (MCQs)

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

The self organizing list improves the efficiency of .....

binary search | |

jump search | |

sublist search | |

linear search |

Question 1 Explanation:

Linear search in a linked list has time complexity O(n). To improve the efficiency of the linear search the self organizing list is used. A self-organizing list improves the efficiency of linear search by moving more frequently accessed elements towards the head of the list.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

Which of the following is true about the Move-To-Front Method for rearranging nodes?

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

requires extra storage | |

may over-reward infrequently accessed nodes | |

requires a counter for each node |

Question 2 Explanation:

In Move-To-front Method the element which is searched is moved to the head of the list. And if a node is searched even once, it is moved to the head of the list and given maximum priority even if it is not going to be accessed frequently in the future. Such a situation is referred to as over-rewarding.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What technique is used in Transpose method?

searched node is swapped with its predecessor | |

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

searched node is swapped with the head of list | |

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

Question 3 Explanation:

In Transpose method, if any node is searched, it is swapped with the node in front unless it is the head of the list. So, in Transpose method searched node is swapped with its predecessor.

Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

The worst case running time of a linear search on the self organizing list is .....

O(1) | |

O(logn) | |

O(n) | |

O(n ^{2}) |

Question 4 Explanation:

Worst case occurs when the element is located at the very end of list. So n comparisons must be made to the locate element. So the worst case running time of linear search on self organizing list is O(n).

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

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

search tree | |

sorted list | |

self organizing list | |

linked list |

Question 5 Explanation:

Self-organizing list is easy and simple to implement than search tree and it requires no additional space. So using self organizing list is preferred when list size is small.

There are 5 questions to complete.