Which of the following sets of information stored in Process Control Block contains information about process priorities, pointer to scheduling queues and other scheduling parameters?

Which of the following modes of UNIX kernel consists of components like system call, file subsystem, process control subsystem and hardware control?

The address generated by the CPU is referred to as

Which of the following conditions required for a deadlock situation states that the resources cannot be preempted, i.e. a resource is released only by the process that is holding it?

Which of the following memory allocation methods in job scheduling is the one that allocates the smallest hole that is big enough to hold the process?

Which of the following methods used in memory management is the one in which relocation of processes in memory takes place, so that fragmented holes are converted into one contiguous hole in the memory?

Which of the following page replacement algorithms produces the lowest page fault rate of all the algorithms and is used to replace the page that will not be used for the longest period of time to come?

Which of the following operations on file is the one in which file attributes remain the same, but the file has a reduced size because a user deletes information in the file?

Which of the following attributes of a file contains control information for user access?

Which of the following allocation methods of disk space is the one which requires a file to occupy contiguous blocks on the disk and because of this constraint, disk access time is reduced?

Which of the following directory structures in the file system is the one in which all files reside in one and the same directory?

Which of the following states of a process indicates that the process has finished execution?

Which of the following scheduling algorithms is basically a preemptive scheduling algorithm designed for time-sharing systems?

Which of the following types of schedulers executes less frequently because new processes are not created at the same pace at which the processes need to be executed?

Which of the following synchronisation tools used in an operating system is a classic method for restricting access to shared resources in a multiprocessing environment?