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
Priority Scheduling
Round-Robin Scheduling
Multilevel Queues Scheduling
Multilevel Feedback Queues Scheduling

CS604 Current Spring 2012 Final Term VU Paper [July 2012] Virtual University of Pakistan

mostly mcq’s from past papers……..

How can u display the status of suspended and background processes in Unix/Linux shell.?

How can u terminate the processes in Unix/Linux shell.?

The problem with using an acyclic-graph structure is ensuring that there are no cycles. What is the solution?What is Mounting? Name two types of mounting.
Give your answer with respect to File System?

About load time in computer compilation data copied from vu solutions dot com?

Briefly explain the difference Least frequently used and Most Frequently Used algorithms with respect to Page Replacement techniques. ( 5marks)

Consider a logical address space of eight pages of 1024 words each, mamapped ont a physical memory of 32 frames.

How many bits are there in the logical address?

How many bits are there in the physical address? ( 5marks)

Draw backs of semaphore? ( 5marks)