Docsity
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

Operating Systems Examination 2010/11 - Operating Systems (SOFT 7006), Exams of Computer Science

Information about an operating systems examination held at cork institute of technology in the winter of 2010/11. The examination covers topics such as deadlock, disk storage, and memory management. It includes four questions, each worth equal marks, and lasts for 2 hours. The document also provides instructions for candidates and details about the examiners and programmes related to the examination.

Typology: Exams

2012/2013

Uploaded on 03/25/2013

digvastra
digvastra 🇮🇳

3.8

(36)

233 documents

1 / 5

Toggle sidebar

Related documents


Partial preview of the text

Download Operating Systems Examination 2010/11 - Operating Systems (SOFT 7006) and more Exams Computer Science in PDF only on Docsity! 1 CORK INSTITUTE OF TECHNOLOGY INSTITIÚID TEICNEOLAÍOCHTA CHORCAÍ Semester 1 Examinations 2010/11 Module Title: Operating Systems Module Code: SOFT 7006 School: Mathematics & Computing Programme Title: Bachelor of Science (Honours) in Software Development – Year 3 Bachelor of Science (Honours) in Software Development & Computer Networking – Year 2 Programme Code: KSDEV_8_Y3 KDNET_8_Y2 External Examiner(s): Mr. Aidan.F. Quilligan Internal Examiner(s): Mr. G. McSweeney Instructions: Answer four questions. All questions are worth equal marks. Duration: 2 Hours Sitting: Winter 2010/11 Requirements for this examination: Note to Candidates: Please check the Programme Title and the Module Title to ensure that you have received the correct examination. If in doubt please contact an Invigilator. 2 Q1. (a) Explain what is meant by deadlock. (3 Marks) (b) List the four conditions necessary for deadlock to occur. (4 Marks) (c) Outline two different types of approaches to Deadlock Avoidance. (4 Marks) (d) What is meant by a safe state? (2 Marks) Consider the following system which is characterised by the Total Resource Vector and Current Resource allocation shown below. Total Resource Vector R1 R2 R3 5 3 5 Current Resource Allocation R1 R2 R3 P1 1 1 1 P2 2 0 2 P3 1 1 0 P4 1 1 1 (e) Calculate the current Available Resource Vector for the system. (2 Marks) (f) The following matrix describes the Total Resource Claims for each of the current processes. Is the system currently in a safe state? (6 Marks) Total Resource Claims R1 R2 R3 P1 5 2 5 P2 2 1 3 P3 1 1 1 P4 4 1 2 (g) Describe four possible strategies of dealing with deadlock once it is detected. (4 Marks)
Docsity logo



Copyright © 2024 Ladybird Srl - Via Leonardo da Vinci 16, 10126, Torino, Italy - VAT 10816460017 - All rights reserved