Suppose an application is assigned 4 pages of physical memory and the memory is initially empty. It then references pages in the following sequence: ABCDCAEFCFAGECA Show how the system would fault pages into the four frames of physical memory when each of the following replacement policies is used (clearly state the number of page faults for each policy, and justify this number by a diagram similar to the one discussed in lectures). 1- FIFO 2- LRU 3- MIN (optimal)

Suppose an application is assigned 4 pages of physical memory and the memory is initially empty. It then references pages in the following sequence: ABCDCAEFCFAGECA Show how the system would fault pages into the four frames of physical memory when each of the following replacement policies is used (clearly state the number of page faults for each policy, and justify this number by a diagram similar to the one discussed in lectures). 1- FIFO 2- LRU 3- MIN (optimal)

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

Similar questions

Write a program that simulates a toy paging system that uses the WSClock algorithm. The system is a toy in that we will assume there are no write references (not very realistic), and process termination and creation are ignored (eternal life). The inputs will be: The reclamation age threshhold The clock interrupt interval expressed as number of memory references A file containing the sequence of page references Describe the basic data structures and algorithms in your implementation. Show that your simulation behaves as expected for a simple (but nontrivial) input example. Plot the number of page faults and working set size per 1000 memory references. Explain what is needed to extend the program to handle a page reference stream that also includes writes.
Consider a system with the four access operations read, write, grant, and revoke. You can use grant not only to give other subjects read and write access, but also to grant them the right to grant access to the objects you own. Which data structure and algorithm would you use to implement the grant and revoke operation so that you can revoke all access to an object you own?
Write a C program Producer – Consumer as a classical problem of synchronizationStep 2. Write a program* that solves the producer - consumer problem. You may use the following pseudo codefor implementation.*program to write: produce -consumer problem to produce and consume the alphabet.//Shared data: semaphore full, empty, mutex;//pool of n buffers, each can hold one item//mutex provides mutual exclusion to the buffer pool//empty and full count the number of empty and full buffers//Initially: full = 0, empty = n, mutex = 1//Producer threaddo {…produce next item…wait(empty);wait(mutex);…add the item to buffer…signal(mutex);signal(full);} while (1);//Consumer threaddo {wait(full)wait(mutex);…remove next item from buffer…signal(mutex);signal(empty);…consume the item } while (1); it consumes and produce the alphabets not numbers sample output is attached you please also attach your sample output
Is it possible for a single process to halt in the middle of its execution? Justifications for your responses are required.
Implement in C programming language: Question 2 Write a c program that will generate the safe sequence of process execution for the situation given below:(Use Banker’s Algorithm). Note: The code can be implemented in several different ways, but make sure the parameter remains the same as shown below. n = 6; // Number of processes m = 4; // Number of resources int alloc[6][4] = { { 0, 1, 0, 3 }, // P0 // Allocation Matrix { 2, 0, 0, 3 }, // P1 { 3, 0, 2, 0 }, // P2 { 2, 1, 1, 5 }, // P3 { 0, 0, 2, 2 }, // P4 {1, 2 , 3, 1 } }; //P5 int max[6][4] = { { 6, 4, 3, 4 }, // P0 // MAX Matrix { 3, 2, 2, 4 }, // P1 { 9, 1, 2, 6 }, // P2 { 2, 2, 2, 8 }, // P3 { 4, 3, 3, 7 }, // P4 { 6, 2 , 6, 5 } }; //P5 int avail[4] = { 2, 2, 2, 1 };…
What describes how the principle of least privlege applies to the use of computers? A, It guarantees that no information inifially held in an object can be used outside its execution environment B, A process is allowed access only to the resources il needs to complete Its task and limit damage from a faulty process C, It is a process that can access an object in a domain only if that domain has a key that malches one of the locks of the object D It is the use of access controls to monitor and limit access to applications, programs, and websites during specific times of use.
You are tasked with the development of an E-Scooter ride-sharesystem. It allows registered commuters to approach an idle E-Scooter andreserve it, following which they use the E-Scooter to commute a certaindistance (that is not known prior to use). Finally, after the commuter reachestheir destination, they end the ride, which prompts an automaticcomputation of the ride fees. which is automatically debited using thecommuters registered payment details.
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…
Write a script using PHP that takes a link from the user and parses through its associated web page to print a list of every link embedded on that site. This program must work recursively, so for each link that gets printed, the program should automatically take each of those links as a new input and do the same for them until there are no more links left. If the same link exists twice on the same page, or if it exists on more than one page, the program should ignore all duplicate instances of the link.
Build a Non-Contiguous Segmented Memory Allocation Management in java that simulates the allocation of processes in memory
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…
Write a Python script that uses the sys module to perform the following tasks:1. In a main method:a. Read and print the command-line arguments when the script is run.b. Print the Python path (the directories where Python is looking for modules toimport).c. Print the Python version.d. Print the platform name.2. The main() function must only run automatically if the module is being run directly, notwhen imported. Here is a screenshot of the expected behavior, testing all scenarios described above. Replicatethis functionality in your script, including the formatting and outputs of all messages. Theprogram must work for any arguments that the user provides after the name of the script.