Operating Systems Quiz - AAT

20 Questions | Total Attempts: 75

SettingsSettingsSettings
Operating Systems Quiz - AAT - Quiz


Questions and Answers
  • 1. 
    When several processes access and manipulate the same data simultaneously and the result depends on particular order in which the access takes place is called
    • A. 

      Synchronization

    • B. 

      Concurrency

    • C. 

      Race Condition

    • D. 

      Inconsistency

  • 2. 
    Which of the following condition does not corresponds to critical section problem?
    • A. 

      Consistency

    • B. 

      Bounded Waiting

    • C. 

      Progress

    • D. 

      Mutual Exclusion

  • 3. 
    A semaphore variable S has a value 12. What is the value of S if the synchronization problem performs 4-P (wait) operations and 6-V (signal) operations
    • A. 

      16

    • B. 

      14

    • C. 

      18

    • D. 

      15

  • 4. 
    A semaphore in synchronization process is used for
    • A. 

      Mutual Exclusion

    • B. 

      Synchronization

    • C. 

      Resource allocation

    • D. 

      All the above

  • 5. 
    In Readers – Writers Problem for process synchronization which of the following is/are true during read. I   Any number of reader processes can enter into critical section II  Any number of writer processes can enter into critical section III First reader has to block the writer process IV Last Reader has to resume the writer process
    • A. 

      I , II and III only

    • B. 

      I, II and IV only

    • C. 

      I, III and IV only

    • D. 

       II , III and IV only

  • 6. 
    The following operation on a file does allow only erasing the contents of a file but not its attributes.
    • A. 

      Deleting a file

    • B. 

      Renaming a file

    • C. 

      Removing entry from directory

    • D. 

      Truncating a file

  • 7. 
    In which of the following directory structure Master File Directory (MFD) is maintained for every User File Directory (UFD)
    • A. 

      Single Level

    • B. 

      Two Level

    • C. 

      Tree Structured

    • D. 

      Acyclic Graph

  • 8. 
    The module which translates logical block addresses of disk to physical block addresses of disk is performed  by
    • A. 

      Basic File System

    • B. 

      Logical File System

    • C. 

      File Organization Module

    • D. 

      I/O Controller

  • 9. 
    Which of the following is not a technique for free space management?
    • A. 

      Bit Vector

    • B. 

      Linked List

    • C. 

      Counting

    • D. 

      Linear List

  • 10. 
    The file allocation method for which the directory structure uses a separate block for holding block addresses of available or free disk blocks.
    • A. 

      Contiguous allocation

    • B. 

      Linked allocation

    • C. 

      Indexed allocation

    • D. 

      Non contiguous allocation

  • 11. 
    A vertical set of all tracks at same position in a disk pack is considered as
    • A. 

      Tracks

    • B. 

      Cylinder

    • C. 

      Contiguous tracks

    • D. 

      Non contiguous tracks

  • 12. 
    The shortest seek distance among the tracks is achieved using which of the following disk scheduling algorithm.
    • A. 

      FCFS

    • B. 

      SCAN

    • C. 

      LOOK

    • D. 

      SSTF

  • 13. 
    Which of the following is not the necessary condition for a deadlock to occur?
    • A. 

      Hold and Wait

    • B. 

      Preemption

    • C. 

      Mutual Exclusion

    • D. 

      Circular Wait

  • 14. 
    The protocol which is not used in deadlock prevention?
    • A. 

      No Hold

    • B. 

      No Wait

    • C. 

      Shareable Resources

    • D. 

      No Preemption

  • 15. 
    A computer has six tape drives, with n processes competing for them. Each process may need 2 drives. What i s the maximum value of “n” for the system to be deadlock free?
    • A. 

      3

    • B. 

      4

    • C. 

      5

    • D. 

      6

  • 16. 
    For deadlock avoidance  the false statement is I  A safe sequence keeps always the system in safe state II Every unsafe state is deadlock state III    A deadlock state is always unsafe state.
    • A. 

      I

    • B. 

      II

    • C. 

      III

    • D. 

      None of the above

  • 17. 
    Wait for Graph model is used for which of the following deadlock handling method.
    • A. 

      Deadlock Prevention

    • B. 

      Deadlock Avoidance

    • C. 

      Deadlock detection

    • D. 

      Deadlock Recovery

  • 18. 
    The possible solution to recover a deadlock is
    • A. 

      Abort all deadlocked processes

    • B. 

      Resource Preemption

    • C. 

      Abort process by process

    • D. 

      All the above

  • 19. 
    The method which is not used in the implementation of Access Matrix.
    • A. 

      Global Table

    • B. 

      Capability Lists for Domains

    • C. 

      Access lists for domains

    • D. 

      Lock Key mechanism

  • 20. 
    An Access Matrix represents
    • A. 

      Set of Objects

    • B. 

      Set of Domains

    • C. 

      Set of Access rights

    • D. 

      All the above

Back to Top Back to top
×

Wait!
Here's an interesting quiz for you.

We have other quizzes matching your interest.