The goal of this homework is to implement caches with various eviction policies.
The goal of this homework is to implement caches with various eviction policies.
For our purposes cache is a software component capable of storing data, with limited capacity, constant access time and defined behaviour when element is inserted on full capacity.
For our purposes cache is a software component capable of storing data, with limited capacity, fast access time and defined behaviour when element is inserted on full capacity.
In reality the accessing items in cache should have constant O(1) time complexity.
For the purpose of this assignment we encourage you to try your best. The purpose of this assignment is to understand things, not to optimize eviction algorithms.
### Eviction Policies
### Eviction Policies
Eviction policy defines which element is removed when new element is inserted and the cache is full.
Eviction policy defines which element is removed when new element is inserted and the cache is full.
