operating system mcq for competitive exams
1. Which operating systems are more complex than multi-programmed operating systems?
-
I/O device-sharing
Resource-sharing
Time-sharing
2. Device independence
-
Allows the computer to run without I/O devices
Allows programs to be written much more easily
Makes all devices look the same to the operating system
3. It is responsible for file and I/O management through device drivers.
-
Space subsystem
Memory subsystem
File subsystem
4. Running a system in safe mode ..............
-
prevents unauthorized access
protects the system from viruses.
loads a minimum number of drivers.
5. The jacketing technique is used to
-
convert a blocking system call into non blocking system call
create a new thread
communicate between threads
6. Which of the following options is correct about the windows operating system?
- Windows is based on character user interface (CUI)
Windows is based on command line interface (CLI)
Windows is based on graphical user interface (GUI)
7. Multithreading on a multi – CPU machine
-
has multiple threads of execution
has a single thread of execution
can have multiple or a single thread for execution
8. Selection of an operating system is known as ..................
-
Site selection
Product selection
Process selection
9. Termination of the process terminates
10. Example of open source operating system is ................
11. In the Many to Many model true concurrency cannot be gained because
12. Sector interleaving in disks is done by
13. There are two types of separate mode of operation in OS, ______ mode and ________ mode
14. Which mode bit is used to indicate kernel mode
15. What is Address Binding?
16. Which mode bit is used to indicate user mode
17. A single thread of control allows the process to perform
18. What is the objective of multiprogramming?
19. Which of the following do not belong to queues for processes?
20. Restricting the child process to a subset of the parent’s resources prevents any process from
21. A control card is a ________ system concept
22. Peterson’s algorithm is the solution of which of the following problem.
23. What is operating system?
24. CPU switching from one process to another requires saving the state of the current process and loading the latest state of the next process. This is known as a ___.
25. ___ is a part of UNIX OS.
26. PTBR stands for ___.
27. When a process is to be executed then only that page of the process, which needs to be currently executed, is swapped into memory. This method is called a ___.
28. What is the ready state of a process?
29. A _______ is a technique for passing information from one program process to another
30. Consider an address of 16 bit, with 4 bit as segment number, then maximum possible augment size is……..
Post a Comment
0 Comments