Question

1 - A drawback of equal or proportional allocation is that Select one: a. they are...

1 - A drawback of equal or proportional allocation is that

Select one:

a. they are very expensive to compute.

b. the allocation varies according to the degree of multiprogramming.

c. a high-priority process is treated the same as a low-priority process.

d. the processes that arrive earlier get more pages than the processes arriving later.

2- Given the reference string of page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 3 and a system with three page frames, what is the final configuration of the three frames after the OPT algorithm is applied?

Select one:

a. 1, 2, 3

b. 1, 3, 4

c. 2, 3, 4

d. 1, 2, 1

0 0
Add a comment Improve this question Transcribed image text
Answer #1

1. Option C

high-priority process is treated the same as a low-priority process.

2. Option A

Page 4 is replaced with page 1, because page 4 reference is not required after referencing page 7.

Add a comment
Know the answer?
Add Answer to:
1 - A drawback of equal or proportional allocation is that Select one: a. they are...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

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
  • Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2...

    Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1. Suppose that there are also three frames within our system. Using the FIFO replacement algorithm, what will be the final configuration of the three frames following the execution of the given reference string? A. 1, 2, 3 B. 4, 1, 2 C. 3, 1, 2 D. 4, 2, 1

  • Problem 3 (12 points) Given these sequential page accesses: 1 2 3 423412 13 1 4 and a system with...

    Problem 3 (12 points) Given these sequential page accesses: 1 2 3 423412 13 1 4 and a system with three page frames, what will be the final contents of the three frames after the LRU algorithm is applied? Use the table below to the successive contents of the frames. When there is no page faults, leave the column blank. Answer: Fo Fi F2 Problem 3 (12 points) Given these sequential page accesses: 1 2 3 423412 13 1 4...

  • Operating Systems Virtual Memory Management question Given the reference string of page accesses below, and an...

    Operating Systems Virtual Memory Management question Given the reference string of page accesses below, and an allocation of 3 page frames, and the Least-Frequently Used page replacement algorithm. Show the content of the frames as the references are processed, and indicate which references cause page faults. Record the #page faults. ref 1 2 3 5 4 2 5 3 4 5 1 1 3 1 4 frame1 frame2 frame3 fault(X) #faults =

  • Consider the following virtual page reference sequence: page 1, 2, 3, 4, 2, 1, 5, 6,...

    Consider the following virtual page reference sequence: page 1, 2, 3, 4, 2, 1, 5, 6, 2, 1, 2, 3. This indicates that these particular pages need to be accessed by the computer in the order shown. Consider each of the following 4 algorithm-frame combinations: LRU with 3 frames FIFO with 3 frames LRU with 4 frames FIFO with 4 frames . For each of the 4 combinations, below, move from left to right as the virtual page numbers are...

  • 4. Worst-fit is an allocation algorithm that allocates the largest free block to a new job....

    4. Worst-fit is an allocation algorithm that allocates the largest free block to a new job. It is the opposite of the best-fit algorithm. Using the following configuration with jobs arriving in order (Job A, B, C, D) and with blocks shown in order from low order memory to high order memory: Job List: Memory Block List: Job Number Memory Requested Memory Block Memory Block Size Job A 44K Block 1 250K Job B 220K Block 2 900K Job C...

  • C language show all work 1. [50 pts] Given the following set of processes, with arrival...

    C language show all work 1. [50 pts] Given the following set of processes, with arrival times, priorities, and the length of the CPU burst in ms: Priority Arrival Time Burst time Process P1 P2 P3 P4 4. 3 2 0 0 10 (Note: lower number means higher priority, processes P1, P2, P3, and P4 arrive at the same time, in the given order). a. Draw a Gantt chart showing a FCFS scheduling algorithm. b. Draw a Gantt chart showing...

  • Implement the frame replacement algorithm for virtual memory Assume a computer system have 10 memory frames available inside the physical memory and is required to execute a process containing 20 pa...

    Implement the frame replacement algorithm for virtual memory Assume a computer system have 10 memory frames available inside the physical memory and is required to execute a process containing 20 pages. Assume a process P has been executed in the system and produced a sequence of 40 page demands as follows: Page demands trace of process P Demand 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 cont. Page...

  • Answer the following question: A Multi Level Feedback (MLF) algorithm uses 5 priority levels. All levels...

    Answer the following question: A Multi Level Feedback (MLF) algorithm uses 5 priority levels. All levels are using Round Robin (RR) Scheduling algorithm with Quantum: 1 ms, 2 ms, 4 ms, 8 ms, 16 ms respectively. Processes start at highest priority (Q=1) and is down graded to the lower priority if it didn't finish within 1 quantum. The following processes are to be scheduled: Arrival Io Wait 0 3 Process P1 P2 P3 CPU Burst 2 4 15 4 1...

  • Choose the correct answer 1. A virtual machine executes on a host operating system and a...

    Choose the correct answer 1. A virtual machine executes on a host operating system and a hypervisor provides an API to the actual hardware 2. The guest OS knows that it is not accessing the actual hardware so that it can perform better 3. The VM may supply an environment that is different than the actual host hardware 4. Applications running within the VM have an illusion that they are executing on a real machine Select one: a. All the...

  • Assume a dynamic queue which is serviced by a Priority Based Round Robin algorithm such that ther...

    Assume a dynamic queue which is serviced by a Priority Based Round Robin algorithm such that there exists three priorities (1,2,3) which are used as multipliers of the basic time quantum value with the resulting number being the maximum service time the corresponding job will receive each time it gets the CPU. For a maximum amount of time equal to 1 basic time quantum , a priority 2 job gets the CPU for the maximum amount of time equal to...

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
ADVERTISEMENT