1. The most efficient data set organization is a/an

sequential file

ISAM file

variable depending upon the usage of the datase

a partitioned data set

2. The file structure that redefines its first record at a base of zero uses the term

relative organization

key fielding

dynamic reallocation

all of these

3. A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units, then

deadlock can never occur

deadlock may occur

deadlock has to occur

none of these

4. The methods for dealing with the deadlock problem is

Use a protocol to make sure that the system never enters in to the deadlock state.

Allow the system to enter a deadlock state and then recover.

Ignore the problem, and pretend that deadlocks never occur in the system. The UNIX operating system uses this solution.

all of these

5. Consider a system having 'm' resources of the same type. These resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur is

11

12

13

14

6. 'm' processes share 'n' resources of the same type. The maximum need of each process doesn't exceed 'n' and the sum all the their maximum needs is always less than m + n. In this set up

deadlock can never occur

deadlock may occur

deadlock has to occur

none of these

7. A computer system has 6 tape drives, with 'n' processes competing for them. Each process may need 3 tape drives. The maximum value of 'n' for which the system is guaranteed to be deadlock free is

4

3

2

1

8. A state is safe if the system can allocate resources to each process (up to its maximum) in some order and still avoid deadlock. Then

deadlocked state is unsafe

unsafe state may lead to a deadlock situation

deadlocked state is a subset of unsafe state

all of these

9. With a single resource, deadlock occurs

if there are more than two processes competing for that resource

if there are only two processes competing for that resource

if there is a single process competing for that resource

none of these

10. প্রবেশ করার ইচ্ছাকে একথায় কী বলা হয়? (GOVT. Bank. General Officer: 2019)

বিবিক্ষা

বিবিক্ত

বিবাসন

বিবর্ধন