recategorized by
187 views

1 Answer

1 votes
1 votes

the answer is Self-Organizing List (option D)).

Self-Organizing List uses the property of locality of reference that brings the most frequently used items at the head of the list.

edited by
Answer:

Related questions

1 votes
1 votes
2 answers
1
gatecse asked Mar 2, 2018
2,291 views
Which of the following problem cannot be solved without recursion?Tower of HanoiFibonacci seriesTree TraversalNone of the above
0 votes
0 votes
1 answer
2
gatecse asked Mar 2, 2018
325 views
If there is a graph such that there is a unique path between any pair of vertices. The graph is a ________MeshGridTreeBipartite graph
0 votes
0 votes
1 answer
3
gatecse asked Mar 2, 2018
5,952 views
Which of the following is not used for hash function?Mid-square methodDivision methodFolding methodProbe method
0 votes
0 votes
2 answers
4
gatecse asked Mar 2, 2018
434 views
If the post order traversal of treegives $ab - cd * +$, then the label of the nodes A, B, C, ......, G will bea, -, b, +, c, *, d+, -, *, a, b, c, d-, a, +, b, c, d, *a, ...