Any device that uses light to read and write information.

Why will the standard replacement algorithms (LRU, FIFO, clock) not be effective in handling this workload for a page allocation

dusya [7]

Answer:

These algorithm keeps an eye on which page was used when. LRU assumes that the page that was recently used has more probability

of being used or requested by the user. Thus, it keeps the pages that were recently used, when a new page is requested. If page

fault occurs, the requested page is fetched and it replaces the page in cache which was last referenced earlier than any other page

in the cache (or frame).The LRU associates a time with each page in the memory and the ones with the greatest value are replaced.

It does not suffer from Belady’s anomaly. The page fault will be referred when 512 page frame are reached. This is the total length of the complete sequence.

FIFO replaces pages that come in cache firstly. FIFO stands for First in first out.

(b) The FIFO replacement algorithm replaces the page which was first brought into the memory followed by the next and soon.

This algorithm suffers from Belady’s anomaly. In First In First out (FIFO) page replacement scheme of page replacement, the requests

are executed as they are received. When a new request is made of a page which is not available in the existing frames, then the requested

page is acquired from the memory. The page in the first frame is replaced by the requested page. If again a request is made of a page not

yet available in the frames, it is fetched from the memory and it replaces the second frame's page, and so on.

There are total 500 frames given. The alternative approach which is better than clock algorithm, FIFO, and LRU is that the pages

from 0 to 498 are set to the fixed frames. Thus, 499 frames are fixed and only one frame can vary.

Explanation:

6 0

3 years ago

with the current computer development, explain 5th areas where computer is applied for the social economic dwvelopment in societ

AleksandrR [38]

Explanation:

just want points tbh but have a good day

7 0

3 years ago

Write a program in c++ to displaypascal’s triangle?

Harman [31]

C++ Program to Print Pascal's Triangle

#include<iostream> //header file

using namespace std;

//driver function

int main()

{

int r;/*declaring r for Number of rows*/

cout << "Enter the number of rows : ";

cin >> r;

cout << endl;

for (int a = 0; a < r; a++)

{

int value = 1;

for (int b = 1; b < (r - a); b++) /*Printing the indentation space*/

{

cout << " ";

}

for (int c = 0; c <= a; c++) /*Finding value of binomial coefficient*/

{

cout << " " << value;

value = value * (a - c) / (c + 1);

}

cout << endl << endl;

}

cout << endl;

return 0;

}

Output

Enter the number of rows : 5

1

1 1

1 2 1

1 3 3 1

1 4 6 4 1

7 0

3 years ago

What can u access various sites on

Klio2033 [76]

Search engines. (I'm Misty btw if you want to know)

3 0

3 years ago

A group of accountants encrypt the emails they send to your company because they contain highly sensitive financial information.

ratelena [41]

Answer:

a) Generate a new public and private key

Explanation:

You encrypt a message using the recipient's public key and the recipient decrypts the message using his own private key. Only the public key can be known by an external agent. The private key is for the individual and is not expected to be shared. In the event that the recipient cannot decrypt the message, it is unsafe to send one's private key to him. He does not even need one's private key to decrypt the message, he needs his own private key.

The best thing to do is to generate another means of security by generating new public and private key so that the sender encrypts the message with the new public key and the receiver decrypts it using his new private key.

Option B is wrong because, if the encryption is removed, the aim, which is to secure the message from intruders is not achieved.

8 0

3 years ago