+1 vote
in Data Structures & Algorithms I by (110k points)
Which of the following is not the rearranging method used to implement self-organizing lists?

(a) count method

(b) move to front method

(c) ordering method

(d) least frequently used

Enquiry is from Types of Lists topic in chapter Types of Lists of Data Structures & Algorithms I

I had been asked this question during an internship interview.

1 Answer

+1 vote
by (737k points)
selected by
Best answer
Correct answer is (d) least frequently used

The explanation is: Least frequently used is a buffer replacement policy, while other three are methods to reorder the nodes in the self-organizing lists based on their access probability.

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.