Operating System Online exams model test2

Thank you very much for taking test

Operating System Online Test2

1. Round robin scheduling is essentially the preemptive version of ________.
FIFO	Shortest job first
Shortes remaining	Longest time first

2. A page fault occurs _____.
when the page is not in the memory	when the page is in the memory
when the process enters the blocked state	when the process is in the ready state

3. Which of the following will determine your choice of systems software for your computer ?
Is the applications software you want to use compatible with it ?	Is it expensive ?
Is it compatible with your hardware ?	Both A and C

4. Which of the following approaches do not require knowledge of the system state?
deadlock detection	deadlock prevention
deadlock avoidance	none of the above

5. What is a shell ?
It is a hardware component	It is a command interpreter
It is a part in compiler	It is a tool in CPU scheduling

6. Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called _________ .
Static loading	Dynamic loading
Dynamic linking	Overlays

7. In the blocked state ____.
the processes waiting for I/O are found	the process which is running is found
the processes waiting for the processor are found	none of the above

8. What is the memory from 1K - 640K called ?
Extended Memory	Normal Memory
Low Memory	Conventional Memory

9. Virtual memory is __________.
An extremely large main memory	An extremely large secondary memory
An illusion of extremely large main memory	A type of memory used in super computers

10. 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

11. If the Disk head is located initially at 32, find the number of disk moves required with FCFS if the disk queue of I/O blocks requests are 98,37,14,124,65,67.
310	324
315	321

12. Multiprogramming systems ________.
Are easier to develop than single programming systems	Execute each job faster
Execute more jobs in the same time	Are used only on large main frame computers

13. Which is not the state of the process ?
Blocked	Running
Ready	Privileged

14. The solution to Critical Section Problem is : Mutual Exclusion, Progress and Bounded Waiting.
The statement is false	The statement is true
The statement is contradictory	None of the above

15. The problem of thrashing is effected scientifically by ________.
Program structure	Program size
Primary storage size	None of the above

16. The state of a process after it encounters an I/O instruction is __________.
Ready	Blocked/Waiting
Idle	Running

17. The number of processes completed per unit time is known as __________.
Output	Throughput
Efficiency	Capacity

18. _________ is the situation in which a process is waiting on another process,which is also waiting on another process ... which is waiting on the first process. None of the processes involved in this circular wait are making progress.
Deadlock	Starvation
Dormant	None of the above

19. Which of the following file name extension suggests that the file is Backup copy of another file ?
TXT	COM
BAS	BAK

20. Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?
Time-sharing	SPOOLing
Preemptive scheduling	Multiprogramming