3. Consider FIFO, in slide 32 like below:Reference string: 7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,13 frames (3 pages can be in memory at a time per process)■reference string7 0 1 2 0 37 7 7001201page frames15 page faults0 42 2 433 31 0 023032 14 042220 3 32010113 27017127 70 02 1(a) Repeat this slide, but with 5 (five) frames (in report 4, you were asked to do the same slide with 4 framesand 2 frames). How many page faults are there?(b) How many page faults will be there if we use 9 (nine) frames? For this part (b), you can use mathematicalargument without really showing how the frames look for each new number.(c) How many page faults will be there is we use 1 (one) frame? Explain!

With 5 frames the slides is given below , In fifo the first page which enters the frame is replaced…

Answered: 3. Consider FIFO, in slide 32 like…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Similar questions

Write a Python Program to perform file operations such as open read, write and close on text and numeric data files with examples.
Calculate the total page faults using the CLOCK algorithm and a window size = 3 frames Given the following reference string : 1 2 1 3 45 3245 6 4 3 2 Fill in chart. Include the use bit (required for last set of frames only) There is no internal fragmentation. Total page faults CLOCK algorithm The process running has at least The size of a frame is 256 bytes. The program has at least pages in the program. bytes 3 4 5265
Suppose a computer system uses 16-bit addresses for both its virtual and physical addresses. In addition, assume each page (and frame) has size 256 bytes. How many bits are used for the page number? How many bits are used for the offset? 8 bits each. With this system, what’s the maximum number of pages that a process can have? 256 Suppose that each entry in the page table comprises 4 bytes (including the frame number, the valid bit, and miscellaneous “bookkeeping bits”). An OS uses an array to store the page table. What is the size of the page table? 1024 Bytes Furthermore, suppose the first 6 pages of a process map to frames 222 to 227 (as decimal numbers), and the last 5 pages of the process map to frames 1 to 5 (also decimal numbers). All other pages are invalid. Draw the page table, including the valid bit and the frame number. DONE Translate the following virtual addresses to physical addresses, and show how you obtain the answers. (Hint: You do not need to convert…
Please make a script in C that follows the picture's instruction, BUT with one change. Please write the script so that the computation of the distance between vertices is performed with a UDF. ALSO, PLEASE please please only utilize the stdio.h and math.h header files, please. NO iostream or cacio or anything like that, please. Thank you!!
in python using kernel
A *PPT.1.Basic of java ( Lesson2_Basic of java A Lesson3_Basic of java X A Lesson4 Basic of java X lesson5_Data Structur b Register for bartleby -> O File | C:/Users/MAZIN/Desktop/Software/Lesson4_Basic%20of%20java%20(3).pdf to 10 of 15 D Page view A Read aloud V Draw Y Highlight O Erase • Write method called sumEven that has two integer parameters num1 and num2, which represent a range of numbers. the method should find sum of all even numbers in the range including num1 and num2 and return the sum. The parameter num2 should be greater than or equal to num1 and both num1 and num2 should be greater than 0. If those condition are not satisfied return -1 from the method to indicate invalid. 9:48 PM D A 40) ENG 3/12/2021 O Type here to search
#9
Computer Science #include<cmath>#include<stdio.h>__global__voidprocess_kernel1(float *input1,float *input2,float *output,int datasize){int idx = threadIdx.x + blockIdx.x * blockDim.x;int idy = threadIdx.y + blockIdx.y * blockDim.y;int idz = threadIdx.z + blockIdx.z * blockDim.z;int index = idz * (gridDim.x * blockDim.x) * (gridDim.y*blockDim.y) + idy * (gridDim.x * blockDim.x) +idx;if(index<datasize)output[index] = sinf(input1[index]) + cosf(input2[index]);}__global__voidprocess_kernel2(float *input,float *output,int datasize){int idx = threadIdx.x + blockIdx.x * blockDim.x;int idy = threadIdx.y + blockIdx.y * blockDim.y;int idz = threadIdx.z + blockIdx.z * blockDim.z;int index = idz * (gridDim.x * blockDim.x) * (gridDim.y*blockDim.y) + idy * (gridDim.x * blockDim.x) +idx;if(index<datasize)output[index] = logf(input[index]);}_global__voidprocess_kernel3(float *input,float *output,int datasize){int idx = threadIdx.x + blockIdx.x *…
Short Answer: A program has the following page reference string 0122 3 4 4 1 3 3 25 66 2 4 If we allocate three page frames to the program using LRU a. Please draw a figure to show the page allocation/replacement. b. How many page faults will be generated?

Recommended textbooks for you

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Computer Networking: A Top-Down Approach (7th Edi…

Computer Engineering

ISBN:

9780133594140

Author:

James Kurose, Keith Ross

Publisher:

PEARSON

Computer Organization and Design MIPS Edition, Fi…

Computer Engineering

ISBN:

9780124077263

Author:

David A. Patterson, John L. Hennessy

Publisher:

Elsevier Science

Network+ Guide to Networks (MindTap Course List)

Computer Engineering

ISBN:

9781337569330

Author:

Jill West, Tamara Dean, Jean Andrews

Publisher:

Cengage Learning

Concepts of Database Management

Computer Engineering

ISBN:

9781337093422

Author:

Joy L. Starks, Philip J. Pratt, Mary Z. Last

Publisher:

Cengage Learning

Prelude to Programming

Computer Engineering

ISBN:

9780133750423

Author:

VENIT, Stewart

Publisher:

Pearson Education

Sc Business Data Communications and Networking, T…

Computer Engineering

ISBN:

9781119368830

Author:

FITZGERALD

Publisher:

WILEY

SEE MORE TEXTBOOKS

3. Consider FIFO, in slide 32 like below: Reference string: 7,0,1,2,0,3,0,4,2,3,0,3,0,3,2,1,2,0,1,7,0,1 ■ 3 frames (3 pages can be in memory at a time per process) reference string 701 2 0 3 0 4 2 3 03 2 1 201701 2 4 0 7 7 2 o 0 0 1 page frames 15 page faults 3 4 NO 0 1 3 N10 NOV 7 1 2 2 7 0 1