Scribd
Upload
62 views2 pages

OS QuestionBank 2 BCS303

Uploaded by

mohammeduzair044
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
62 views2 pages

OS QuestionBank 2 BCS303

Uploaded by

mohammeduzair044
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Channabasaveshwara Institute of Technology

(Affiliated to VTU, Belgaum & Recognized by A.I.C.T.E. New Delhi)


(NAAC Accredited & An ISO 9001:2015 Certified Institution)
NH 206, (B.H. Road), Gubbi, Tumkur – 572 216. Karnataka
Department of Computer Science & Engineering
Operating System-BCS303
ASSIGNMENT QUESTIONS-2
1. What is Deadlock? What are 4 necessary conditions for Deadlock Prevention?

2. For the following table ,Find the safe sequence using Banker’s algorithm,

Process Allocated resources Maximum Available

A B C D A B C D A B C D

P1 0 0 1 2 0 0 1 2 1 5 2 0

P2 1 0 0 0 1 7 5 0

P3 1 3 5 4 2 3 5 6

P4 0 6 3 2 0 6 5 2

P5 0 0 1 4 0 6 5 6

a) Is the system in safe state?


b) What is the need matrix content?
c) If a request from process p2(0,4,2,0) arrives can it be granted.
3. Explain resource allocation graph with example.
4. Explain 2 different approaches to recovery from Deadlock.
5. What is Paging, Explain TLB in detail with a paging system with a neat diagram.
6. Explain Structure of Page Table in detail with diagrams
7. What is thrashing? How it can be controlled.
8. What is Segmentation, Explain Segmentation Hardware in detail with diagram
9. Explain with a diagram, how TLB is used to solve the problem of simple paging scheme.
10. How Many Page Faults occur for your FIFO, LRU, Optimal algorithm for the following reference
string, with three page frames 7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1.
11. Explain Demand paging and steps involved in page fault.
12. Explain Different Directory Structure with Diagram.
13. Explain various file access methods with a neat diagram
14. Explain different File Allocation Methods in File System
15. Suppose that a disk drive has 200 cylinders, numbered 0 to 199, If the disk head is initially at
cylinder 53, the queue of pending request order is 98, 183, 37, 122, 14, 124, 65, 67. Calculate the
average disk movement for FCFS, SSTF, SCAN, C-SCAN & LOOK Disk Scheduling
Algorithms.
16. Explain Access Matrix in detail

You might also like