Sail E0 Webinar

MCQs

Total Questions : 36 | Page 3 of 4 pages
Question 21. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
  1.    first-come, first-served scheduling
  2.    shortest job scheduling
  3.    priority scheduling
  4.    none of the mentioned
 Discuss Question
Answer: Option A. -> first-come, first-served scheduling


None.


Question 22. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of:
  1.    all process
  2.    currently running process
  3.    parent process
  4.    init process
 Discuss Question
Answer: Option B. -> currently running process


None.


Question 23. In multilevel feedback scheduling algorithm:
  1.    a process can move to a different classified ready queue
  2.    classification of ready queue is permanent
  3.    processes are not classified into groups
  4.    none of the mentioned
 Discuss Question
Answer: Option A. -> a process can move to a different classified ready queue


None.


Question 24. Time quantum is defined in:
  1.    shortest job scheduling algorithm
  2.    round robin scheduling algorithm
  3.    priority scheduling algorithm
  4.    multilevel queue scheduling algorithm
 Discuss Question
Answer: Option B. -> round robin scheduling algorithm


None.


Question 25. Process are classified into different groups in:
  1.    shortest job scheduling algorithm
  2.    round robin scheduling algorithm
  3.    priority scheduling algorithm
  4.    multilevel queue scheduling algorithm
 Discuss Question
Answer: Option D. -> multilevel queue scheduling algorithm


None.


Question 26. Which one of the following can not be scheduled by the kernel?
  1.    kernel level thread
  2.    user level thread
  3.    process
  4.    none of the mentioned
 Discuss Question
Answer: Option B. -> user level thread


None.


Question 27. The switching of the CPU from one process or thread to another is called :
  1.    process switch
  2.    task switch
  3.    context switch
  4.    All of these
 Discuss Question
Answer: Option D. -> All of these


None.


Question 28. Scheduling is done so as to :
  1.    increase the throughput
  2.    decrease the throughput
  3.    increase the duration of a specific amount of work
  4.    None of these
 Discuss Question
Answer: Option A. -> increase the throughput


None.


Question 29. Dispatch latency is :
  1.    the speed of dispatching a process from running to the ready state
  2.    the time of dispatching a process from running to ready state and keeping the CPU idle
  3.    the time to stop one process and start running another one
  4.    None of these
 Discuss Question
Answer: Option C. -> the time to stop one process and start running another one


None.


Question 30. Turnaround time is :
  1.    the total waiting time for a process to finish execution
  2.    the total time spent in the ready queue
  3.    the total time spent in the running queue
  4.    the total time from the completion till the submission of a process
 Discuss Question
Answer: Option D. -> the total time from the completion till the submission of a process


None.


Latest Videos
Chapter 1 - GLOBAL STEEL SCENARIO & INDIAN STEEL INDUSTRY Part 1 : (13-04-2024) INDUSTRY AND COMPANY AWARENESS (ICA)
Direction Sense Test Part 1 Reasoning (Hindi)
Chapter 1 - RMHP / OHP / OB & BP Part 1 : (14-02-2024) GPOE
Cube & Cuboid Part 1 Reasoning (Hindi)
Data Interpretation (DI) Basic Concept Reasoning (Hindi)
Counting Figures Part 1 Counting Of Straight Lines Reasoning (Hindi)
Sail E0 free webinar Webinars
Real Numbers Part 7 Class 10 Maths
Real Numbers Part 1 Class 10 Maths
Polynomials Part 1 Class 10 Maths

Latest Test Papers

DSP Combined 1 Free Revision Test SAIL JO E-0
GPOE / GPA Combined 1 Free Revision Test SAIL JO E-0
BSP Plant Specific Review Test SAIL JO E-0
BSL Combined 1 Free Revision Test SAIL JO E-0
GFM Combined 1 Free Revision Test SAIL JO E-0