System Administrator 2026
Attempt This Past Paper
In priority scheduling algorithm ____________
  • A. Cpu is allocated to the process with highest priority
  • B. Cpu is allocated to the process with lowest priority
  • C. Equal priority processes can not be scheduled
  • D. None of the mentioned
Process are classified into different groups in ____________
  • A. Shortest job scheduling algorithm
  • B. Round robin scheduling algorithm
  • C. Priority scheduling algorithm
  • D. Multilevel queue scheduling algorithm
In multilevel feedback scheduling algorithm ____________
  • A. A process can move to a different classified ready queue
  • B. Classification of ready queue is permanent
  • C. Processes are not classified into groups
  • D. None of the mentioned
What is Address Binding?
  • A. Going to an address in memory
  • B. Locating an address with the help of another address
  • C. Binding two addresses together to form a new address in a different memory space
  • D. A mapping from one address space to another
Binding of instructions and data to memory addresses can be done at ____________
  • A. Compile time
  • B. Load time
  • C. Execution time
  • D. All of the mentioned
If the process can be moved during its execution from one memory segment to another, then binding must be ____________
  • A. Delayed until run time
  • B. Preponed to compile time
  • C. Preponed to load time
  • D. None of the mentioned
What is Dynamic loading?
  • A. Loading multiple routines dynamically
  • B. Loading a routine only when it is called
  • C. Loading multiple routines randomly
  • D. None of the mentioned