Scribd
Upload
15 views3 pages

OS Assignmrnt 2 OS

The document outlines an assignment for the Operating System course at Bapurao Deshmukh College of Engineering for the academic year 2024-25. It includes various topics such as file allocation methods, free space management, multithreading, deadlock prevention, CPU scheduling, and disk scheduling algorithms. Additionally, it presents specific problems related to process scheduling and memory management concepts.

Uploaded by

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

OS Assignmrnt 2 OS

The document outlines an assignment for the Operating System course at Bapurao Deshmukh College of Engineering for the academic year 2024-25. It includes various topics such as file allocation methods, free space management, multithreading, deadlock prevention, CPU scheduling, and disk scheduling algorithms. Additionally, it presents specific problems related to process scheduling and memory management concepts.

Uploaded by

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

Bapurao Deshmukh College of Engineering,Sewagram

Department of Computer Engineering


Academic Year: 2024-25
Assignment-2

Subject: Operating System


Course Code: BECME403T Semester: 4th Sem (A,B)

__________________________________________________________________________________

1. Compare contiguous and link file allocation methods.

2. Summarize free space management with the methods available.

3. What is multithreading? Explain different thread modals.

4. Describe the various deadlock prevention methods?

5. Explain different space allocation methods.

6. Explain CPU Scheduling criteria.

7. Write a short note on

a) Thrashing b) Demand Paging.

8. Suppose that a disk drive has a 5000 cylinders, numbered 0 to 4999. The drive currently

serving request at cylinder 2150 and previous request was at cylinder 1805. The queue of

pending request in FIFO order is 2069, 1212, 2296, 2800, 544, 1618, 356, 1523, 4965

3681. Starting from the current head position, what is the total distance (in cylinders) that

the disk arm moves to satisfy all the pending request for each of the following disk

scheduling algorithm?

a) FCFS b) SCAN c) S-SCAN d) C-LOOK E) LOOk

9. Assume process arrived at time 0 given with length of CPU Burst time given millisecond.

Process Burst Time

P1 10

P2 29

P3 04

P4 07

P5 12
Consider FCFS, SJF and RR (Quantum = 10 milliseconds) which algorithm give
minimum waiting time. (Show the scheduling order of process using Gantt Chart)
10. Difference between paging and segmentation.
11. Explain the demand paging concept for the following reference string -

a. 1234 125 12345

b. Assuming 3 frames find out the number of page faults for replacement algorithm

LRU , FIFO, Optimal.

12. Define File System .explain various operation perform on the File.

13. Define Process & Explain type of Scheduler.

14. Describe the various Directory Structure used in OS?

15. Consider the following set of processes.

process CPU Brust Arrival Time Priority

time

P1 3ms 0 3

P2 5ms 1 1

P3 2ms 2 2

P4 5ms 3 5

P5 5ms 4 4

Calculet the waiting time and Turnaround time for each.

1) FCFS 2)SJF 3) Priority 4) RR(time slice=2).


Name of Faculty:

Rashmi R. Warbhe (Patil)

You might also like