Operating System Mcq [SET - 17] | Operating System Mcq with Answers pdf

 

1. The segment of code in which the process may change common variables, update tables, write into files is known as                          

A) program
B) critical section
C) non – critical section
D) synchronizing

ANSWER= (B) critical section

 

2. The primary job of the operating system of a compute is to

A) Command resources
B) Manage resources
C) Provide utility
D) Be user friendly

ANSWER= (B) Manage resources

 

3. Which of the following conditions must be satisfied to solve the critical section problem?

A) mutual exclusion
B) progress
C) bounded waiting
D) all of the mentioned

ANSWER= (A) all of the mentioned

 

4. The operating system of a computer serves as a software interface between the user and

A) Hardware
B) Peripheral
C) Memory
D) Screen

ANSWER= (A)  Hardware

 

5. A minimum of   variable(s) is/are required to be shared between processes to solve the critical section problem.

A)  one
B)  two
C) three
D) four

ANSWER= (B)  two

 

6. What is the name of the system which deals with the running of the actual computer and not with the programming problems?

A) Operating system
B) System program
C) Object program
D) Source program

ANSWER= (B) System program

 

7. In the bakery algorithm to solve the critical section problem                          

A) each process is put into a queue and picked up in an ordered manner
B) each process receives a number (may or may not be unique) and the one with the lowest number is served next
C) each process gets a unique number and the one with the highest number is served next
D) each process gets a unique number and the one with the lowest number is served next

ANSWER= (B)  each process receives a number (may or may not be unique) and the one with the lowest number is served next

 

8. There are types of threads

A) User Level Threads
B) Kernel-Level Threads
C) Both are threads
D) System-Level Threads

ANSWER= (C) Both are threads

 

9. If binding is done at assembly or load time, then the process be moved to different locations after being swapped out and in again.

A) can
B) must
C) can never
D) may

ANSWER= (C) can never

 

10. The process of transferring data intended for a peripheral device into a disk (or intermediate store) so that it can be transferred to peripheral at a more convenient time or in bulk, is known as

A)  Multiprogramming
B) Spooling
C) Caching
D) Virtual programming

ANSWER= (B) Spooling

 

11. In a system that does not support swapping                          

A) the compiler normally binds symbolic addresses (variables) to relocatable addresses
B) the compiler normally binds symbolic addresses to physical addresses
C) the loader binds relocatable addresses to physical addresses
D) binding of symbolic addresses to physical addresses normally takes place during execution

ANSWER= (A) the compiler normally binds symbolic addresses (variables) to relocatable addresses

 

12. Context Switching and Sharing are

A) Advantage of Threads
B) The disadvantage of Threads
C) Non-Relevant
D) None of the above

ANSWER= (A) Advantage of Threads

 

13. The address generated by the CPU is referred to as                          

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

ANSWER= (B) logical address

 

14. Page replacement algorithms

A) FIFO algorithms
B) Optimal Algorithms
C) LRU
D) All of the above

ANSWER= (D) All of the above

 

15. The address loaded into the memory address register of the memory is referred to as                       

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

ANSWER= (A) physical address

 

16. The time required to create a new thread in an existing process is                        

A) greater than the time required to create a new process
B) less than the time required to create a new process
C) equal to the time required to create a new process
D) none of the mentioned

ANSWER= (B)  less than the time required to create a new process

 

17. When the event for which a thread is blocked occurs?

A) thread moves to the ready queue
B) thread remains blocked
C) thread completes
D) a new thread is provided

ANSWER= (A)  thread moves to the ready queue

 

18. If the wait for graph contains a cycle

A)  then a deadlock does not exist
B) then a deadlock exists
C) then the system is in a safe state
D) either deadlock exists or system is in a safe state

ANSWER= (B) then a deadlock exists

 

19. If no frames are free,    page transfer(s) is/are required.

A) one
B) two
C) three
D) four

ANSWER= ( B) two

 

20. A page fault occurs when?

A) a page gives inconsistent data
B) a page cannot be accessed due to its absence from memory
C)  a page is invisible
D)  all of the mentioned

ANSWER= (B)  a page cannot be accessed due to its absence from memory

 

21. When a page fault occurs, the state of the interrupted process is                          

A) disrupted
B)  invalid
C) saved
D) none of the mentioned

ANSWER= (C) saved

 

22. Which of the following system calls transforms executable binary file into a process?

A) fork
B) exec
C) ioctl
D) longjmp

ANSWER= (B)  exec

 

23. Which of the following calls never returns an error?

A) getpid
B) fork
C) ioctl
D) open

ANSWER= (A) getpid

 

24. The consists of all processes whose memory images are in the backing store or in memory and are ready to run.

A) wait queue
B) ready queue
C) cpu
D) secondary storage

ANSWER= (B) ready queue

 

25. The    time in a swap out of a running process and swap in of a new process into the memory is very high.

A) context – switch
B) waiting
C) execution
D) all of the mentioned

ANSWER= (A) context – switch

 

26. If the thread pool contains no available thread                          

A) the server runs a new process
B) the server goes to another thread pool
C)  the server demands for a new pool creation
D) the server waits until one becomes free

ANSWER= (D)  the server waits until one becomes free

 

27. Thread pools help in                          

A) servicing multiple requests using one thread
B) servicing a single request using multiple threads from the pool
C) faster servicing of requests with an existing thread rather than waiting to create a new thread
D) none of the mentioned

ANSWER= (C) faster servicing of requests with an existing thread rather than waiting to create a new thread

 

28. The number of the threads in the pool can be decided on factors such as                          

A) number of cpus in the system
B) amount of physical memory
C) expected number of concurrent client requests
D)  all of the mentioned

ANSWER= (A) all of the mentioned

 

29. The One to One model allows

A)  increased concurrency           
B) decreased concurrency
C)  increased or decreased concurrency
D) concurrency equivalent to other models

ANSWER= (A) increased concurrency 

 

30. The valid – invalid bit, in this case, when valid indicates?

A) the page is not legal
B) the page is illegal
C) the page is in memory
D) the page is not in memory

ANSWER= (A) the page is in memory

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