Answer:
Finding kth element is more efficient in a doubly-linked list when compared to a singly-linked list
Explanation:
Assuming that both lists have firs_t and last_ pointers.
For a singly-linked list ; when locating a kth element, you have iterate through a number of k-1 elements which means that locating an element will be done only in one ( 1 ) direction
For a Doubly-linked list : To locate the Kth element can be done from two ( directions ) i.e. if the Kth element can found either by traversing the number of elements before it or after it . This makes finding the Kth element faster because the shortest route can be taken.
<em>Finding kth element is more efficient in a doubly-linked list when compared to a singly-linked list </em>
You should know the units :))))))))))))
Answer:
The answer is "Least recently used policy".
Explanation:
It is the page replacement policy, which uses a less frequent substitute. It adds a registry from each frame that includes the last time the program, that views within the frame, and use a "logical clock" for each of the data references, that made to change by a tick.
This replacement strategy is often used to substitute its least currently utilized cache line or page, and it is realistic and best implemented among the substitution policies.
