n left LL D 1 2 3 1. Minimum Cache Capacity Given a list of n items accessed in sequence from a system, and a cache with Least Recently Used (LRU) replacement policy, the goal is to determine the minimum cache size required to ensure at least k requests hit the cache. If it is not possible to achieve k hits, return -1. Assume each item in the list has a size of 1 unit. Note: A cache following Least Recently Used (LRU) replacement policy is of fixed size and when it becomes full we will delete the value which is least recently used and insert a new value. Example Suppose n = 5, requests = ["item1", "item1", "item3", "item1", "item3"], and k = 1. 4 With size of cache as 1, we get:

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Please check the answer and add explanation properly
n left
LL
D
1
2
3
1. Minimum Cache Capacity
Given a list of n items accessed in sequence from a system, and a cache
with Least Recently Used (LRU) replacement policy, the goal is to determine
the minimum cache size required to ensure at least k requests hit the
cache. If it is not possible to achieve k hits, return -1.
Assume each item in the list has a size of 1 unit.
Note: A cache following Least Recently Used (LRU) replacement policy is of
fixed size and when it becomes full we will delete the value which is least
recently used and insert a new value.
Example
Suppose n = 5, requests = ["item1", "item1", "item3", "item1", "item3"], and k
= 1.
4
With size of cache as 1, we get:
Transcribed Image Text:n left LL D 1 2 3 1. Minimum Cache Capacity Given a list of n items accessed in sequence from a system, and a cache with Least Recently Used (LRU) replacement policy, the goal is to determine the minimum cache size required to ensure at least k requests hit the cache. If it is not possible to achieve k hits, return -1. Assume each item in the list has a size of 1 unit. Note: A cache following Least Recently Used (LRU) replacement policy is of fixed size and when it becomes full we will delete the value which is least recently used and insert a new value. Example Suppose n = 5, requests = ["item1", "item1", "item3", "item1", "item3"], and k = 1. 4 With size of cache as 1, we get:
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education