Operating System

Enter 20...
View Complete Description
×

Topic Summary

Enter 20 questions
20
Questions
Question Type Legends

Easy

Medium

Difficult

Multiple Choice Questions for Operating System

  • 1 Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?
    1. Time sharing
    2. Spooling
    3. Multiprogramming
    4. Preemptive scheduling

  • 2 Which of following is not the state of the process
    1. Privilaged
    2. Blocked
    3. Running
    4. Ready

  • 3 Virtual memory is __________
    1. An extremely large main memory
    2. An extremely large secondary memory
    3. An illusion of extremely large main memory
    4. all of the above

  • 4 The collection of processes that is waiting on the disk to be brought into the memory for execution from the ______
    1. Input queue
    2. Output queue
    3. Both 1 and 2
    4. none of the above

  • 5 The problem of deadlocks can be solved by ______ method(s).
    1. Deadlock prevention
    2. Deadlock avoidance
    3. Allowing deadlock to occur, then detect and recover
    4. all of the above

  • 6 Preventing the condition of ____________ to happen, deadlocks can be prevented to happen.
    1. Critical region
    2. Circular wait
    3. Monitors
    4. none of the above

  • 7 In Resource Allocation Graph, a _________Pi --->Rj indicates that process Pi may request resource Rj at some time in the future.
    1. Request edge
    2. Claim edge
    3. Allocation edge
    4. Assignment edge

  • 8 If the system can allocate resources to each process in some order and still avoid a deadlock then it is said to be in _________ state.
    1. Safe
    2. Mutual
    3. Starvation
    4. Un-Safe

  • 9 __________ holds the smallest legal physical memory address for a process
    1. Limit register
    2. Index register
    3. Stack pointer register
    4. Base register

  • 10 When the address used in a program gets converted to an actual physical RAM address, it is called _____________
    1. Execution
    2. Loading
    3. Address binding
    4. Compliling

  • 11 In swapping technique of memory management the total amount transfer time is directly proportional to the __________
    1. amount of memory swapped
    2. amount of space on backing store
    3. space on main memory
    4. all of the above

  • 12 When all access and processing is done in one location, a computer system is said to be
    1. decentralized
    2. centralized
    3. networked
    4. distributed

  • 13 A thread is
    1. lightweight process where the context switching is low
    2. lightweight process where the context switching is high
    3. used to speed up paging
    4. none of the above

  • 14 A critical region is a
    1. region prone to deadlock
    2. piece of code which only one process executes at a time
    3. piece of code which only a finite number of processes execute
    4. found only in Windows NT operation system

  • 15 A page fault occurs when
    1. Page is not in memory
    2. Page is in memory
    3. Process enter block state
    4. Process is in ready state

  • 16 The operating system may perform _____________ operation to manage the memory while running a large program.
    1. Sortinig
    2. Scheduling
    3. Paging
    4. none of the above

Contact Us

support@subexpert.com
Write to Us View Help
Subject Expert Logo

Subject Expert

Learn and Evaluate

Follow Us
© 2020 - Subject Expert