CS604 Current Spring 2012 Final Term VU Paper [July 2012] Virtual University of Pakistan
1: 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)?
2: What are the three stages/times when the address is bound to instructions and data?
3: What is mounting and explain It.???
4: Three types of access modes and classes of users in UNIX protection?
5: What is Load Time?
6: What is Index Allocation Method?
7: Choose Preemptive and Non-Preemptive Scheduling from the following;
First-Come-First-Served (FCFS) Scheduling
Shorted Job First (SJF) Scheduling
Shortest Remaining Time First (SRTF) Scheduling
Multilevel Queues Scheduling
Multilevel Feedback Queues Scheduling