Q. Which of following is not an advantage of multiprogramming ?

View solution

Q. Spooling is most beneficial where

View solution

Q. Which scheduling policy is most suitable for time shared operating system ?

View solution

Q. Belady anomaly occurs in ?

View solution

Q. Which among following scheduling algorithms give minimum average waiting time

View solution

Q. In which scheduling policies, context switching never takes place

View solution

Q. Dispatcher function is to

View solution

Q. Shortest Job First executes first the job

View solution

Q. Creating a job queue is a function of

View solution

Q. Poor response times are caused by

View solution

Q. Which is non pre-emptive

View solution

Q. Which module gives control of the CPU to the process selected by the short-term scheduler?

View solution

Q. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called

View solution

Q. The interval from the time of submission of a process to the time of completion is termed as

View solution

Q. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?

View solution

Q. In priority scheduling algorithm

View solution

Q. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of

View solution

Q. Time quantum is defined in

View solution

Q. Process are classified into different groups in

View solution

Q. In multilevel feedback scheduling algorithm

View solution