CS604P Final Term Live Quiz by Miss Mehwish

CS604p · Final Term (Live Quiz) · Past Papers for Mids./Finals are also Available · Subject Code: CS604P - Operating Systems (Practical)

Q1. In Disk Free Space Management by using bit map and bit vector each block is represented by ___________.

4 bits

2 bits

1 bit. ✅

3 bits

Q2. In Disk Free Space management free space list is implemented as a ___________.

Q3. Overhead of Bit-Map in Free-Space Management is calculated as:

overhead = (diskSize / blockSize) ✅

overhead = (diskSize / bit-vactorSize)

overhead = (fileSize / blockSize)

overhead = (diskSize / freespaceSize)

Q4. In the following declaration of two dimensional integer array:

int A[1024][1024];

1024x 1024

1024 ✅

Q5. Two-dimensional array can be traversed in column major order if it is traversed _______wise.

hash

diagonal

column ✅

row

1. Suppose there are 16 number of pages so number of bits needed for p is:

o O

o O O

o O O O

o 4 ✔

2. The address seen by memory unit i.e. the address loaded into the memory address register is o

o

o

o

3. In Banker algorithm Max data structure is used. If, then process Pi can request maximum k instances of resource type Rj.

o Max[i][k] = j

o

Max[i][j] = k ✔

o Max[i][j] = l

o Max[i][j] = m

4. A process must enter the maximum number of instances that he may need in the future.

o

o College algorithm

o

Banker algorithm ✔

o University algorithm

5. Logical Address generated by the CPU is divided into two parts: a page number (p) and a page offset (d) and is calculated by following formula:

o p/d

o

p + d ✔

o pt + d

o p - d

1. In a process must enter the maximum number of instances that he may need in the future.

o College algorithm

o University algorithm

o ✅ Banker algorithm