/) el Code No: 1554B R18 V “Time:3 Hour’ |~ JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech Il Year I Semester Examinations, March - 2024 rie ADVANCED OPERATING SYSTEMS (Common to CSE,IT) |, No a >Max. Marks: 75 Note: i) Question paper consists of Part A, Part B. 1 )) ¢) o) 2a) \ Explain Raymond’s Heuristic algorithm in detail. ) Part A is compulsory, which carries 25 marks. In Part A, Answer all questions. iii) In Part B, Answer any one question from each unit. Each question carries 10 marks and may have a, b as sub questions. oh Ne Le . PART“A | Vi M . 7 7 set (25 Marks) What is vector clock? 2] What are the various issues in distributed operating system? BI What is distributed mutual exclusion? 2) Distinguish between token based.and nontoken’based algorithms. ---.. B) How does deadlock o¢cur'in a distributed énvironment?, Vi 21, “Discuss various issiies that arise in deadlock detection. a Br What is multiprocessor system? 2] Distinguish between process and thread. GB] What are various issues that arise in task migration? 2] 7 ‘What do you mean by memory coherence? Ne B] ‘| PART~B , ¥ “(80 Marks) What are communication primitives? Explain them. L ‘What do you mean by causal ordering of messages? Explain them. OS 545] OR op What are the inherent limitations of a distributed system? What is logical clock? Explain Maekawa’s nontoken based algorithm. OR Explain distributed deadlock detection algorithms. Explain Kow déadlosk is Kandled in disbited sistenis, Explain structures of multiprocessor operating system. What are various mechanisms for building distributed file system? Explain them. [10] Explain load distributing algorithms in, neta i (19) Explain’ various algorithins for implementing DSM. : f1oy | 00000(Code No: 155AB R18 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD Y 'B. Tech Il Year I Semester Examinations, January/Rebroary - 2023 ‘ADVANCED OPERATING SYSTEMS. (Common to CSE, IT) ‘Max, Marks: 75 aper consists of Part A, Part B, sory, which carries 25 marks. In Patt A, Answer all questions. iii) In ‘any one question from each unit. Each question carries 10 marks (25Marks) Ja) What is a distributed’ system? RI) D) nthe advamages of dstibutedperaingsytems. | ©) Whats rena by daa i i d) Write a short note on distribut: lal exclusion. BI e) What is distributed deadlock? RQ) 1) Discuss the various issucs of deadle ection in the distributed systems, BI 2) What is multiprocessor? 21 1) What isthe ference beween pres nye) 6} i) List the advantages of using distributed : R) J) Write the key issues in task migration. BI PART-B Qe, 21a) Wiha nea stich, explain werataionserver made, % ©) Dit Blsing endnotes.“ @GY (6 on 3a) Desc th ros caisited opang tne, D) White short note on RPC 4. Wee the Rican Araval algort ad ilustate with an cxampl. oR S.— Write Raymond’s Heuristic algorithm and illustrate with an example. 6 Classify the various hierarchical deadlock detection algorithms and briefly explain them. 01 oR 7. Classify the various centralized deadlock detection algorithms and briefly explain them, (10) yDraw and briefly explain architecture for distributed file systems. 1545] oR the structure of multiprocessor operating system. jef summary on process synchronization 1545] 4 ‘Mention and brief the various design issues of distributed file systems. e following terms: a distributed shared memory for load distributing, 1545] oR 11a) Discuss the desigMssues pf distributed shared memory b). Write migratioifalgoriggft for implementing distributed shared memory. 1545]Code No: 155AB R18 ¢@ JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech Ill Year I Semester Examinations, August - 2022 ADVANCED OPERATING SYSTEMS (Common to CSE, IT) Max. Marks: 75 Answer any five questions All questions carry equal marks i ibuyed operating system and write its characteristics and advantages. i Se. non blocking communication primitives in distributed operating [7+8] 2a) Explain frame worl ical clocks. b) Give the architecture’ Ped operating system. [847] 3.a) Define critical section proflem plain with an example. b) State and explain Singhal’s hgffstic)ligorithm for Mutual exclusion. [748] 4.a) Write Lamport’s algorithm for dit b) Device performance and optimality itual exclusion. rt’s algorithm for distributed mutual exclusion. [748] 5.a) Describe deadlock handling strategies in distri b) Explain edge chasing algorithm for deadlock dete [748] 6.a) _ Explain wait-for graph with an example. b) Discuss diffusion computing algorithm for dead lock detec [7+8] 7.a) Explain the architecture of distributed file system. b) Discuss the issues in multi processor operating systems and operating system. 8.a) _ Elaborate components of load distribution algorithm. b) Write the advantages and abstract view of distributed shared memory. 8:Code No: 155AB R18 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech III Year I Semester Examinations, February - 2022 ADVANCED OPERATING SYSTEMS (Common to CSE, IT) Time hours Max. Marks: 75 Answer any five questions S All questions carry equal marks La) b) 2a) b) 3a) ») 4a) b) S.a) b) 6.a) b) 7.) b) 8a) ») rh) gngssues in distributed operating system. Compare Cio) § logical clocks. [3+7] Describe message, g communication model. Explain any onafékg detection algorithm. [847] Explain the steps to acht State and explain Shingal’ | exclusion using token based algorithms. exclusion algorithm. [8+7] Explain the properties and perfo amport’s Mutual exclusion algorithm. Write Lamopr'’s algorithm for mutualg&clusion. [847] Discuss the issues in deadlock detection in, i -d systems. Explain edge chasing algorithm for dead lock, 101 [8+7] Explain hierarchical deadlock detection algorithm$ Explain the deadlock handling strategies in distributet sViems [7+8] Give note on process synchronization in multiprocessor optggting S$Nym. Describe the architecture of distributed file system. [3+7] On Explain full replication algorithms for distributed shared memory. Explain components of load distributing algorithms.Code No: 155AB R18 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech Ill Year I Semester Examinations, September - 2021 ADVANCED OPERATING SYSTEMS Y, (Common to CSE, IT) : s Max. Marks: 75 Answer any five questions & All questions carry equal marks La) Discus a issues in distributed operating system. b) Explain i in aboyggommunication primitives. [748] 2 ay, ©) a) Vector clocks. b) Termination detectffns [347] 3.a) Explain Raymond’s heuristi@al; b) Explain Lamport’s algorithm. [847] 4.a) Distinguish between token and nongken, gorithms. b) Discuss in brief about the classification, exclusion algorithms. [748] 5.a) Explain in brief control organizations for di b) Discuss the issues in deadlock detection and re8 [347] 6. Explain in brief hierarchical deadlock detection algoRaip- 5} 7.a) Discuss the features of distributed file systems. b) Discuss about operating design issues. [3+7] 8.a) _ Explain the components of load distributed algorithm. b) Discuss the requirements for load distributing. [8+7]/ Code No: 15SAB R18 S La) b) JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B. Tech IMI Year I Semester Examinations, March - 2021 ADVANCED OPERATING SYSTEMS (Common to CSE, IT) s Max. Marks: 75 Answer any five questions All questions carry equal marks List Charact of distributed operating system... Compare ommunication model Vs remote procedure call. 17+8] Discuss vector a \pare with logical clocks. us] Explain Lamport’s al LAS, ‘sure mutual exclusion in distributed systems. [15] Explain about Raymonds H@risW algggithm. O15) Write edge chasing and global gfte\ ion algorithms for deadlock detection in distributed operating system. U5] Describe about the Hierarchical deadlock ong@morithm. U5] Write the design issues in implementing of rffily ssor system and explain its architecture. [15] Explain sender initiated load distributing algorithm in dail 15]