6. Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.

7. In analyzing the compilation of PL/I program, the term "Lexical analysis" is associated with

8. What will happen when a process terminates?

9. Which of the following systems software does the job of merging the records from two files into one?

10. How does the software trigger an interrupt?

11. To avoid the race condition, the number of processes that may be simultaneously inside their critical section is

12. The model in which one kernel thread is mapped to many user-level threads is called ___________

13. Which one of the following is not shared by threads?

14. A system program that sets up an executable program in main memory ready for execution is

15. A non-relocatable program is one which

16. An asynchronous call ____________

17. Page stealing

18. Which of the following system calls does not return control to the calling point, on termination?

19. The address of the next instruction to be executed by the current process is provided by the __________

20. What is the name given to the organized collection of software that controls the overall operation of a computer?

21. An un-interruptible unit is known as ____________

22. In real time operating system ____________

23. Fork is

24. The major difference between a multimedia file and a regular file is ___________

25. Which is the most optimal scheduling algorithm?