Question

In _____________ method, whenever a node is accessed, it might move to the head of the list if its number of accesses becomes greater than the records preceding it.

(a) least recently used

(b) count

(c) traspose

(d) exchange

My doubt stems from Types of Lists topic in section Types of Lists of Data Structures & Algorithms I

The question was posed to me in examination.

Answer 1

The correct answer is (b) count

Easy explanation - In the count method, the number of times a node was accessed is counted and is stored in a counter variable associated with each node. Then the nodes are arranged in descending order based on their access counts. And the node with highest access count is head of the list.