CS604 Fall 2011 Final Term Feb 2012 – VU Current Paper – 12 Feb 2012

Q1. The maximum number of pages in process address space is one million and the total address size (p +d) of process
address space is 32- bit with page size is 4096 bytes. Calculate the number of bits required for page number (p) and the
number of bits required for offset (d)?

Q2. Number of free frames

= 64
Number of processes

= 3
Process sizes

: P1 = 10 pages; P2 = 40 pages; P3 = 127 pages

Fixed allocation

/3 = 21 frames per process and one put in the free frames list
Q3. disadvantage of dynamic loading

Q4. Formula for calculation of average waiting time for preemptive SJF

Q5. advantages of Preemptive verses Non-Preemptive scheduling

Q6. What is mount and its type

Q7. types of Semaphore