Scribd Logo
Upload

Welcome to Scribd!

  • 2 views

    QuestionbankOS

    Uploaded by

    harshkum766

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    QuestionbankOS

    Uploaded by

    harshkum766
    2 views6 pages

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    2 views6 pages

    QuestionbankOS

    Uploaded by

    harshkum766

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 6

    Question Bank 1

    Subject : Operating System

    Q1. What is an Operating System(OS)? Explain functions of OS.

    Q2. What is multiprogramming and how it is different from multiprocessing?

    Q3. Define the essential properties of the following types of OS :

    a) Batch

    b) Multiprogrammed

    c) Time sharing

    d) Parallel systems

    e) Distributed systems

    f) Personal-computer systems.

    g) Real Time Systems

    Q4. Discuss the role of OS as a resource manager.

    Q5. What is page replacement policy? Why do we need it?

    Q6. What is Belady’s anomaly? In which of the following page replacement policies,

    Belady’s anomaly may occur :

    FIFO

    LRU

    Optimal.

    Q7. Consider the following reference string 1,2,3,4,1,2,5,1,2,3,4,5.

    Find the page faults using FIFO, LRU and optimal page replacement algorithms.

    Q8. What is fragmentation? How do we solve the problem of fragmentation?

    Q9. Describe paging and segmentation in detail with the help of suitable example(s).

    Q10. Differentiate between :

    a) Hard real time and soft real time systems


    b) GUI and CUI
    c) Logical address and physical address
    d) Paging and Segmentation
    e) Dynamic Loading and Dynamic Linking

    Q11. Write short notes on the following :

    a) Contiguous memory allocation


    b) Page replacement algorithms
    c) Dynamic Partitioning
    d) Compaction
    e) Segmentation with Paging.
    f) Demand Paging
    g) Virtual Memory
    h) TLB

    Q12. Define the term Overlays with suitable example.

    Q13. Why are page sizes always powers of 2?

    Q14. Describe the address binding performed by OS.

    Q15. Consider a logical address space of 64 pages of 1024 words each, mapped onto a physical
    memory of 32 frames.

    a) How many bits are there in logical address?

    b) How many bits are there in physical address?

    Q16. What is the cause of thrashing? How does the system detect Thrashing, what can the system do
    to eliminate this problem?

    Q17. Compare best fit, first fit and worst fit techniques with example.

    Unit II

    Q1. Define the term process?

    Q2. What is a Process Control Block (PCB) ?


    Q3. What are the different stages that a process goes through ?

    Q4. What is scheduling and why is it required?

    Q5. Explain the architecture for scheduling queue?

    Q6. Write short notes on:

    (a) Context switching

    (b) Semaphores

    (c) Operations on processes

    (d) IPC (Inter Process Communication)

    (e) MFQ ( Multi Level Feedback Queue)

    Q7. What are the various scheduling algorithms? Explain in detail

    Q8. Explain the term Process Synchronization.

    Q9. Explain:

    (a) Critical Section Problem

    (b) Dekkers Algorithm

    (c) Monitor Ring Bufer

    Q10. What are the solution to synchronization?

    Q11. What are the classical problems faced due to synchronization.

    Q12. Is there any kind of problem faced due to usage of Semaphore ? Explain

    Q13. Explain the difference between short term, medium term and long term scheduling?

    Unit III
    Q1.What is the reusable resource?

    Q2. What is a deadlock? Which are the conditions required for deadlock to be possible?

    Q3. What do you understand by a safe state?

    Q4. Explain the mathematical format to find out the occurrence of a deadlock?
    Q5. What is a circular wait condition? How it can be prevented?

    Q6. What is the drawback of banker’s algorithm?

    Q7. A problem encountered in multitasking when a process is perpetually denied necessary resources is
    called?

    Q8. A system has 12 magnetic tape drives and 3 processes : P0, P1, and P2. Process P0 requires
    10 tape drives, P1 requires 4 and P2 requires 9 tape drives.

    Process
    P0
    P1
    P2

    Maximum needs (process-wise : P0 through P2 top to bottom)


    10
    4
    9

    Currently allocated (process-wise)


    5
    2
    2

    Determine the safe sequence ?

    Q9. When the wait for graph deadlock detection algorithm is applicable?

    Q10. A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process
    may need 3 tape drives. What will be the maximum value of ‘n’ for which the system is
    guaranteed to be deadlock free ?

    Q11. How the deadlock can be avoided?

    Q12. How the deadlock condition can be prevented?

    Q13.What must be done to ensure that the hold and wait condition never occurs in the system?

    Q14. Write a short note on:

    (a) Input Output Devices


    (b) Storage Devices
    (c) Secondary storage structure
    (d) Bad blocks
    (e) RAID
    Q15. What are the various disk scheduling algorithms? Explain.

    Q16. What is disk reliability?

    Q17. What do you understand by swap space management?

    Q18. What are the problems generated due to RAID?

    Unit IV
    Q1. What is a file? Explain its architecture?

    Q2. What is general model of a file system?

    Q3. What do you understand by Access control verification?

    Q4. Compare logical file system and physical file system.

    Q5. What are the attributes of a file?

    Q6. What are the different types of files? Explain their structure.

    Q7. What are the various file access methods? Explain


    Q8. What is a directory? How is directory structure different from that of file structure?

    Q9. What are the various types of directory structures?

    Q10. What is an acyclic graph directory? How does it vary from a tree structure directory?

    Q11. What are the goals of protection of a graph directory?

    Q12. What are access rights for the protection of directory?

    Q13. Why do we need authentication? How is that achieved?

    Q14. Explain the various file access techniques

    Q15. What are system threats? How are they harmful?

    Q16. What is encryption, how does it help in data protection?

    Q17. What is file allocation table?

    You might also like