Nothing Special   »   [go: up one dir, main page]
Scribd Logo
Upload

Welcome to Scribd!

  • 19 views

    New Scheme: Third Semester MCA Degree Examination, July 2007

    Uploaded by

    msthenmozhi
    This document appears to be an exam for an Operating Systems course, outlining 8 potential questions on various topics: 1. Types of operating systems and operating system services 2. Process control blocks and process states 3. Deadlocks and deadlock recovery 4. Memory management techniques 5. Belady's anomaly and thrashing 6. File systems and disk scheduling algorithms 7. Components of Linux and access matrices 8. Short notes on paging, semaphores, dynamic loading, and indexed allocation

    Copyright:

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

    New Scheme: Third Semester MCA Degree Examination, July 2007

    Uploaded by

    msthenmozhi
    19 views1 page
    This document appears to be an exam for an Operating Systems course, outlining 8 potential questions on various topics: 1. Types of operating systems and operating system services 2. Process control blocks and process states 3. Deadlocks and deadlock recovery 4. Memory management techniques 5. Belady's anomaly and thrashing 6. File systems and disk scheduling algorithms 7. Components of Linux and access matrices 8. Short notes on paging, semaphores, dynamic loading, and indexed allocation

    Original Description:

    Operating System

    Original Title

    dl1240

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document appears to be an exam for an Operating Systems course, outlining 8 potential questions on various topics: 1. Types of operating systems and operating system services 2. Process control blocks and process states 3. Deadlocks and deadlock recovery 4. Memory management techniques 5. Belady's anomaly and thrashing 6. File systems and disk scheduling algorithms 7. Components of Linux and access matrices 8. Short notes on paging, semaphores, dynamic loading, and indexed allocation

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    19 views1 page

    New Scheme: Third Semester MCA Degree Examination, July 2007

    Uploaded by

    msthenmozhi
    This document appears to be an exam for an Operating Systems course, outlining 8 potential questions on various topics: 1. Types of operating systems and operating system services 2. Process control blocks and process states 3. Deadlocks and deadlock recovery 4. Memory management techniques 5. Belady's anomaly and thrashing 6. File systems and disk scheduling algorithms 7. Components of Linux and access matrices 8. Short notes on paging, semaphores, dynamic loading, and indexed allocation

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 1

    ^5

    MCA33
    USN

    NEW SCHEME
    Third Semester MCA Degree Examination, July 2007
    Operating Systems
    Time: 3 hrs.] [Max. Marks:100
    Note : I. Answer any FIVE full questions.
    2. Draw figures wherever necessary.

    a. Explain the following types of operating systems:


    i) Multiprocessor system ii) Client server system
    iii) Clustered systems iv) Desktop system.
    b. Explain operating system s ervices.

    (08 Marks)

    a. Explain process control blo ck.


    b. With the help of a state dia gram explain various states of a process.
    c. Explain multithreading mo dels.

    (06 Marks)
    (06 M arks)
    (08 Marks)

    a. What is a deadlock? What are the four conditions that cause deadlock?
    b. Explain the steps involved in recovering from a deadlock.

    (10 Marks)
    (10 M arks)

    a. With an example explain o verlay technique.


    b. Explain the following:
    i) First fit ii) Best fit iii) Worst fit.

    (10 Marks)

    (12 Marks)

    (10 Marks)

    Explain the following:


    i) Belady's anamaly ii) Thrashing.
    (08 Marks)
    b. Consider the following page reference string:
    7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2, 1, 2, 0, 1, 7, 0, 1.
    Assuming three frames, find the number of page faults when the following
    algorithms are used:
    i) LRU ii) FIFO iii) OPTIMAL.
    Note that initially all the frames are empty. (12 Marks)
    a.

    6 a. Briefly explain the following with respect to a file system:


    i) File attributes ii) File operations .
    ( 08 Marks)
    b. Consider a disk queue with requests for blocks on cylinders (0 - 199)

    98, 183 , 37, 122, 14, 124, 65, 67


    in that order. Initially disk head is at cylinder 53 and moving in the backward
    direction. Calculate the number of head movements using the following scheduling
    algorithms:
    i) FCFS ii) SSTF iii) SCAN.
    (12 Marks)
    7

    a. What are the components of LINUX system? Explain.


    b. What is access matrix? Discuss the implementation of access matrix .

    ( 10 Marks)
    (10 Marks)

    Write short notes on any four:


    a. Paging b. Semaphores
    c. Dynamic loading d. Indexed allocation.

    (20 Marks)

    You might also like