Sunday, August 2

Operating System - I

Multiple Choice Questions in Operating System:

1. Which of the following is an example of a SPOOLED device?
a. The terminal used to enter the input data for a program being executed
b. The secondary memory device in virtual memory system
c. A line printer used to print the output of a number of jobs
d. None of the above

2. concurrent process are :
a. process that do not overlap in time
b. process that overlap in time
c. processes that executed by a processor at the same time
d. none of the above

3. The only state transition that is initiated by the user process itself is
a. Block
b. Dispatch
c. Wakeup
d. None of the above

4. which of the following are real time operating system
a. an on-line railway reservation system
b. a process control system
c. aircraft control system
d. payroll processing system

5. Critical region is
a. A part of the operating system which is not allowed to be accessed by any process
b. A set of instructions that access common shared resource which exclude one another in time
c. The portion of the main memory which can be accessed only by one process at a time
d. None of the above

6. in a time sharing operating system, when the time slot given to a process is completed, the process goes from running state to the
a. BLOCKED state
b. READY state
c. SUSPENDED state

7. At a particular time, the value of a counting semaphore is 10. It will become 7 after
a. 3 V operations
b. 3 P operations
c. 5 V operations and 2 P operations
d. 13 P operations and 10 V operations

8. Supervisor call
a. is a call made by the supervisor of the system
b. is a call with control function
c. are privileged calls that are used to perform resource management functions, which are controlled by the operating system
d. is a call made by some one working in a root directory

9. Semaphores are used to solve the problem of
a. Race condition
b. Process synchronization
c. Mutual exclusion
d. None of the above

10. At a particular time of computation, the value of a counting semaphore is 7. Then 20 P operations and ‘x’ V operations were completed on this semaphore. If the final value of the semaphore is 5, x will be
a. 15
b. 22
c. 18
d. 13

11. Pre-emptive scheduling is the strategy of the temporarily suspending a running process
a. Before the CPU time slice expires
b. To allow starving process to run
c. When it requests I/O
d. None of the above

12. Mutual exclusion problem occurs between
a. Two disjoint process that do not interact
b. Process that share resources
c. Process that do not use the same resources
d. None of the above

13. Memory protection is no use in a
a. Single user system
b. Non-multiprogramming system
c. Non-multitasking system
d. None of the above

14. Some computer system supports dual mode operation- the user mode and the supervisor or monitor mode. These refers to the modes
a. by which user program handle their data
b. by which the operating system execute user programs
c. in which the processor and the associates hardware operate
d. of memory access

15. Fence register is used for
a. CPU protection
b. Memory protection
c. File protection
d. All of the above

16. Which of the following is a service not supported by the operating system?
a. Protection
b. Accounting
c. Compilation
d. I/O operation

17. In round robin CPU scheduling, as the quantum is increased, the average turn around time
a. increases
b. decreases
c. remains constant
d. varies irregularly

18. In a multiprogramming environment,
a. the processor executes more than one process at a time
b. the programs are developed by more than one person
c. more than one process is resident in the memory
d. a single user can execute many programs in the same time

19. In which of the following scheduling policies does context switching never take place?
a. Round-robin
b. SJF
c. Pre-emptive

20. suppose that a process is in ‘BLOCKED’ state waiting for some I/O service. When the service is completed, it goes to the
a. RUNNING state
b. READY state
c. SUSPENDED state

21. For implementing a multiprogramming operating system,
a. Special support from processor is essential
b. Special support form is not essential
c. Cache memory must be available
d. More than one processor must be available

22. Distributed system should
a. meet prescribed time constraints
b. aim better resource sharing
c. aim better system utilization
d. aim low system overhead

23. In real time operating system, which of the following is most suitable scheduling scheme?
a. Round-robin
c. Pre-emptive scheduling
d. Random scheduling

24. Memory protection is normally done by
a. the processor and associated hardware
b. the operating system
c. the compiler
d. the user program

25. Which of the following scheduling algorithms gives minimum average waiting time
b. SJF
c. Round-Robin
d. Priority

26. Which of the following scheduling policy is well suited for a time sharing operating system
a. SJF
b. Round-robin
d. Priority

27. Which of the following is well suited for batch processing?
a. Process Control
b. Video game control
c. Preparing pay bills of employees
d. Preparing mailing addresses


1 comment:

gudiya said...

where is the answers?????????