Scribd
Upload
4 views2 pages

Operating system Assignment

The document is an assignment for the Operating Systems course, detailing various topics to be covered including types of threads, scheduling algorithms (FCFS, SRN, RR, LCN), process states with transition diagrams, demand paging, memory allocation, fragmentation, disk space allocation, file systems, deadlock detection, and message passing. It includes specific tasks such as performing scheduling on given processes and calculating page faults using different policies. The assignment is intended for students in the Electronics and Communication Engineering department for their fourth semester.

Uploaded by

poorvihomiyonatha
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
4 views2 pages

Operating system Assignment

The document is an assignment for the Operating Systems course, detailing various topics to be covered including types of threads, scheduling algorithms (FCFS, SRN, RR, LCN), process states with transition diagrams, demand paging, memory allocation, fragmentation, disk space allocation, file systems, deadlock detection, and message passing. It includes specific tasks such as performing scheduling on given processes and calculating page faults using different policies. The assignment is intended for students in the Electronics and Communication Engineering department for their fourth semester.

Uploaded by

poorvihomiyonatha
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/ 2

DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING

SEMESTER: IV
ASSIGNMENT -2 April 2025

SUBJECT : : OPERATING SYSTEM Sub code : BEC405C

1. Explain the different types of threads

2. For a given set of process, perform FCFS and SRN scheduling and compare their

performance in terms of mean turn around and wait turnaround times

Process P1 P2 P3 P4 P5

Arrival time 0 2 3 5 9

Service time 3 3 2 5 3

3. Define Process, process states and with state transition diagramme, explain the state

transition of a process.

4. For the following process, perform RR and LCN scheduling

Process P1 P2 P3 P4 P5

Arrival time 0 2 3 5 9

Service time 3 3 2 5 3

5. With a neat sketch explain demand paging preliminaries

6. Consider the page reference string 5,4,3,2,1,4,3,5,4,3,2,1,5. Calculate the page faults using

FIFO and LRU page replacement policies with a frame size 3.


7. Compare the contiguous and non-contiguous memory allocation

8. Explain the following

i) internal and external fragmentation

ii) Paging and segmentation

iii) Page and page frames

9. Explain allocation of disk space.

10. Explain the interface between file system and IOCS

11. Explain file types, attributes and file operations.

12. Explain sequential file organization and direct file organization.

13. Explain deadlock detection algorithm

14 Define deadlock , discuss resource request and allocation graph and wait-for-graph for a

system containing resource class and processes.

15. Define mailbox, explain the advantages of mail boxes.

16. Explain the issues in message passing.

17. Define message passing, explain how to implement message passing.

You might also like