This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: COMPSCI 342-001 Data Structure and Algorithms (Fall 2011) Lab Assignment #1, Due on 9/09/2011, Friday (11PM) Introduction: This programming assignment asks you to design a cache implementation using linked list data structure. That is, write a Cache class having at least the following public methods – constructor, getObject, addObject, removeObject, clearCache and some others. The data to be stored in cache should be generic objects. Also, write a test program to test your cache implementation. Description: A cache is a storage in memory. If a data item has a copy in cache, application can read this data item from cache directly. The usage of cache is as follows. Whenever an application requires a data item, it searches the cache first. If it is a cache hit, then the cache returns the data item to the application and the data item will be move to the first position in the cache (we call it the Most Recently Used MRU scheme). On the other hand, if it is a cache miss, then the application needsRecently Used MRU scheme)....
View Full Document
This document was uploaded on 11/01/2011 for the course COMPSCI 342 at Boise State.
- Fall '09