Q. Consider a disk with 16384 bytes per track having a rotation time of 16 msec and average seek time of 40 msec. What is the time in msec to read a block of 1024 bytes from this disk?

View solution

Q. Match the following with respect to various memory management algorithms :

List - I                                     List - II
(a) Demand paging                 (i) degree of multiprogramming
(b) Segmentation                     (ii) working set
(c) Dynamic partitions             (iii) supports user view of memory
(d) Fixed partitions                  (iv) compaction

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

View solution

Q. Function of memory management unit is :

View solution

Q. Consider a system with twelve magnetic tape drives and three processes P1, P2 and P3. Process P1 requires maximum ten tape drives, process P2 may need as many as four tape drives and P3 may need upto nine tape drives. Suppose that at time t1, process P1 is holding five tape drives, process P2 is holding two tape drives and process P3 is holding three tape drives. At time t1, system is in:

View solution

Q. In an operating system, indivisibility of operation means :

View solution

Q. The character set used in Windows 2000 operating system is ...............

View solution

Q. The distributed system is a collection of (P) and communication is achieved in distributed system by (Q) , where (P) and (Q) are :

View solution

Q. In a paged memory management algorithm, the hit ratio is 70%. If it takes 30 nanoseconds to search Translation Look-aside Buffer (TLB) and 100 nanoseconds (ns) to access memory, the effective memory access time is

View solution

Q. Match the following:

List-I                                                               List-II
a. Multilevel feedback queue           i. Time-slicing
b. FCFS                                                 ii. Criteria to move processes between queues
c. Shortest process next                   iii. Batch processing
d. Round Robin Scheduling             iv. Exponential Smoothening

Codes:
      a    b    c    d

View solution

Q. Consider a system with five processes P0 through P4 and three resource types R1, R2 and R3. Resource type R1 has 10 instances, R2 has 5 instances and R3 has 7 instances. Suppose that at time T0, the following snapshot of the system has been taken :

Allocation R1 R2 R3 P0 0 1 0 P1 2 0 0 P2 3 0 2 P3 2 1 1 P4 0 2 2
Max R1 R2 R3 7 5 3 3 2 2 9 0 2 2 2 2 4 3 3
Available R1 R2 R3 3 3 2

Assume that now the process P1 requests one additional instance of type R1 and two instances of resource type R3. The state resulting after this allocation will be

View solution

Q. Match the following:

List-I                                                      List-II
a. Contiguous Allocation       i. This scheme supports very large file sizes.
b. Linked allocation                 ii. This allocation technique supports only sequential files.
c. Indexed allocation               iii. Number of disks required to access file is minimal.
d. Multi-level indexed                         iv. This technique suffers from maximum wastage of space in storing pointers

Codes:
      a    b    c    d

View solution

Q. Which of the following is the correct value returned to the operating system upon the successful completion of a program?

View solution

Q. Match the following:

List – I                                                   List - II
Process state transition                   Reason for transition
a. Ready→Running                           i. Request made by the process
is satisfied or an event for which
it was waiting occurs.
b. Blocked→Ready                             ii. Process wishes to wait for
some action by another process.
c. Running→Blocked                         iii. The process is dispatched.
d Running→Ready                            iv. The process is preempted.

Codes :
      a   b   c    d

View solution

Q. The hit ratio of a Translation Look Aside Buffer (TLAB) is 80%. It takes 20 nanoseconds (ns) to search TLAB and 100 ns to access main memory. The effective memory access time is ................

View solution

Q. Consider the input/output (I/O) requests made at different instants of time directed at a hypothetical disk having 200 tracks as given in the following table.

Assume that:
Current head position is at track no. 65
Direction of last movement is towards higher numbered tracks
Current clock time is 160 milliseconds
Head movement time per track is 1 millisecond.

“look” is a variant of “SCAN” disk-arm scheduling algorithm. In this algorithm, if no more I/O requests are left in current direction, the disk head reverses its direction. The seek times in Shortest Seek First (SSF) and “look” disk-arm scheduling algorithms respectively are:

View solution

Q. Consider a main memory with 3 page frames for the following page reference string :

5, 4, 3, 2, 1, 4, 3, 5, 4, 3, 4, 1, 4

Assuming that the execution of process is initiated after loading page 5 in memory, the number of page faults in FIFO and second chance replacement respectively are

View solution

Q. A virtual memory based memory management algorithm partially swaps out a process. This is an example of

View solution

Q. Assuming that the disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O block requests are 98, 37, 14, 124, 65, 67:

View solution

Q. Let the page fault service time be 10 millisecond(ms) in a computer with average memory access time being 20 nanosecond(ns). If one page fault is generated for every 106 memory accesses, what is the effective access time for memory?

View solution

Q. Match the following:

a. RAID 0          i. Bit interleaved parity
b. RAID 1          ii. Non redundant stripping
c. RAID 2           iii. Mirrored disks
d. RAID 3          iv. Error correcting codes

Codes:
      a   b   c    d

View solution