Provide a code for LRU The Last Recently Used (LRU) solution for the memory page replacement but using two bits (boolean variable in Java) for the clock algorithm with one indicates the reference bit and the other indicates the read/write bit. Here we assume for all the processes, the pages with the number 2 and 5 involve data writing operation; all the other numbers (1, 3, 4, 6) only involve reading operations. Provide output examples of the code at the bottom.

Provide a code for LRU The Last Recently Used (LRU) solution for the memory page replacement but using two bits (boolean variable in Java) for the clock algorithm with one indicates the reference bit and the other indicates the read/write bit. Here we assume for all the processes, the pages with the number 2 and 5 involve data writing operation; all the other numbers (1, 3, 4, 6) only involve reading operations. Provide output examples of the code at the bottom.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 19SA

See similar textbooks

Related questions

Q: Suppose a program segment consists of a purely sequential part which takes 100 cycles to execute,…

A: Pure sequential Part tkes 100 cycles Loop takes 100 cycles Iterated loop takes 400 times

Q: Implement SRTF (SJF with preemption) scheduling algorithm in C programming. NOTE: Please do not…

A: In this question we have to write the code to implement SRTF with preemption in C program.Let's code…

Q: In c++ write an assembler in which it will read a program written in HACK assembly language from an…

A: Assembly languages serve as a bridge between the human-readable mnemonic representation of…

Q: Write a program (Rotate.asm) in HACK assembly that implements an algorithm to rotate the bits of a…

A: The "Rotate.asm" program uses HACK assembly language to implement a left rotation algorithm for a…

Q: Create a program in C++ which simulates a direct cache. The memory array that contains the data to…

A: Implementation of a direct-mapped cache in C++, which simulates the behavior described:

Q: Consider the following sequence of virtual memory references (in decimal) generated by a single…

A: Page size are as follows 0 -> 0 to 1023 1 -> 1024 to 2047 2 -> 2048 to 3071 3 -> 3072…

Q: Suppose that DS=1000H, SS= 2000H, CS=3000H, ES=4000H, BP=FFH, BX=FFFFH and DI=5H. i. Which memory…

A: Which memory locations are addressed by: MOV DL, [BP]: the default segment of [BP] is:SS so memory…

Q: The Java Virtual Machine (and your computer’s assembly language) support a goto instruction so that…

A: To generate a straight-line program that searches for a given pattern, you can use the DFA…

Q: I have a 128-bit computer where addresses are 128 bits wide. I want to implement virtual memory with…

A: The following solution is

Q: In MATLAB, a grey-scale image is stored a a matrix of numbers, all between 0 (black) and 255…

A: In MATLAB, grayscale images are represented as matrices of numbers, where each pixel's intensity…

Q: Implement a c/java/pythonprogramto generate reference stringsfrom given 5 address sequence(user…

A: Below is the required java code: Program: // Import necessary namespaces import java.util.HashMap;…

Q: Example 9.7. In this example, we want to construct an 8-bit dedicated datapath for solving the…

A: To test for counteight ≠ 8, we use a 4-input NAND gate with the least three significant input bits…

Q: What are the contents of the ROM location in address = 01100mo1o is: o 0000100000011om O…

A: Read-only is a storage that stores the data permanently. It is the primary unit of the CPU. It can…

Q: When translating conditionals or loops, the generated low-level code contains jumps. For the CPU to…

A: i. Symbolic addresses allow code generators to generate code that is easier to read, understand, and…

Q: this problem we want to modify the single cycle datapath shown below (also in in slide 1 of…

A: Jump instruction resemble the branch but it computes the PC in different way and it is…

Q: For this assignment, you are to write a MIPS assembly language program using the MARS IDE and assume…

A: Answer

Q: Branches and Branches Here is a portion of a program. The initial condition codes have the values N-…

A: Branches and BranchesHere is a portion of a program. The initial condition codes have the values N =…

Q: 2. Implement the frame replacement algorithm for virtual memory In Java For this task, you need to…

Q: se C, C++, python or matlab to develop a program whose main routine accepts two parameters n and k,…

A: Solution:-- 1)The given question has required for the solution to be provided as the program for…

Q: Consider a computer that has a byte-addressable memory organized in 32-bit words according to the…

A: A byte-addressable memory uses a 1-byte memory cell to represent an address. A computer can store…

Q: Create a program in C++ which simulates a direct cache. The memory array that contains the data to…

A: Cache memory which refers to the one simply as cache memory which it is a chip-based computer…

Q: In Assembly code: We have seen that multiplication by a power of two is easy with binary numerals:…

A: This question is related to the assembly code from bitwise operations, multiplication in assembly…

Q: The memory location at address of 0X003FB01 contains 1-byte memory variable J (0010_0001), and the…

A: The correct option is (c) Answer 1 and Answer 2 are given below choose one from them which is easy…

Q: Implement c/c++ to evaluate round robin algorithm. You must use the job list given here: Job (1)…

A: According to the information given:- we have to performance metrics, but not limited to:(i)…

Q: Write a 6502 assembly language program which implements the following pseudocode: i=0 for num = x to…

A: A 6502 assembly language program is made up of a set of mnemonic-written instructions that…

Q: Implement c/c++ to evaluate round robin algorithm with i/o burst.I want my code to able to read csv.…

A: on the off chance that (rem_bt[i] > 0) { done = bogus;//There is a…

Q: 4. The Single Instruction Computer (SIC) has only one instruction that can do all operations our…

A: Given:

Q: { int i; float x[5], y[5]; [ lots of code deleted... ] for (i=0;i y[i]) x[i] = x[i] + y[i]; [ more…

A: Note: This question asked for the conversion of the given code into MIPS assembly language only. So,…

Q: Write a python code in multiprocessing (from mpi4py import MPI) Consider a system of 2 processes.…

A: Let's see the solution in the next steps

Q: Write a code in sim8085 for the following problem: The pressure of two boilers is monitored and…

A: assembly language, sometimes abbreviated asm, is any low-level programming language in which there…

Q: Single instruction computer (SIC) has only one instruction that for all operations our MIPS does.…

A: We need to build SIC program to add a and b, leaving the result in a and leaving b unmodified.

Q: Assume that a memory module contains three holes of 10MB each. A sequence of 14 requests for 1MB…

A: Answer a> For first fit : It will allocate request to those places which will satisfy the size…

Q: Write a C program to create two processes P1 and P2. P1 takes 2 integers (x, y) and passes it to P2.…

A: A process is an executing program. When a program is compiled, it converts into a binary code.…

Q: Question 3: On a byte addressable machine a string COMSATS UNIVERSITY ISLAMABAD PAKISTAN, starting…

A: We need to use the concept of PAGING for noncontinuous memory allocation.

Q: Case Study Assume a computer system has a main memory of 256 Bytes. The following is a memory…

A: This is cache organization related problem and its solution provided in step 1.

Concept explainers

Computer Fundamentals

The computer is termed computation. For calculating or computing something the device that has been used is known as the computer. Or we can say that for performing a fast arithmetic operation the device that has been used is a computer. Storing, processing, and retrieving are the main features of a computer. 

Question

CODE IN JAVA !!!!!!!!!!!!!!!!!!!!!!!

Provide a code for LRU

The Last Recently Used (LRU) solution for the memory page replacement but using two bits (boolean variable in Java) for the clock algorithm with one indicates the reference bit and the other indicates the read/write bit. Here we assume for all the processes, the pages with the number 2 and 5 involve data writing operation; all the other numbers (1, 3, 4, 6) only involve reading operations.

Provide output examples of the code at the bottom.

Process or set of rules that allow for the solving of specific, well-defined computational problems through a specific series of commands. This topic is fundamental in computer science, especially with regard to artificial intelligence, databases, graphics, networking, operating systems, and security.

Expert Solution

This question has been solved!

Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.

This is a popular solution!

SEE SOLUTION Check out a sample Q&A here

Step 1

Step 2

Step 3

Step 4

Step 5

Trending now

This is a popular solution!

Step by step

Solved in 5 steps with 3 images

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions

Use C, C++, python or matlab to develop a program whose main routine accepts two parameters n and k, i.e. when you invoke your program from the shell, you pass it two parameters, n and k, where n >=16 and k >=3 and is in powers of 2 (e.g. 2, 4, 8, 16, etc.). Your main routine shall generate a random page trace of size n, where the page numbers have values ranging from 0 to ? − 1. Develop a subroutine within your program that implements the LRU page replacement algorithm (as a separate function within your program). Your algorithm shall use the doubly linked list stack implementation as outlined in slide 29 of lecture 10). The function shall accept a page trace and a parameter f for the number of frames allocated. Your main routine shall then apply the random page trace to the subroutine implementing the page replacement algorithm, multiple times (using only one trace, randomly generated), passing a parameter f (number of page frames used) that ranges from 4 to k. Your main…
Use C, C++, python or matlab to develop a program whose main routine accepts two parameters n and k, i.e. when you invoke your program from the shell, you pass it two parameters, n and k, where n >=16 and k >=8and is in powers of 2 (e.g. 8, 16, 32, etc.). Your main routine shall generate a random page trace of length n, where the page numbers have values ranging from 0 to ? − 1. Develop a subroutine within your program that implements the FIFO page replacement algorithm (as a separate function within your program). The function shall accept a page trace and a parameter f for the number of frames allocated. Your main routine shall then apply the random page trace to the subroutine implementing the page replacement algorithm, multiple times (using only one trace, randomly generated), passing a parameter f (number of page frames used) that ranges from 4 to k. Your main routine shall then record the number of page faults for each run (i.e. for each f).Run your program using a page…
For this assignment, you are to write a MIPS assembly language program using the MARS IDE and assume a system has 31-bit virtual memory address (so no worry about negative numbers) with a 4-KB page size (4096 bytes). Write a MIPS program that accepts an integer input that represents a virtual address and outputs the page number and offset for the given address in decimal. The output should look like: The address 19986 is in: Page number = 4 Offset = 3602 Check to make certain your program works. You can use the output from 19986 given above as a test, but I will use other numbers to test it. Submit the MIPS assembly language code and a screenshot showing a test run.
Write a 6502 assembly language program which implements the following pseudocode: i = 0 for num = x to y counting by 5 ar[i] = num i = i+ 1 For your implementation, x and y are stored in the first and second bytes of the zero page, ar starts at the third byte of the zero page and continues for as many bytes as necessary. The outcomes of an example run are below: x=0, y=15, ar={0, 5, 10, 15}
i need the answer quickly
In MATLAB, a grey-scale image is stored a a matrix of numbers, all between 0 (black) and 255 (white). Since there are 256 possible values, 8 bits are needed or each pixel, in contrast to a normal integer, which is 64 bits.To save memory, grey-scale images are stored with a special data type, uint8 (unsigned 8-bit integer). In computer terminology, 8 bits = 1 byte. Even at one byte per pixel, a large image can consume a lot of memory. For example, a 1000x1000-pixel image takes 1 million bytes (which is a little less than 1 megabyte, since by convention 1 Mbyte = 2^20 bytes). One technique for reducing the size of an image is quantization - reducing the number of allowable levels from 256 to something smaller. Surprisingly, most images can be quantized by a large factor without losing much information. In this problem, you will quantize a grey-scale image to only 4 levels, so that it could (in principle) be stored as 2 bits per pixel. The template will read in an image file. Your job…
Please help me with my AlgorithmDesign problem. From the following list of bus rapid transit system (one way): Name Route Vacation A->B->C->D Work 1 E->B->F->G->H Work 2 B->N->E Work 3 H->D->N The problem: ➢ Task: Design an algorithm (C/C++/Java/Phyton) to read the bus rapid transit system routes list and print the number of tickets we need to purchase if we want to visit all places minimal twice. The complexity of the algorithm must be O(V+E). V is the number of places. E-> is the number of transits. ➢ PS: Use Tarjan’s or Kosaraju’s strongly connected component algorithm. **In order for A to be visited twice, we must order 2 "Vacation" tickets (multiply by 2)
Case Study Assume a computer system has a main memory of 256 Bytes. The following is a memory byte-access trace history of a program run on this system. For example, as it is shown, the program first accesses memory address 0000 0000, and then it accesses memory address 0000 0001 and so on. Note the memory addresses are represented in binary: 00000000, 00000001, 00000010, 00000011, 00001000, 00010000, 00010001, 00000100, 00000101, 00000110, 00000111, 00001001, 00001010, 00001011, 00001100, 00001000, 00001001, 00001010, 00011100, 00011101. Q3. Assume the system has a 16-Byte direct mapped unified L1 cache with a block size of 2 Bytes. The following table shows how the cache looks like after the first access to the memory is finished. Please show; in the provided table, how it looks like after the 20th access is finished. You could ignore the "Data" Column. (Add or remove Rows/Columns in the provided table for your answer, as you see fit). Cache contents after the 1st access: Cache Index…
In Assembly code: We have seen that multiplication by a power of two is easy with binary numerals: Tomultiply a number by 2^p corresponds to p left shifts. This works both for signed andunsigned numbers as long as we are careful with the range.Below is an attempt on a subroutine to multiply by a positive power of two. As noted inthe contract, the assumption is that p is a strictly positive integer (i.e., 1, 2, 3 etc.). What happens when this subroutine is called with R5 = 3 and R6 = 11? Give a shortbut precise answer at the register level of the MCU
) Consider the following sequence of virtual memory references (in decimal) generatedby a single program in a pure paging system:100, 110, 1400, 1700, 703, 3090, 1850, 2405, 2460, 4304, 4580, 3640a. Derive the corresponding reference string of pages (i.e. the pages the virtual addressesare located on), assuming a page size of 1024 bytes. (Assume that page numberingstarts at 0)b. For the page sequence derived above, determine the number of page faults for each ofthe following page replacement strategies, assuming that two (2) page frames areavailable to the program.i. LRUii. FIFOiii. OPT (Optimal)
4. The Single Instruction Computer (SIC) has only one instruction that can do all operations our RISC-V does (you did a homework problem). The instruction has the following format sbn a, b, c # Mem[a]=Mem[a]- Mem[b]; if (Mem[a]- Mem[b]<0) go to PC+c For example, here is the program to copy a number from location a to location b: sbn temp, temp, 1 sbn temp, a, 1 sbn b,b, 1 sbn b, temp 1 Start: Design a single cycle datapath and control for this instruction set architecture.
I have a 128-bit computer where addresses are 128 bits wide. I want to implement virtual memory with paging for this computer, and I want to use a page size of 4KB. I will design it so that a page table consumes exactly one page. How many page table entries (PTEs) fit within a page?