Operating System Mcq [SET - 12] | Operating System Mcqs for Placement

 

1. What is a short-term scheduler ?

A) It selects which process has to be brought into the ready queue
B) It selects which process has to be executed next and allocates CPU
C) It selects which process to remove from memory by swapping
D) None of these

ANSWER= (B) It selects which process has to be executed next and allocates CPU

 

2. The run-time mapping from virtual to physical addresses is done by a hardware device called

A) Process Management Unit
B) CPU Management Unit
C)  Memory Management Unit
D)  Event Management Unit

ANSWER= (C) Memory Management Unit

 

3. System level security is offered by the ____ in a multi-user environment.

A)  code
B) password
C) name
D) secret code

ANSWER= (B) password

 

4.In deadlock,only one process at a time can use the resource,this condition is called

A) Single exclusion
B) Exclusive exclusion
C) Smart exclusion
D)  Mutual exclusion

ANSWER= (D) Mutual exclusion

 

5. Which one operation signifies that the transaction has terminated its execution

A) Commit
B) Abort
C) Hang
D) Modify

ANSWER= (A) Commit

 

6. What is a medium-term scheduler ?

A) It selects which process has to be brought into the ready queue
B) It selects which process has to be executed next and allocates CPU
C) It selects which process to remove from memory by swapping
D) None of these

ANSWER= (C) It selects which process to remove from memory by swapping

 

7. What is a long-term scheduler ?

A) It selects which process has to be brought into the ready queue
B) It selects which process has to be executed next and allocates CPU
C) It selects which process to remove from memory by swapping
D) None of these

ANSWER= (A) It selects which process has to be brought into the ready queue

 

8. Which of the following is an efficient method of cache updating?

A)  snoopy writes
B) write through
C) write within
D) buffered write

ANSWER= (A) snoopy writes

 

9. Which one is a major problem with priority scheduling algorithm

A) Restriction
B) Timing
C) Starvation
D) Differentiation

ANSWER= (C) Starvation

 

10. Which of the following is not a write policy to avoid Cache Coherence?

A)  write through
B)  write within
C) write back
D) buffered write

ANSWER= (B) write within

 

11. A solution to the problem of starvation of low-priority processes is

A) Aging
B) Deadlock
C)  Scheduling
D) Priority

ANSWER= (A) Aging

 

12. When the data at a location in cache is different from the data located in the main memory, the cache is called                            

A) unique
B) inconsistent
C) variable
D) fault

ANSWER= (B)  inconsistent

 

13. Two general approaches are used to handle critical sections in operating systems which are preemptive and nonpreemptive ________

A) user
B) kernels
C) pipes
D) memory

ANSWER= (B) kernels

 

14.LRU stands for                        

A)  low rate usage
B) least rate usage
C) least recently used
D) low required usage

ANSWER= (C) least recently used

 

15. The value of a binary semaphore can range between

A) 0 and 1
B)  -1 and 1
C) 1 and 2
D) 0 and 2

ANSWER= (A) 0 and 1

 

16. Binary semaphores are also known as

A) Simple locks
B) Boolean locks
C) Mutex locks
D) Simplex lock

ANSWER= (C) Mutex locks

 

17. Whenever the data is found in the cache memory it is called as                    

A) hit
B) miss
C)  found
D) error

ANSWER= (A)  hit

 

18. Which of the following scheduler reduces the degree of multiprogramming?

A)  Long-term scheduler
B) Short-term scheduler
C) mid-term scheduler
D) none of the above

ANSWER= (C) mid-term scheduler

 

19.  Which of the following is the solution of priority inversion problem?

A) Kill the higher-priority process
B) Kill the lower-priority process
C)  priority-inheritance protocol
D) semaphore

ANSWER= (C)  priority-inheritance protocol

 

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
D) Terminated state

ANSWER= (B) Ready state

 

21. Which one of the following is the address generated by CPU?

A) physical address
B) absolute address
C) logical address
D) none of the mentioned

ANSWER= (C) logical address

 

22. Swapping

A) Works best with many small partitions
B) Allows many programs to use memory simultaneously
C) Allows each program in turn to use the memory
D) Does not work with overlaying

ANSWER= (C) Allows each program in turn to use the memory

 

23. ____ mechanism was created, which allowed transferring data to and from memory without the intervention of the CPU.

A) Driver Monitor Access
B) Driver Memory Access
C)  Direct Monitor Access
D) Direct Memory Access

ANSWER= (D) Direct Memory Access

 

24. What is thrashing?

A) A high paging activity is called thrashing.
B) A high executing activity is called thrashing
C) A extremely long process is called thrashing
D) A extremely long virtual memory is called thrashing

ANSWER= (A) A high paging activity is called thrashing.

 

25.Which process can be affected by other processes executing in the system?

A) cooperating process
B) child process
C) parent process
D) init process

ANSWER= (A) cooperating process

 

26. When several processes access the same data concurrently and the outcome of the execution depends on the particular order in which the access takes place, is called?

A) dynamic condition
B) race condition
C) essential condition
D) critical condition

ANSWER= (B) race condition

 

27. By operating system, the resource management can be done via

A) time division multiplexing
B) space division multiplexing
C) both (a) and (b)
D) none of the mentioned

ANSWER= (C) both (a) and (b)

 

28. The OS in IBM 370 is based on the ___ approach.

A)  Kernel
B) Virtual Machine
C) Layered
D) None of the above

ANSWER= (B) Virtual Machine

 

29. A monitor is a module that encapsulates

A) shared data structures
B)  procedures that operate on shared data structure
C) synchronization between concurrent procedure invocation
D) all of the mentioned

ANSWER= (D) all of the mentioned

 

30. The number of bytes read during the last read is known as _______ bytesRead

A) HANDLE
B)  DWORD
C) LPDWORD
D)  LPOVERLAPPED

ANSWER= (C) LPDWORD

Friends if you like this post,kindly comment bellow and do share your responce.Thank You for Visiting.