Scribd
Upload
13 views

Candidates Are Required To Give Their Answers in Their Own Words As Far As Practicable. The Figures in The Margin Indicate Full Marks

The document is a past exam paper for an Operating Systems course at Pokhara University. It contains multiple choice and short answer questions testing knowledge of key operating systems concepts including: 1. The benefits of virtual machines and an explanation of the different states a process can be in during its lifecycle and the transitions between states. 2. Algorithms for process scheduling including calculating waiting time and turnaround time using Shortest Remaining Time First and Round Robin algorithms for a given workload. 3. Algorithms for deadlock detection when multiple instances of a resource type are present. 4. The use of semaphores to solve critical section problems and definitions of minimum conditions for deadlock and the resource allocation graph

Uploaded by

11520035
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
13 views

Candidates Are Required To Give Their Answers in Their Own Words As Far As Practicable. The Figures in The Margin Indicate Full Marks

The document is a past exam paper for an Operating Systems course at Pokhara University. It contains multiple choice and short answer questions testing knowledge of key operating systems concepts including: 1. The benefits of virtual machines and an explanation of the different states a process can be in during its lifecycle and the transitions between states. 2. Algorithms for process scheduling including calculating waiting time and turnaround time using Shortest Remaining Time First and Round Robin algorithms for a given workload. 3. Algorithms for deadlock detection when multiple instances of a resource type are present. 4. The use of semaphores to solve critical section problems and definitions of minimum conditions for deadlock and the resource allocation graph

Uploaded by

11520035
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

POKHARA UNIVERSITY Level: Bachelor Semester Fall Programme: BE Course: A l!e" # erat!

!$g S%stem Year : 2008 Full Marks: 100 &!me : 'hrs(

Candidates are required to give their answers in their own words as far as practicable. The figures in the margin indicate full marks. Attempt all the questions. 1( a) +) 2. a) +) *hat are the +e$e,!ts o, v!rtual mach!$es- E. la!$ a+out the /ava v!rtual mach!$es( 0llustrate the "!,,ere$t states o, a rocess "ur!$g !ts l!,ec%cle a$" e. la!$ the tra$s!t!o$s +et1ee$ those states( 3o1 !s user threa"s ma 1!th a$ e.am le( e" to 4er$el threa"s- E. la!$ /ava threa"s 8 2 8 2

For the ,ollo1!$g 1orkloa"5 calculate the average 1a!t!$g6t!me a$" average tur$6arou$" t!me us!$g Shortest 7ema!$!$g &!me F!rst 8 reem t!ve S/F) algor!thm(

Process Arr!val &!me Burst &!me P1 0 2 P2 2 2 P' ' ' P9 : : P: 2 2 Prese$t a$ algor!thm ,or ;ea"lock ;etect!o$ 1he$ several !$sta$ces o, a resource t% e are rese$t( 3. a) +) c) 4. a) ;o %ou th!$g sema hore !s the +est solut!o$ ,or solv!$g cr!t!cal sect!o$ ro+lem( E. la!$ Pro"ucer6co$sumer ro+lem( *hat are the m!$!mum co$"!t!o$s ,or "ea" lock- ;e,!$e the resource allocat!o$ gra h( *hat "o %ou mea$ +% v!rtual memor%- ;e,!$e the ste s !$ ha$"l!$g a age ,ault 1!th hel o, "!agram( *hat !s ;ema$" Pag!$g: : : 10

For the ,ollo1!$g age re,ere$ce str!$g5 assum!$g $um+er o, ,rames < '5 ,!$" the total $um+er o, age ,aults us!$g 8!) Least 7ece$tl% =se" a$" 8!!)
1

Least Fre>ue$tl% use" age re laceme$t algor!thms( 12'1'92'2'9?9:9?:?9'?:'22 +) 5. a) +) 6. a) +) E. la!$ L!$ke" Allocat!o$ metho" to allocate "!sk s ace to ,!les( Com are the "!,,ere$ces +et1ee$ access l!st a$" grou ( E. la!$ the ACL ro ert% o, L!$u. ,or rotect!o$ 1!th e.am le( E. la!$ the Shortest Seek &!me F!rst a$" C6Sca$ "!sk sche"ul!$g algor!thms( *!th re,ere$ce o, "!agram e. la!$ the l!,ec%cle o, a$ 0@# re>uest( *hat are the ma!$ ' ,u$ct!o$s ,or the "!sk ma$ageme$t- E. la!$ "!sk ,ormatt!$g !$ "eta!ls( S%stem ge$erat!o$ Segme$tat!o$ ;!rect Memor% Access &ert!ar%6Storage ;ev!ces
:

8 2 2 8 2A:

7. *r!te short $otes o$ (Any Two) a) +) c) ")

You might also like