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
64
/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
Q2. Number of free frames
= 64
Number of processes
= 3
Process sizes
: P1 = 10 pages; P2 = 40 pages; P3 = 127 pages
Fixed allocation
64
/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
Q8 Advantages of Virtual memory
-- Virtual University of Pakistan*** IT n CS Blog
================================
http://www.geniusweb.tk
http://itncs.tk
You received this message because you are subscribed to the Google
Groups "vulms" group.
To post to this group, send email to vulmsit@googlegroups.com
To unsubscribe from this group, send email to
vulmsit+unsubscribe@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/vulmsit?hl=en?hl=en
No comments:
Post a Comment