Computer Operator
Operating System – Set 3
Dear ! This is Operating System – Set 3 Quiz and it contains 50 questions.
1 / 50
1. Memory management is?
2 / 50
2. What is page stealing?
3 / 50
3. Which of following approaches do not require knowledge of the system state?
4 / 50
4. A page fault
5 / 50
5. Which command is used to see the sub-directory structure of drive?
6 / 50
6. In wildcard specification ‘?’ Is used as replacement for?
7 / 50
7. A computer communication technology that provides a way to interconnect multiple computer across short distance is?
8 / 50
8. Round robin scheduling is essentially the preemtive version of_______?
9 / 50
9. 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……?
10 / 50
10. Peer hole optimization is an example of?
11 / 50
11. A tree structured file directory system ?
12 / 50
12. What is a shell?
13 / 50
13. Find the pre-emptive scheduling algorithm from the following?
14 / 50
14. Moving process from main memory to disk is called?
15 / 50
15. Dead-lock in an Operating System is?
16 / 50
16. _______Is a high level abstraction over semaphore?
17 / 50
17. Concurrent process are?
18 / 50
18. An assembler is used to translate a program written in?
19 / 50
19. An example of a distributed OS is?
20 / 50
20. Telnet is a service that runs?
21 / 50
21. Banker’s algorithm is used for?
22 / 50
22. Which of the following treats hardware as a file system ?
23 / 50
23. The page replacement policy that suffers from balady’s anamoly is?
24 / 50
24. What is the memory 1k-640k called?
25 / 50
25. Which of the following will determine your choice of systems software for your computer?
26 / 50
26. Which of the following operating does not implement multitasking truly?
27 / 50
27. Virtual memory is…….?
28 / 50
28. A software used to create job queue is?
29 / 50
29. Resolution of externally defined sumbols is performed by?
30 / 50
30. A computer system that permits multiple users to run programs at same time ?
31 / 50
31. Which of the following algorithm suffers from the belady’s anomly?
32 / 50
32. Which directory implementation is used in most Operating System?
33 / 50
33. Which of the following commands is goven to reboot the computer?
34 / 50
34. Paging is a technique?
35 / 50
35. The number of processes completed per unit time is known as……?
36 / 50
36. A device that forwards data packet from one network to another is called a?
37 / 50
37. The mechanism that bring a page into memory only when it is needed is called?
38 / 50
38. It is not possible to have a deadlock involving only a single process. Why?
39 / 50
39. Which is not the state of the process?
40 / 50
40. FIFO scheduling is_____?
41 / 50
41. Loading’an OS from secondary memory to primary memory?
42 / 50
42. Correcting errors in a program is referred to as?
43 / 50
43. Cache memory is?
44 / 50
44. In the blocked state?
45 / 50
45. In process management, Round-Robin is essentially the pre-emptive mechanism of?
46 / 50
46. Round robin scheduling is essentially the preemptive version of_______?
47 / 50
47. The part of machine level instruction which tells the center processor what has to be done, is?
48 / 50
48. Windows is?
49 / 50
49. The bankers algorithm is used?
50 / 50
50. Size of the virtual memory depends upon?
Your score is
Restart quiz Exit
You cannot copy content of this page