Create a "least recently used" cache that evicts the least recently used item. The cache should be configured with a max size and should map from keys to values (enabling you to enter and retrieve a value associated with a certain key). When it is full, it should evict the item that has been utilised the least recently. Assume that the keys are integers and the values are strings.

Create a "least recently used" cache that evicts the least recently used item. The cache should be configured with a max size and should map from keys to values (enabling you to enter and retrieve a value associated with a certain key). When it is full, it should evict the item that has been utilised the least recently. Assume that the keys are integers and the values are strings.

Programming Logic & Design Comprehensive

9th Edition

ISBN:9781337669405

Author:FARRELL

Publisher:FARRELL

Chapter8: Advanced Data Handling Concepts

Section: Chapter Questions

Problem 18RQ

See similar textbooks

Similar questions

Please DO NOT respond to this question by copy/pasting the code provided elsewhere on the site, none of those work. Thanks. Virtual Memory Lab This lab project addresses the implementation of page-replacement algorithms in a demand-paging system. Each process in a demand-paging system has a page table that contains a list of entries. For each logical page of the process, there is an entry in the table that indicates if the page is in memory. If the page is in memory, the memory frame number that page is resident in is indicated. Also, for each page, the time at which the page has arrived in memory, the time at which it has been last referenced, and the number of times the page has been referenced since the page arrived in memory are maintained. The page table data structure is a simple array of page-table entries (PTEs). Each PTE contains five fields as defined below: struct PTE { int is_valid; int frame_number; int arrival_timestamp; int…
numbers = {21 46 41 54 52 56 83 69} Partition (numbers, 3, 7) is called. Assume quicksort always chooses the element at the midpoint as the pivot. What is the pivot? What is the low partition? Ex: 9 {Ex: 1 2 3 What is the high partition? { What is numbers after partition (numbers, 3, 7) completes? {
Create a "least recently used" cache that removes the item that hasn't been used in a while. The cache should have an initial max size and map keys to values so that you may insert and retrieve entries linked to certain keys. The least recently used item should be ejected once it is full. You can assume that the values are strings and the keys are integers.
How to create a program that reads data from an input file named bst.txt which contains integers to be inserted to an Integer Binary Search Tree (BST)? After reading the input data the program should do the following: perform breadth-first traversal and display the order in which the nodes are visited perform pre-order depth-first traversal and display the order in which the nodes are visited perform in-order depth-first traversal and display the order in which the nodes are visited perform post-order depth-first traversal and display the order in which the nodes are visited display how many leaves are in the tree what is the height of the tree Put all your file in a folder including the input file and compress the folder using zip format and upload. The folder should contain the following files BSTNode.java BST.java BSTMain.java bst.txt…
Javascript: A startup that builds a chat app wants to identify highly social users. All the chat data is in a large log file with three values on each line - the sender ID, receipient ID, and the number of messages. Given a threshold number, find the number of users that appear at least as many times as this threshold.For example:USERA USERB 14USERA USERC 94USERB USERB 3...Note: On the third line, a user sents a message to himself.Inputslogs = a list of lines where each line is a stringthreshold = a numberOutputReturn a list of sorted user IDs. If the same user appears in the same line, only count them once.
Assume the following list of keys: 16, 38, 54, 80, 22, 65, 55, 48, 64, 95, 5,100, 58, 25, 36 This list is to be sorted using quicksort as discussed in this chapter. Use pivot as the middle element of the list. a.) Give the resulting list after one call to the partition b.) Give the resulting list after two calls to the partition
Q1. _' Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache class: LRUCache(int capacity) Initialize the LRU cache with positive size capacity. int get(int key) Return the value of the key if the key exists, otherwise return -1. void put(int key, int value) Update the value of the key if the key exists. Otherwise, add the key-value pair to the cache. If the number of keys exceeds the capacity from this operation, evict the least recently used key. The functions get and put must each run in O(1) average time complexity. Example 1: Input ["LRUCache", "put", "put", "get", "put", "get", "put", "get", "get", "get"] [[2], [1, 1], [2, 2], [1], [3, 3], [2], [4, 4], [1], [3], [4]] Output [null, null, null, 1, null, -1, null, -1, 3, 4]. Code only!! :.
An array may contain multiple duplicate values, as shown below. In order to design an algorithm with the best average performance to remove all duplicate values, which of the following data structures should be used? 110, 1100, s, 10, s6, s, 96, 34, s, 34, 20, 110, 30 Question 16 options: hash table stack list priority queue
Which of the following statement or statements are true ? Please check all that apply. Both the linkedlist and array size needs to be pre-decided Arrays have better cache locality that can make them better in terms of performance. It's easier to insert and delete elements from array than from the linkedlist Data type of the linked list doesnot need to be same, whereas in array, it must be the same memory can be allocated at runtime both for linkedlist and dynamic array Which of the following statements are true? Check all that applies 5 points Accessing any element of an array has the time complexity of O(n) Searching for an element in array and linkedlist has the same time complexity Inserting or Deleting an element from a stack or queue has the same time complexity Accessing an element from a singly…
The purpose of this project is to assess your ability to: Implement a hash table Utilize a hash table to efficiently locate data Analyze and compare algorithms for efficiency using Big-O notation For this project, you will implement a hash table and use it to store words in a large text file. Your hash table should use chaining for collision resolution. You may design any hash function you wish. Your program will read a file and insert each word into a hash table. Once the table is populated, allow the user to enter words to search for. For each word entered, your program should report the number of elements inspected and whether or not the word was located. Provide an analysis of your insert and search algorithms using Big-O notation. Be sure to provide justification for your claims.
Fix the spwd code so it works: /* spwd.c: a simplified version of pwd** starts in current directory and recursively* climbs up to root of filesystem, prints top part* then prints current part** uses readdir() to get info about each thing** bug: prints an empty string if run from "/"**/#include <stdio.h>#include <sys/types.h>#include <sys/stat.h>#include <dirent.h>ino_t get_inode(char *);void printpathto(ino_t);void inum_to_name(ino_t , char *, int );int main(){printpathto( get_inode( "." ) ); /* print path to here */putchar('\n'); /* then add newline */return 0;}void printpathto( ino_t this_inode )/** prints path leading down to an object with this inode* kindof recursive*/{ino_t my_inode ;char its_name[BUFSIZ];if ( get_inode("..") != this_inode ){chdir( ".." ); /* up one dir */inum_to_name(this_inode,its_name,BUFSIZ);/* get its name*/my_inode = get_inode( "." ); /* print head */printpathto( my_inode ); /* recursively */printf("/%s", its_name ); /* now print…
def get_task(task_collection, ...): """ param: task_collection (list) - holds all tasks; maps an integer ID/index to each task object (a dictionary) param: ... (str) - a string that is supposed to represent an integer ID that corresponds to a valid index in the collection returns: 0 - if the collection is empty. -1 - if the provided parameter is not a string or if it is not a valid integer Otherwise, convert the provided string to an integer; returns None if the ID is not a valid index in the list or returns the existing item (dict) that was requested. """