+1 vote
in Data Structures & Algorithms I by (110k points)
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.

1 Answer

+1 vote
by (672k points)
selected by
 
Best answer
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.

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.

Categories

...