Vidyalelo
Data Structure · Q754

Miscellaneous on Data Structures

Programming · Data Structure · question 754

Q754

Which of the following best represents the time complexity to access an item in the least recently used cache?

A.
O(n)
B.
O(1)
Answer
C.
O(n2)
D.
O(log n)

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board