Recently MeroSpark is lunched with more features and services, now you can ask your question, sell your books, share your notes and many more. Visit now and create your account to take full advantage of MeroSpark.

Operating System | BSc.CSIT (TU) Question Paper 2071 | Third Semester

Download our Android App from Google Play Store and start reading Reference Notes Offline.

OS 2071Third Semester | Second Year | Tribhuvan University
Old Question Collection | Question Bank
Operating System, Year: 2071
Computer Science and Information Technology (CSc 203)
Full Marks: 60 | Pass Marks: 24 | Time: 3 hours

Download Question Paper File
[File Type: PDF | File Size: 412 KB | Download]

Candidates are required to give their answer in their own words as far as practicable.
The figures in the margin indicate full marks.

Section A
Attempt any two questions: (2×10=20)

  1. How thread based execution minimizes the context switching problem of process based execution? Explain the different multithreading model.
  2. What is page fault? Consider the following page reference string; 3, 3, 5, 4, 7, 1, 5, 5, 1, 4, 3, 7, 6, 3, 4, 1. How many page faults would occur for each of the following page replacement algorithms assuming 4 page frames?
    a.) LRU page replacement
    b.) FIFO page replacement
    c.) Optimal page replacement
    d.) Clock replacement
  3. Suppose the head of a moving head disk with 200 tracks, numbered 0 to 199 is currently serving request at tracks 143 and has finished a request at track 125. The queue it request is kept in the FIFO order 86, 147, 91, 177, 94, 150, 102, 175, 130. What is the total head movements needed to satisfy these request for the following disk-scheduling algorithms?
    i)FCFS     ii) SSTF      iii)SCAN      iv)LOOK
    Section B
    Attempt any eight questions: (8×5=40)
  4. How operating is as a resource manager? Explain.
  5. For each of the following transitions between the processes states, indicate whether the transition is possible. If it is possible, give an example of one thing that would cause it.
    a) Running->Ready
    b) Running->Blocked
    c) Blocked->Running
  6. Define file and directories. Explain about protection mechanism.
  7. Differentiate between internal and external fragmentation with example.
  8. What are the segmentation and paging? Why they are combined into one scheme?
  9. What is DMA. Explain how it works.
  10. What do you understand by deadlock detection and recovery? Discuss.
  11. Explain how file allocation table(FAT) manage the files. Mention the merits and demerits of using FAT.
  12. Write short notes: (Any two)
    a) Best Fit vs Worst Fit
    b) Swapping
    c) Semaphores
(Visited 718 times, 1 visits today)

Posted By : Digvijay | Comment RSS | Category : Old Question Collection, Third Semester
Tag :

Post a Comment

Your email is never published nor shared. Required fields are marked *


Wordpress DMCA
Community | Toolbar | Android App | Founder/Developer : Hari Prasad Chaudhary | CSIT Portal Manager : Digvijay Chaudhary