
	Trending ▼ ICSE CBSE 10th ISC CBSE 12th CTET GATE UGC NET Vestibulares ResFinder

2003 Course Operating Systems

4 pages, 30 questions, 0 questions with responses, 0 total responses,

	pune_eng	+Fave Message
	Profile Timeline Uploads Q & A

Home > pune_eng >

Formatting page ...

Total No. of Questions : 12] P1317 [Total No. of Pages : 4 [3864]-402 B.E. (Computer Engineering) OPERATING SYSTEMS (2003 Course) Time : 3 Hours] [Max. Marks : 100 Instructions to the candidates : 1) Answers to the two sections should be written in separate books. 2) Figures to the right indicate full marks. 3) Neat diagrams must be drawn wherever necessary. 4) Assume suitable data, if necessary. SECTION - I Q1) a) What is Mutual Exclusion? State the requirements to support Mutual Exclusion. Explain hardware approach for Mutual Exclusion with its advantages and disadvantages. [8] b) What is binary and general semaphore? Write implementation of both the semaphore primitives. Also write an implementation of general semaphore using binary semaphore. [8] OR Q2) a) Write a solution to reader/writer problem using semaphore with writers have priority. [6] b) Is busy waiting always less efficient than a blocking wait? Explain. [2] c) What is monitor construct? Write a solution to dining philosopher problem using a monitor. [8] Q3) a) What is deadlock? Explain with example. What is difference among deadlock avoidance, detection and prevention? Also state the four necessary conditions that create deadlock. [8] b) Differentiate between authentication and threat. Explain how security is ensured for authorized access by using encryption technique. [8] OR P.T.O.

Formatting page ...

Tags : Pune, Engineering, University of Pune, Engineering question papers, Pune University, previous year question papers, question papers, india, model question paper, pune university paper pattern, pune university syllabus, old question papers

pune_eng chat

Horizontal lines at:
Guest Horizontal lines at:
AutoRM Data:
Box geometries: