Advanced OS

Advanced operating systems concepts covering process management, memory management, file systems, scheduling algorithms, and synchronization mechanisms.

15 Questions Published

Questions

Question 1 Multiple Choice (Single Answer)

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?

  1. Program counter
  2. Memory management information
  3. CPU scheduling information
  4. Process state
  5. CPU registers
Question 2 Multiple Choice (Single Answer)

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

  1. User mode
  2. Kernel mode
  3. Hardware
  4. PCB
  5. Scheduler
Question 3 Multiple Choice (Single Answer)

The address generated by the CPU is referred to as

  1. logical address
  2. physical address
  3. virtual address
  4. PC
  5. IR
Question 4 Multiple Choice (Single Answer)

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?

  1. Mutual exclusion
  2. Circular wait
  3. Hold and wait
  4. No preemption
  5. Critical section
Question 5 Multiple Choice (Single Answer)

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?

  1. Best fit
  2. First fit
  3. Worst fit
  4. Perfect fit
  5. Tight fit
Question 6 Multiple Choice (Single Answer)

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?

  1. Paging
  2. Compaction
  3. Segmentation
  4. Demand paging
  5. External fragmentation
Question 7 Multiple Choice (Single Answer)

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?

  1. FIFO algorithm
  2. LRU algorithm
  3. Optimal algorithm
  4. Thrashing
  5. Beladys anomaly
Question 8 Multiple Choice (Single Answer)

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?

  1. Creating a file
  2. Writing a file
  3. Repositioning within a file
  4. Truncating a file
  5. Deleting a file
Question 9 Multiple Choice (Single Answer)

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

  1. Type
  2. Location
  3. Protection
  4. Size
  5. Time date and user ID
Question 10 Multiple Choice (Single Answer)

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?

  1. Linked allocation
  2. Indexed allocation
  3. Contiguous allocation
  4. Fixed allocation
  5. Variable allocation
Question 11 Multiple Choice (Single Answer)

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

  1. Single level directory
  2. Two level directory
  3. Tree structured directories
  4. Three level directory
  5. Four level directory
Question 12 Multiple Choice (Single Answer)

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

  1. New
  2. Running
  3. Waiting
  4. Ready
  5. Terminated
Question 13 Multiple Choice (Single Answer)

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

  1. FCFS
  2. Priority scheduling
  3. Round Robin scheduling
  4. SJF scheduling
  5. Multilevel queue scheduling
Question 14 Multiple Choice (Single Answer)

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?

  1. Short term scheduler
  2. Medium term scheduler
  3. Long term scheduler
  4. Context switch
  5. CPU register
Question 15 Multiple Choice (Single Answer)

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?

  1. Monitors
  2. Semaphores
  3. Mutual exclusion
  4. Critical section
  5. Bounded waiting