Suppose we are using the page replacement algorithm Least Recently Used, to replace pages of memory. We'll pretend we only have 3 frames of memory, and represent them as a horizontal list. For example: [4, 5, 6] would mean pages 4, 5, and 6 correspond to the first, second, and third frames. Suppose then, we have the following sequence of page hits: 85216777741221 We can assume the first three hits fills our frames with the following pattern: [8, 5, 2] By the time we get to the end of the sequence, what is the usage of our frames? The first frame contains: The second frame contains: The third frame contains:

Suppose we are using the page replacement algorithm Least Recently Used, to replace pages of memory. We'll pretend we only have 3 frames of memory, and represent them as a horizontal list. For example: [4, 5, 6] would mean pages 4, 5, and 6 correspond to the first, second, and third frames. Suppose then, we have the following sequence of page hits: 85216777741221 We can assume the first three hits fills our frames with the following pattern: [8, 5, 2] By the time we get to the end of the sequence, what is the usage of our frames? The first frame contains: The second frame contains: The third frame contains:

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter8: Arrays And Strings

Section: Chapter Questions

Problem 24PE

See similar textbooks

Similar questions

Write a program that implements the FIFO and LRU page-replacement algorithms presented in this chapter. First, generate a random page reference string to each algorithm, and record the number of page faults incurred by each algorithm. Implement the replacement algorithms so that the number of page frames can vary from 1 to 7. Assume that demand paging is used.
A grid needs a system for numbering the tiles in order to allow random-access lookup.For instance, the rows and columns of a square grid provide a natural numbering for the tiles. Create plans for hexagonal and triangular grids. Create a rule for identifying the neighbourhood (i.e., nearby tiles) of a certain tile in the grid using the numbering scheme. For instance, the neighbourhood of tile I j in a four-connected square grid with indices of I for rows and j for columns may be described as neighbourhood(i, j) = I 1, j, I j 1.
Suppose you’re consulting for a bank that’s concerned about fraud detection, and they come to youwith the following problem. They have a collection of n bank cards that they’ve confiscated, suspectingthem of being used in fraud. Each bank card is a small plastic object, containing a magnetic stripe withsome encrypted data, and it corresponds to a unique account in the bank. Each account can have manybank cards corresponding to it, and we’ll say that two bank cards are equivalent if they correspond to thesame account.It’s very difficult to read the account number off a bank card directly, but the bank has a high-tech “equivalence tester” that takes two bank cards and, after performing some computations, determines whether theyare equivalent.Their question is the following: among the collection of n cards, is there a set of more than n/2 of themthat are all equivalent to one another? Assume that the only feasible operations you can do with the cardsare to pick two of them and plug them…
Write a JAVA program for HTML is the language of web pages. Items start and end with tags. A table starts with <table> and ends with </table>. In a table, a row starts with <tr> and ends with </tr>. In a row, a column starts with <td> and ends with </td>. Given two integers for rows and columns, generate an appropriately sized html table. Place the character c in each table cell. If the input is 2 3, the output is: <table> <tr> <td> c </td> <td> c </td> <td> c </td> </tr> <tr> <td> c </td> <td> c </td> <td> c </td> </tr> </table>
You are the sysadmin for a big tech company, and you have to estimate the amount of servers you need to handle some long-running jobs. One server can handle only one job at once. One job can only be executed by one server at once. Once a server has finished executing its current job, it can be reassigned to a new job. Given an array of time intervals intervals where intervals[i] = [starti, endi], representing the start and end time for a particular job that needs to be executed, return the minimum number of servers required to run all jobs. Constraints: 1 <= intervals.length <= 104 0 <= starti < endi <= 106 Function definition for Java: public int minMeetingRooms(int[][] intervals) { // Your code here } Function definition for Python: def minMeetingRooms(self, intervals: List[List[int]]) -> int: #Your code here Announced Test Cases: Input: intervals = [[0,30],[5,10],[15,20]] Output: 2Explanation: We need one server for the job that starts at 0. For the job…
Implement a program that will populate a 6x5 matrix with randomly generated integers from 100 to 500. (1) print your matrix in a table form. (2) modify your code to multiply all odd numbers by 2 and print the matrix. Sample run: Initial Matrix: 145 | 437 | 222 | 101 | 100 | 278 500 | 190 | 415 | 288 | 466 322 377 | 240 | 451 | 331 186 186 432 102 | 106 | 105 249 248 | 117 | 213 | 499 488 355 | 266 | 396 | New Matrix: 290 | 874 | 222 | 101 | 100 | 278 500 | 190 | 830 288 | 466 322 754 | 240 | 902 | 662 186 432 | 102 | 106 | 210| 498 248 | 234 | 426 | 998 488 710 | 266 | 396 |
Write a script (Python) for least squares l2 that can receive either: a 2D point cloud. Let the program load an ASCII txt file with the data in two columns, as appropriate. The number of points is arbitrary. In addition, display a graph with the cloud of points and the approximate line, together with the error made.
A set of integers 0..MAX may be implemented using an array of boolean values. This particular implementation is called a bit-vector implementation of a Set. Since C doesn’t have the Boolean data type, then substitute TRUE with 1 and FALSE with 0, or define 1 and 0 as TRUE and FALSE, respectively.For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE. For example, if the integer 3 is an element of the set, then the array element indexed by 3 is TRUE. On the other hand, if 3 is not an element, then the array element indexed by 3 is FALSE.For example: if s = {3,4,6,8}, the array looks like this: Implement a programmer-defined data type called BitSet to represent a set as follows:typedef int BitSet[MAX];Implement the following functions:void initialize(BitSet s); - set all array elements to FALSEvoid add(int elem,BitSet s);- set the item indexed by elem to…
The Reflection algorithm can be used to encrypt a C-string (character array terminated with the null character) before it is transmitted over the Internet. The Reflection algorithm works as follows: Each letter in the message is converted to the letter in that is 13 positions to the right of that letter in the English alphabet. If the end of the alphabet is reached, counting continues from the first letter in the alphabet. The case of the letters must be maintained. For example,'M' →'Z', 'x' → 'k', 'A' → 'N'The numeric characters ('0' to '9') are shifted 5 positions to the right of that number in the character set '0' to '9'. If ‘9’ is reached, counting continues from ‘0’. For example,'0' → '5', '2' →'7', '8' → '3' All other characters are left as they are. a) What would the following string be encrypted to by the Reflection algorithm?“Call me at 662-2002 Ext 85393” b) Write a function, getPosition, which finds the position of a letter in the alphabet regardless of the case of the…
A palindrome is a sequence that is the same as its reverse. For example, the word "RACECAR" is a palindrome. For this problem we will define an almost palindrome to be a sequence that can be transformed into its reverse with 2 or fewer character additions, deletions, replacements, or swaps. A character swap swaps two adjacent characters. For instance "MARJORAM" can be reversed by swapping the 'J' and the 'O'. In addition, "FOOLPROOF" can be reversed by replacing the 'R' with and 'L' and vice versa. Finally, the word "BONOBO" can be reversed by deleting the final 'O' and reinserting it at the beginning. Devise a dynamic programming algorithm that will determine the number of edits necessary to to transform a sequence into its reverse. a) State this problem with formal input and output conditions. b) State a self-reduction for this problem. c) State a dynamic programming algorithm based off of your self-reduction that computes the minimum number of edits to transform a sequence into its…
A bit shift is a procedure whereby the bits in a bit string are moved to the left or to the right. For example, we can shift the bits in the string 1011 two places to the left to produce the string 1110. Note that the leftmost two bits are wrapped around to the right side of the string in this operation. Define two scripts, shiftLeft.py and shiftRight.py, that expect a bit string as an input. • The script shiftLeft shifts the bits in its input one place to the left, wrapping the leftmost bit to the rightmost position. • The script shiftRight performs the inverse operation. • Each script prints the resulting string. An example of shiftLeft.py input and output is shown below: Enter a string of bits: Hello world! ello world!H An example of shiftRight,py input and output is shown below: Enter a string of bits: Hello world! !Hello world
Encryption Matrices are commonly used to encrypt data. Here is a simple form such an encryption can take. First, we represent each letter in the alphabet by a number, so let us take = 0, A = 1, B = 2, and so on. Thus, for example, "ABORT MISSION" becomes [1 2 15 18 20 0 13 9 19 19 9 15 14]. To encrypt this coded phrase, we use an invertible matrix of any size with integer entries. For instance, let us take A to be the 3 2 2 x 2 matrix 4 1 We can first arrange the coded sequence of numbers in the form of a matrix with two rows (using zero in the last place if we have an odd number of characters) and then multiply on the left by A. 3 2 1 15 20 13 19 9 14 Encrypted Matrix = 4 1 2 18 0 9. 19 15 0 7 81 60 57 95 57 42 = 6 78 80 61 95 51 56 which we can also write as [7 6 81 78 60 80 57 61 95 95 57 51 42 56]. To decipher the encoded message, multiply the encrypted matrix by A1. The following exercise uses the above matrix A for encoding and decoding. Use the matrix A to encode the phrase "GO…