A directory of Objective Type Questions covering all the Computer Science subjects. Here you can access and discuss Multiple choice questions and answers for various compitative exams and interviews.

51. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called
a. job queue
b. ready queue
c. execution queue
d. process queue
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).ready queue

52. The interval from the time of submission of a process to the time of completion is termed as
a. waiting time
b. turnaround time
c. response time
d. throughput
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).turnaround time

53. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
a. first-come, first-served scheduling
b. shortest job scheduling
c. priority scheduling
d. none of the mentioned
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).first-come, first-served scheduling

54. 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
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).CPU is allocated to the process with highest priority

55. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of
a. all process
b. currently running process
c. parent process
d. init process
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).currently running process

56. Time quantum is defined in
a. shortest job scheduling algorithm
b. round robin scheduling algorithm
c. priority scheduling algorithm
d. multilevel queue scheduling algorithm
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).round robin scheduling algorithm

57. 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
View Answer Report Discuss Too Difficult! Search Google
Answer: (d).multilevel queue scheduling algorithm

58. 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
View Answer Report Discuss Too Difficult! Search Google
Answer: (a).a process can move to a different classified ready queue

59. CPU scheduling is the basis of ____________.
a. multiprocessor systems
b. multiprogramming operating systems
c. larger memory sized systems
d. None of these
View Answer Report Discuss Too Difficult! Search Google
Answer: (b).multiprogramming operating systems

60. An I/O bound program will typically have :
a. a few very short CPU bursts
b. many very short I/O bursts
c. many very short CPU bursts
d. a few very short I/O bursts
View Answer Report Discuss Too Difficult! Search Google
Answer: (c).many very short CPU bursts

Page 6 of 14