Start
Q1
Question 1: __________ is used in real time operating systems.
Non-preemptive scheduling
Preemptive scheduling
Dispatching scheduling
FCFS scheduling
Q2
Question 2: Main memory is __________ memory.
Volatile memory
Non-volatile
Permanent
Virtual
Q3
Question 3: The process related to process control, file management, device management, information about system and communication that is requested by any higher level language can be performed by __________.
Editors
Compilers
System Call
Caching
Q4
Question 4: First-Come, First-Served (FCFS) is a __________ scheduling algorithm.
preemptive
non-preemptive
both preemptive and non- preemptive
none of the given options
Q5
Question 5: An optimal scheduling algorithm in terms of minimizing the average waiting time of a given set of processes is __________.
FCFS scheduling algorithm
Round robin scheduling algorithm
Shortest job - first scheduling algorithm
None of the above
Q6
Question 6: Deadlocks can be described more precisely in terms of a directed graph called a system __________
Directed graph
Critical path
Resource allocation graph
Mixed graph
Q7
Question 7: Which type of operating system guarantees that critical tasks must be completed on time?
Timesharing system
Multitasking system
Batch system
Realtime system
Q8
Question 8: In __________, the library files are linked at load time.
Static linking
Dynamic linking
Q9
Question 9: The nice value helps in assigning __________ to a process.
Priority
Weight
Time
Scheduling
Q10
Question 10: __________ is a virtual directory in Linux and Unix.