+1 vote
in Data Structures & Algorithms I by (110k points)
The self organizing list improves _____

(a) average access time

(b) insertion

(c) deletion

(d) binary search

This question is from Types of Lists topic in division Types of Lists of Data Structures & Algorithms I

This question was posed to me during an online exam.

1 Answer

+1 vote
by (672k points)
selected by
Best answer
Right option is (a) average access time

Easy explanation - The self-organizing list rearranges the nodes based on the access probabilities of the nodes. So the required elements can be located efficiently. Therefore, self-organizing list is mainly used to improve the average access time.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.