Scribd
Upload
11 views

OS Mid Term 2021

Department of Computer Sc. and Engineering National Institute of Technology, Hamirpur. CS-222 Operating System Mid Semester Exam Max Marks: 30 Max Time: 1.30 Hrs.

Uploaded by

Sahil Sood
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

OS Mid Term 2021

Department of Computer Sc. and Engineering National Institute of Technology, Hamirpur. CS-222 Operating System Mid Semester Exam Max Marks: 30 Max Time: 1.30 Hrs.

Uploaded by

Sahil Sood
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Department of Computer Sc.

and Engineering
National Institute of Technology, Hamirpur.
CS-222 Operating System
Mid Semester Exam

Max Marks: 30 Max Time: 1.30 Hrs.


Note: All Questions are compulsory. Non-Programmable calculator is allowed.
Assume necessary data if something missing.

Question1) Consider a system with 80% hit ratio, 50 nano-seconds time to search the
associative registers, 750 nano-seconds time to access memory. Find the time to
access a page.
a. When the page number is in associative memory.
b. When the time to access a page when not in associative memory.
c. Find the effective memory access time. 6

Question2) Suppose that the following processes arrive for execution at the times indicated.
Each process will run the listed amount of time. In answering the questions, use
non-preemptive scheduling and base all decisions on the information you have at
the time the decision must be made.
Process Arrival Time Burst Time
P1 0.0 8
P2 0.4 5
P3 1.0 2
a. What is the average turnaround time for these processes with the FCFS
scheduling algorithm?
b. What is the average turnaround time for these processes with the SJF
scheduling algorithm?
6
Question3) Consider the following page reference string:
1, 2, 6, 4, 2, 11, 5, 6, 3, 1, 2, 4, 7, 6, 4, 2, 8, 2, 3, 6.
How many page faults would occur for the following replacement algorithms,
assuming three, four, and five frames? Remember all frames are initially empty,
so your first unique pages will all cost one fault each.
• Optimal replacement 6

Question4) What is the effect of allowing two entries in a page table to point to the same page
frame in memory? Explain how this effect could be used to decrease the amount
of time needed to copy a large amount of memory from one place to another.
What effect would updating some byte on the one page have on the other page?
6
Question5) If the hit ratio to a TLB is 80%, and it takes 15 nanoseconds to search the TLB,
and 150 nanoseconds to access the main memory, then what must be the effective
memory access time in nanoseconds? 6

You might also like