Type Here to Get Search Results !

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

 

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                          

    program
    critical section
    non – critical section

ANSWER= (B) critical section

 

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

    Command resources
    Manage resources
    Provide utility

ANSWER= (B) Manage resources

 

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

    mutual exclusion
    progress
    bounded waiting

ANSWER= (A) all of the mentioned

 

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

    Hardware
    Peripheral
    Memory

ANSWER= (A) Hardware

 

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

     one
     two
    three

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?

    Operating system
    System program
    Object program

ANSWER= (B) System program

 

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

    each process is put into a queue and picked up in an ordered manner
    each process receives a number (may or may not be unique) and the one with the lowest number is served next
    each process gets a unique number and the one with the highest 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

    User Level Threads
    Kernel-Level Threads
    Both are 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.

    can
    must
    can never

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

     Multiprogramming
    Spooling
    Caching

ANSWER= (B) Spooling

 

11. In a system that does not support swapping                          

    the compiler normally binds symbolic addresses (variables) to relocatable addresses
    the compiler normally binds symbolic addresses to physical addresses
    the loader binds relocatable addresses to physical addresses

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

 

12. Context Switching and Sharing are

    Advantage of Threads
    The disadvantage of Threads
    Non-Relevant

ANSWER= (A) Advantage of Threads

 

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

    physical address
    logical address
     neither physical nor logical

ANSWER= (B) logical address

 

14. Page replacement algorithms

    FIFO algorithms
    Optimal Algorithms
    LRU

ANSWER= (D) All of the above

 

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

     physical address
    logical address
    neither physical nor logical

ANSWER= (A) physical address

 

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

    greater than the time required to create a new process
    less than the time required to create a new process
    equal to the time required to create a new process

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

 

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

    thread moves to the ready queue
    thread remains blocked
    thread completes

ANSWER= (A)  thread moves to the ready queue

 

18. If the wait for graph contains a cycle

     then a deadlock does not exist
    then a deadlock exists
    then the system is in a safe state

ANSWER= (B) then a deadlock exists

 

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

    one
    two
    three

ANSWER= ( B) two

 

20. A page fault occurs when?

    a page gives inconsistent data
    a page cannot be accessed due to its absence from memory
     a page is invisible

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                          

    disrupted
     invalid
    saved

ANSWER= (C) saved

 

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

    fork
    exec
    ioctl

ANSWER= (B)  exec

 

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

    getpid
    fork
    ioctl

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.

    wait queue
    ready queue
    cpu

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.

    context – switch
    waiting
    execution

ANSWER= (A) context – switch

 

26. If the thread pool contains no available thread                          

    the server runs a new process
    the server goes to another thread pool
     the server demands for a new pool creation

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

 

27. Thread pools help in                          

    servicing multiple requests using one thread
    servicing a single request using multiple threads from the pool
    faster servicing of requests with an existing thread rather than waiting to create a new thread

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                          

    number of cpus in the system
    amount of physical memory
    expected number of concurrent client requests

ANSWER= (A) all of the mentioned

 

29. The One to One model allows

     increased concurrency           
    decreased concurrency
     increased or decreased concurrency

ANSWER= (A) increased concurrency 

 

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

    the page is not legal
    the page is illegal
    the page is 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.

Post a Comment

0 Comments
* Please Don't Spam Here. All the Comments are Reviewed by Admin.

Top Post Ad

Below Post Ad