Scribd
Upload
12 views2 pages

OS Assignment2

The document contains assignment questions for the Operating Systems course at P. A. College of Engineering and Technology for the even semester of 2024-2025. It includes questions based on the banker’s algorithm, race conditions, memory management techniques, and comparisons between paging and segmentation. The assignments are divided into two batches, each with specific questions related to course outcomes and program outcomes.

Uploaded by

saranyat2701
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
12 views2 pages

OS Assignment2

The document contains assignment questions for the Operating Systems course at P. A. College of Engineering and Technology for the even semester of 2024-2025. It includes questions based on the banker’s algorithm, race conditions, memory management techniques, and comparisons between paging and segmentation. The assignments are divided into two batches, each with specific questions related to course outcomes and program outcomes.

Uploaded by

saranyat2701
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

P. A.

COLLEGE OF ENGINEERING AND TECHNOLOGY


An Autonomous Institution
Accredited by NAAC with ‘A’ Grade
POLLACHI – 642 002
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Accredited by NBA
EVEN SEMESTER 2024-2025

Academi Year of study II Date:25.02.2025


: 2024-2025 :
c Year & Semester &IV
Course
22CAPC40
Code & : Operating Systems
2
Title

ASSIGNMENT I(Batch 1)
QUESTIONS

Q.
Question (s) CO PO/PSO
No.
1. Consider the following questions based on
the banker’s algorithm: PO1,PO2,PO3,PO4,PO5,PO9,
Allocation Max Available PO10, PO11,PO12
ABC ABC ABC
P1 001 001 152
P2 100 175 CO2
P3 135 235
P4 063 065
P5 001 065
(1) What is the content of the matrix Need?
(2) Is the system in a safe state?
2. What are race condition? Explain how a PO1,PO2,PO3,PO4,PO5,PO9,
critical section avoids this condition. What are PO10, PO11,PO12
the properties which a data item should
CO2
possess to implement a critical section?
Describe the solution to the dinning
philosophers problem.
3. Compare paging with segmentation in terms
of the amount of memory required by the PO1,PO2,PO3,PO4,PO5, PO9,
address translation structures in order to CO3 PO10, PO11,PO12
convert virtual addresses to physical
addresses.
4. Explain about memory management PO1,PO2,PO3,PO4,PO5, PO9,
techniques. CO3 PO10, PO11,PO12
P. A. COLLEGE OF ENGINEERING AND TECHNOLOGY
An Autonomous Institution
Accredited by NAAC with ‘A’ Grade
POLLACHI – 642 002
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
Accredited by NBA
EVEN SEMESTER 2024-2025

ASSIGNMENT I(Batch 2)
QUESTIONS

Q.
Question (s)
No. CO PO/PSO
1. Consider the following questions based on
the banker’s algorithm: PO1,PO2,PO3,PO4,PO5,PO9,
Allocation Max Available PO10, PO11,PO12
ABC ABC ABC
P1 001 001 152
P2 100 175 CO2
P3 135 235
P4 063 065
P5 001 065
(1) What is the content of the matrix Need?
(2) Is the system in a safe state?
2. Write in detail about methods preventing PO1,PO2,PO3,PO4,PO5,PO9,
CO2
deadlock. PO10, PO11,PO12
3. Explain the basic concepts of segmentation. PO1,PO2,PO3,PO4,PO5, PO9,
CO3
PO10, PO11,PO12
4. Explain in detail about address binding with PO1,PO2,PO3,PO4,PO5, PO9,
CO3
neat diagram. PO10, PO11,PO12

Faculty In-charge HOD

You might also like