Docsity
Log inSign up
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search Store documents

The best documents sold by students who completed their studies

Search through all study resources
Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

University Rankings

Discover the best universities in your country according to Docsity users

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

From our blog

Exams and Study
Go to the blog

Operating System Assignment, Exams of Product Development

National Institute of DesignProduct Development

An assignment or exam related to operating systems. It covers various topics such as cpu scheduling algorithms (shortest job first and round robin), memory management (static partitioned allocation), and page replacement algorithms (fifo and page replacement). Several questions that require the student to analyze and solve problems related to these operating system concepts. The level of detail and the types of questions suggest that this document is likely intended for a university-level course on operating systems, possibly at the undergraduate or graduate level. The document could be useful for students preparing for exams, studying course material, or working on assignments related to operating system design and implementation.

Typology: Exams

2021/2022

Uploaded on 11/21/2022

stree-stree
stree-stree 🇮🇳

3 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Operating System Assignment
Q.1 Consider following processes with length of CPU burst time in milliseconds!
Process Burst time !
P1 "5!
P2 "10!
P3 "2!
P4 "1!
All process arrived in order p1, p2, p3, p4 all time zero!
(a) Draw Gantt charts illustrating execution of these processes for SJF and round robin
(quantum=1)!
(b) Calculate waiting time for each process for each scheduling algorithm!
c) Calculate average waiting time for each scheduling algorithm!
Q.2 Explain the effect of increasing the time quantum to an arbitrary large Number and!
decreasing the time quantum to an arbitrary small number for round robin scheduling!
algorithm with suitable example?!
Q.3 Explain static partitioned allocation with partition sizes 300,150, 100, 200, 20.
Assuming first fit method indicate the memory status after memory request for sizes 80,
180, 280, 380, 30.!
Q.4 Consider the following page reference string.!
1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2How many page faults would occur for the
following replacement algorithm, assuming four and six frames respectively?!
a. page replacement. b. FIFO page replacement.!
Q.5 Consider the following snapshot-!
Answer the following questions using banker’s
algorithm:!
a) What are contents of matrix end?!
b) Is the system in safe state?!
c) If request for process p1 arrives for (0,4,2,0) .Can the request be granted immediately?

Partial preview of the text

Download Operating System Assignment and more Exams Product Development in PDF only on Docsity!

Operating System Assignment Q.1 Consider following processes with length of CPU burst time in milliseconds Process Burst time P1 5 P2 10 P3 2 P4 1 All process arrived in order p1, p2, p3, p4 all time zero (a) Draw Gantt charts illustrating execution of these processes for SJF and round robin (quantum=1) (b) Calculate waiting time for each process for each scheduling algorithm c) Calculate average waiting time for each scheduling algorithm Q.2 Explain the effect of increasing the time quantum to an arbitrary large Number and decreasing the time quantum to an arbitrary small number for round robin scheduling algorithm with suitable example? Q.3 Explain static partitioned allocation with partition sizes 300,150, 100, 200, 20. Assuming first fit method indicate the memory status after memory request for sizes 80, 180, 280, 380, 30. Q.4 Consider the following page reference string. 1,2,3,4,5,3,4,1,6,7,8,7,8,9,7,8,9,5,4,5,4,2How many page faults would occur for the following replacement algorithm, assuming four and six frames respectively? a. page replacement. b. FIFO page replacement. Q.5 Consider the following snapshot- Answer the following questions using banker’s algorithm: a) What are contents of matrix end? b) Is the system in safe state? c) If request for process p1 arrives for (0,4,2,0) .Can the request be granted immediately?