khatrivarun / cache-cpu-algo-py Goto Github PK

Write Algorithms for:

1. When a hit is found, shift the node from current position to first position.
2. Dequeue the least recently used if a miss is found.

Write the following algorithms for:

1. Prediciting if the element exists in future in the given data.
2. Find page to be replaced.

Write up th ADT for doubly linked list.

Implementation of move any element in a linked list to front of the list.

Implement First Come First Serve CPU Scheduling Algorithm

Create a CPU Abstract class with 3 Data Fields:

1. Duration
2. Order
3. Arrival Time

Write algorithms for:

1. Page replacement if a miss.