Q. Consider the following page trace : 4,3, 2, 1, 4, 3, 5, 4, 3, 2, 1, 5. Percentage of page fault that would occur if FIFO page replacement algorithm is used with number of frames for the JOB m=4 will be

View solution

Q. Which of the following is scheme to deal with deadlock ?

View solution

Q. A computer system supports 32 bit virtual address as well as 32 bit physical addresses. Since the virtual address space is of same size as that of physical address space, if we want to get rid of virtual memory, which one of the following is true ?

View solution

Q. If an instruction takes ‘i’ microseconds and a page fault takes an additional ‘j’ microseconds. The effective instruction time, if on the average a page fault occurs every k instructions, is

View solution

Q. Consider the methods used by processes P1 and P2 for accessing their critical sections. The initial values of shared Boolean variables S1 and S2 are randomly assigned,

P1                                         P2
while (S1 = = S2);             while (S1 = = S2);
critical section                  critical section
S1 = S2;                              S1 = S2;

Which one of the following statements describes the properties achieved ?

View solution

Q. On a disk with 1000 cylinders (0 to 999) find the number of tracks, the disk arm must move to satisfy all the requests in the disk queue. Assume the last request service was at track 345 and the head is moving toward track 0. The queue in FIFO order contains requests for the following tracks :
123, 874, 692, 475, 105, 376
(Assume SCAN algorithm)

View solution

Q. Dijkestra banking algorithm in an operating system, solves the problem of

View solution

Q. The multiuser operating system, 20 requests are made to use a particular resource per hour, on an average the probability that no request are made in 45 minutes is

View solution

Q. The maximum amount of information that is available in one portion of the disk access arm for a removal disk pack (without further movement of the arm with multiple heads)

View solution

Q. A file organization component VSAM file is

View solution

Q. A relationship between processes such that each has some part (critical section) which must not be executed while the critical section of another is being executed, is known as

View solution

Q. How many states can a process be in ?

View solution

Q. Virtual memory is

View solution

Q. Optical storage is a

View solution

Q. WINDOWS is a …………… operating.

View solution

Q. Page making process from main memory to disk is called

View solution

Q. A Dead-lock in an Operating System is

View solution

Q. Match the following:

Set-I
(a) Disk scheduling
(b) Batch processing
(c) Time sharing
(d) Interrupt processing

Set-II
1. Round-robin
2. SCAN
3. LIFO
4. FIFO

Codes :
    (a) (b) (c) (d)

View solution

Q. ………….. synchronizes critical resources to prevent dead lock.

View solution

Q. …………….. is one of pre-emptive scheduling algorithm.

View solution