HomeworkLib
Question

Consider the following sequence of page references: A,B,B,C,A,E,D,B,D,E,A,C,E,B,A,C,A,F,D,F and consider that a working set strategy is...

Consider the following sequence of page references: A,B,B,C,A,E,D,B,D,E,A,C,E,B,A,C,A,F,D,F and consider that a working set strategy is used for page replacement. What will the contents of the working set at each stage be for the following?

a. Window Size = 2

b. Window Size = 3

c. Window Size = 4

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

0 0
Add a comment
Know the answer?
Add Answer to:
Consider the following sequence of page references: A,B,B,C,A,E,D,B,D,E,A,C,E,B,A,C,A,F,D,F and consider that a working set strategy is...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • Consider the following page reference string: A C B D B A E F B F...

    Consider the following page reference string: A C B D B A E F B F A G E F A Assuming demand paging with four frames, how many page faults would occur for the following replacement algorithms? Remember that all frames are initially empty, so your first unique pages will cost one fault each. Show all of your works. LRU replacement FIFO replacement Optimal (MIN) replacement

  • Consider the following sequence of page references 8, 5, 1, 8, 2, 5, 1, 4, 2,...

    Consider the following sequence of page references 8, 5, 1, 8, 2, 5, 1, 4, 2, 3, 5, 3, 2, 8, 4. Assume that the memory has 3 frames which initially are free. What is the number of page faults using each of the following algorithms? a. FIFO b. LRU c. Clock d. Optimal

  • 1. Consider the code sequence: C= A + B D= A-E F= C+ D Assume the...

    1. Consider the code sequence: C= A + B D= A-E F= C+ D Assume the values A, B, C, D, E, and F reside in memory. For each Architecture I. Accumulator Architecture II. Memory- Register Architecture III. Register-Register Architecture write the code assuming the instruction codes (opcode) are 8 bits, memory addresses are 32 bits, and register addresses are 6 bits and CPU has 64 Registers; and create a table which specifies: – The execution sequence – The variables...

  • Consider the schema R=(A, B, C, D, E) and let the following set F of functional...

    Consider the schema R=(A, B, C, D, E) and let the following set F of functional dependencies hold for R: F= {A → BC, CD → E, B D } Problem 3 Suppose that the schema R=(A, B, C, D, E) is decomposed into R/ - (A, B, C) and R=(A, D, E). Show if this decomposition is a lossless decomposition with respect to the given set of functional dependencies F.

  • A process references five pages, A, B, C, D, and E, in the following order: B;...

    A process references five pages, A, B, C, D, and E, in the following order: B; C; B; A; E; A; D; E; C; B; D; A Assume that the replacement algorithm is Optimal, find out the number of page faults occurring after the frame allocation is initially filled with an empty main memory with three page frames. Optimal B C B A E A D E C B D A

  • Consider the following sequence of page references 8, 5, 1, 8, 2, 5, 1, 4, 2, 3, 5, 3, 2, 8, 4. Assume that the memory h...

    Consider the following sequence of page references 8, 5, 1, 8, 2, 5, 1, 4, 2, 3, 5, 3, 2, 8, 4. Assume that the memory has 3 frames which initially are free. What is the number of page faults using each of the following algorithms? a. FIFO b. LRU c. Clock d. Optimal

  • Consider the schema R = (A, B, C, D, E) and let the following set F...

    Consider the schema R = (A, B, C, D, E) and let the following set F of functional dependencies holdforR: F = {A -> BC, CD -> E, C -> A, B -> D,} 1) Prove or disprove ADE is in the closure of F. A proof can be made by using inference rules IR1 through IR3. A disproof should be done by showing a relational instance (counter example) that refutes the rule. 2) What are the candidate keys of...

  • 1. Consider a system where 3 page frames are allocated to a process. Consider the following...

    1. Consider a system where 3 page frames are allocated to a process. Consider the following sequence of memory references: 3 2 1 0 3 2 4 3 2 1 0 4. Assuming no pages are initially in memory, how many page faults are there assuming a FIFO page replacement algorithm is used? 2. Repeat problem 1 with number of frames increased to 4. 3. Compare the number of page faults from 1 and 2. Is there Belady’s anomaly? 4....

  • Consider the following relation R = {A,B,C,D,E} and the following set of functional dependencies F =...

    Consider the following relation R = {A,B,C,D,E} and the following set of functional dependencies F = { A → BC CD → E B → D E → A} F = { A → BC CD → E B → D E → A} Give a lossless, dependency-preserving decomposition into 3NF of schema R

  • 5c. Consider the relation R(ABCDE) with the set of functional dependencies F={BE→D, DE→A, AD→C, B→E}. Using...

    5c. Consider the relation R(ABCDE) with the set of functional dependencies F={BE→D, DE→A, AD→C, B→E}. Using decomposition, find a lossless, dependency preserving, BCNF set of relations for R, if such exists. Be sure to identify the projections of the functional dependencies onto the resulting relations at each stage of the decomposition.

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT