select the correct option?

• I, II, and III only

• II and III only

• I, II, and IV only

• I, II, III, and IV

Which one of the following is FALSE?

• A

• B

• C

• D

A process executes the code 

fork ( );
fork ( );
fork ( );

The total number of child processes created is

• 3

• 4

• 7

• 8

WHICH SCHEDULING IS MOST SUITABLE FOR INTERACTIVE APPLICATION?

• SRTF

• SJF

• RR

• FCFS

SELECT THE CORRECT OPTION

• 13

• 14

• 15

• 16

Which of the following process scheduling algorithm may lead to starvation

• FIFO

• ROUND ROBIN

• SHORTEST JOB NEXT

• NONE OF THE ABOVE

If the quantum time of round robin algorithm is very large, then it is equivalent to:

• FCFS

• SJF

• LOTTERY SCHEDULING

• NONE OF THE ABOVE

SELECT THE CORRECT OPTION

• This algorithm is equivalent to the first-come-first-serve algorithm

  
  

• This algorithm is equivalent to the round-robin algorithm.

  
  

• This algorithm is equivalent to the shortest-job-first algorithm..

  
  

• This algorithm is equivalent to the shortest-remaining-time-first algorithm

  
  

Which of the following statements are true?

• I only

  
  

• I and III only

  
  

• II and III only

  
  

• I, II and III

  
  

Which of the following statements is not true for Multi Level Feedback Queue processor scheduling algorithm?

• Queues have different priorities

  
  

• Each queue may have different scheduling algorithm

  
  

• Processes are permanently assigned to a queue

  
  

• This algorithm can be configured to match a specific system under design