Scribd
Upload
45 views1 page

Answer All Questions

This document is the question paper for the 4th semester Operating Systems exam for the B.E/B.Tech course at R.M.K College of Engineering and Technology. The exam contains 2 parts with a total of 50 marks. Part A contains 5 short answer questions worth 2 marks each for a total of 10 marks. Part B contains 2 long answer questions worth 16 marks each and 1 short answer question worth 8 marks for a total of 40 marks. The long answer questions cover topics such as classical synchronization problems, memory management using paging, and the Banker's algorithm. Students are required to answer all questions within the allotted time of 100 minutes.

Uploaded by

BIBIN CHIDAMBARANATHAN
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
45 views1 page

Answer All Questions

This document is the question paper for the 4th semester Operating Systems exam for the B.E/B.Tech course at R.M.K College of Engineering and Technology. The exam contains 2 parts with a total of 50 marks. Part A contains 5 short answer questions worth 2 marks each for a total of 10 marks. Part B contains 2 long answer questions worth 16 marks each and 1 short answer question worth 8 marks for a total of 40 marks. The long answer questions cover topics such as classical synchronization problems, memory management using paging, and the Banker's algorithm. Students are required to answer all questions within the allotted time of 100 minutes.

Uploaded by

BIBIN CHIDAMBARANATHAN
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/ 1

R.M.K.

COLLEGE OF ENGINEERING AND TECHNOLOGY


R.S.M NAGAR, PUDUVOYAL-601206
4th Semester B.E. / B.Tech.
Second Internal Assessment March 2013
Sub. Title : Operating Systems
Sub. Code : CS2254
Duration : 100 minutes

Date
: 06.03.2013
Branch
: IT & CSE
Max. Marks : 50

Answer all questions


Part A - (5 x 2 = 10)

1. State and explain the requirements that must be satisfied for solving the critical section
problem.
2. Mention some of the factors that can be considered for determining which process to
select for termination during deadlock recovery.
3. What is address binding?
4. What is the difference between internal fragmentation and external fragmentation?
5. Define thrashing and page fault.
Part B - (2 x 16 + 1 x 8 = 40)

6. a) Explain the classical problems of synchronization in detail.


(16)
(OR)
b) Explain the translation of logical address to physical address using paging memory
management scheme with necessary illustration and example.
(16)
7. a) Consider the following snapshot of the system,
(16)
Allocation
Max
Available
A B C D A B C D A B C D
P0
0
0
1
2
0
0
1
2
1
5
2
0
P1
1
0
0
0
1
7
5
0
P2
1
3
5
4
2
3
5
6
P3
0
6
3
2
0
6
5
2
P4
0
0
1
4
0
6
5
6
Answer the following questions using the Bankers algorithm,

Processes

i)
ii)
iii)

What is the content of the matrix Need?


Is the system in safe state?
If a request from process P1 arrives for (0,4,2,0) can the request be granted
immediately?
(OR)
(b) Consider the following reference string,
(16)

7 0 1 2 0 3 0 4 2 3 0 3 2 1 2 0 1 7 0 1
Using 3 page frames and 4 page frames determine the page faults when the reference
strings are replaced by i) FIFO, ii) LRU and iii) Optimal page replacement policies.
8. a) Explain the synchronization hardware for solving the critical section problem.
(OR)
b) Explain any one of the technique for structuring the page table.

(8)
(8)

You might also like