1. A partitioned data set is most used for

storing program data

storing ISAM files

a program or source library

storing backup information

2. The allocation map

is used to store program data

specifies which blocks are used by which file

is updated by applications programs

allow programs to erase files

3. Path's name are

absolute path

relative path

both (a) and (b)

none of these

4. The activity of a file

is a low percentage of number of records that are added to or deleted from a file

is a measure of the percentage of existing records updated during a run

refers to how closely the files fit into the allocated space

is a measure of the number of records added or deleted from a file compassed with the original number of records

5. Which structure prohibits the sharing of flies and directories ?

tree structure

one level structure

two level structure

none of these

6. 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

7. 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

8. 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

9. 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

10. 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