Q. Consider the reference string 0 1 2 3 0 1 4 0 1 2 3 4 If FIFO page replacement algorithm is used, then the number of page faults with three page frames and four page frames are .......... and ........... respectively.

View solution

Q. Suppose there are four processes in execution with 12 instances of a Resource R in a system. The maximum need of each process and current allocation are given below:
Process Max. Need Current Allocation
P1 8 3
P2 9 4
P3 5 2
P4 3 1

With reference to current allocation, is system safe? If so, what is the safe sequence?

View solution

Q. If the Disk head is located initially at track 32, find the number of disk moves required with FCFS scheduling criteria if the disk queue of I/O blocks requests are: 98, 37, 14, 124, 65, 67

View solution

Q. A scheduling Algorithm assigns priority proportional to the waiting time of a process. Every process starts with priority zero (lowest priority). The scheduler re-evaluates the process priority for every 'T' time units and decides next process to be scheduled. If the process have no I/O operations and all arrive at time zero, then the scheduler implements .............. criteria.

View solution

Q. There are three processes P1, P2 and P3 sharing a semaphore for synchronising a variable. Initial value of semaphore is one. Assume that negative value of semaphore tells us how many processes are waiting in queue. Processes access the semaphore in following order:

(a) P2 needs to access
(b) P1 needs to access
(c) P3 needs to access
(d) P2 exits critical section
(e) Pi exits critical section

The final value of semaphore will be:

View solution

Q. In a paging system, it takes 30 ns to search translation Look-aside Buffer (TLB) and 90 ns to access the main memory. If the TLB hit ratio is 70%, the effective memory access time is:

View solution

Q. Match the following w.r.t. Input/Output management:

List-l List-II
a. Device controller i. Extracts information from the controller register and store it in data buffer
b. Device driver ii. I/O scheduling
c. Interrupt handler iii. Performs data transfer
d. Kernel I/O subsystem iv. Processing of I/O request

Codes: a b c d

View solution

Q. Which of the following scheduling algorithms may cause starvation?
a. First-come-first-served
b. Round Robin
c. Priority
d. Shortest process next
e. Shortest remaining time first

View solution

Q. Distributed operating systems consist of:

View solution

Q. Which of the following is incorrect for virtual memory

View solution

Q. Consider following schedules involving two transactions:

S1: r1(X); r1(Y); r2(X); r2(Y); w2(Y); w1(X)
S2: r1(X); r2(X); r2(Y); w2(Y); r1(Y); w1(X)

Which of the following statement is true?

View solution

Q. A memory management system has 64 pages with 512 bytes page size. Physical memory consists of 32 page frames. Number of bits required in logical and physical address are respectively:

View solution

Q. Consider a disk queue with I/O requests on the following cylinders in their arriving order:

6,10,12,54,97,73,128,15,44,110,34,45

The disk head is assumed to be at cylinder 23 and moving in the direction of decreasing number of cylinders. Total number of cylinders in the disk is 150. The disk head movement using SCAN-scheduling algorithm is:

View solution

Q. Match the following for Unix rue system:

List-I                  List-II
a. Boot block     i. Information about file system,
free block list, free inode list etc.
b. Super block ii. Contains operating system files
as well as program and data files
created by users.
c. Inode block   iii. Contains boot program and
partition table.
d. Data block    iv. Contains a table for every file in
the file system. Attributes of files
are stored here.

Codes:
     a   b  c   d

View solution

Q. Some of the criteria for calculation of priority of a process are:

a. Processor utilization by an individual process.
b. Weight assigned to a user or group of users.
c. Processor utilization by a user or group of processes.

In fair share scheduler, priority is calculated based on:

View solution

Q. One of the disadvantages of user level threads compared to Kernel level threads is

View solution

Q. Names of some of the Operating Systems are given below:

(a) MS-DOS
(b) XENIX
(c) OS/2

In the above list, following operating systems didn’t provide multiuser facility.

View solution

Q. Consider a system with seven processes A through G and six resources R through W.
Resource ownership is as follows:

process A holds R and wants T
process B holds nothing but wants T
process C holds nothing but wants S
process D holds U and wants S & T
process E holds T and wants V
process F holds W and wants S
process G holds V and wants U

Is the system deadlocked ? If yes, ............. processes are deadlocked.

View solution

Q. Suppose that the virtual Address space has eight pages and physical memory with four page frames. If LRU page replacement algorithm is used, .............. number of page faults occur with the reference string.

0 2 1 3 5 4 6 3 7 4 7 3 3 5 5 3 1 1 1 7 2 3 4 1

View solution

Q. Consider a system having ‘m’ resources of the same type. These resources are shared by three processes P1, P2 and P3 which have peak demands of 2, 5 and 7 resources respectively. For what value of ‘m’ deadlock will not occur?

View solution