Question

State True or False Question Bank
Round Robin is non-preemptive Algorithm.
Short Term scheduler deals with main memory for loading process.
SJF has more Turnaround time than FCFS.
Cooperative process shares segment of code called as Critical Section.
Race condition exists when processes are running simultaneously.
Short Term scheduler deals with Secondary memory for loading process.
Counting semaphore can be implemented by using binary semaphore.
Contiguous Memory Allocation suffers External Fragmentation.
Fixed Size Partitioning suffers Internal Fragmentation.
Operating system sets an environment which is suitable to execute programs.
FCFS is non-preemptive Algorithm.
Long Term scheduler deals with main memory for loading process.
SJF has more Turnaround time than FCFS.
Cooperative process can shares segment of code.
A race condition exists when processes are running simultaneously.
Short Term scheduler deals with Secondary memory for loading process.
Counting semaphore can be implemented by using binary semaphore.
Non Contiguous Memory Allocation suffers External Fragmentation.
Variable Size Partitioning suffers Internal Fragmentation.
Operating system sets an environment which is suitable to execute programs.
​

Answer 1

true true false true false true false