Scribd
Upload
55 views1 page

CSC511C A0001

This document appears to be an exam answer sheet for a computer science course. It contains questions about CPU scheduling algorithms, deadlock scenarios involving processes requesting resources, and safe sequences to avoid deadlock. The student provided explanations of their chosen CPU scheduling algorithm, discussed how many unsuccessful attempts would occur, and analyzed different process scenarios to identify victims, earliest restart times, and whether deadlock was solved.

Uploaded by

Ed Luna
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
55 views1 page

CSC511C A0001

This document appears to be an exam answer sheet for a computer science course. It contains questions about CPU scheduling algorithms, deadlock scenarios involving processes requesting resources, and safe sequences to avoid deadlock. The student provided explanations of their chosen CPU scheduling algorithm, discussed how many unsuccessful attempts would occur, and analyzed different process scenarios to identify victims, earliest restart times, and whether deadlock was solved.

Uploaded by

Ed Luna
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

",

Make-Up Examination CSC511C (ANSWER SHEET)


SY 2010-2011-3
NAME " Ie\-· iJ~ Section (;:a f5 i.

I-A-2. (5%)

C1=

C2=

P1=
P2=

I-A-3. (1%) Which process? f3 I-A-4. (1%) 2-5


I-B-1 (15%) Explain your CPU scheduling algorithm
page if necessary)
(use back I-B-2 (7%) CPU Ga J
ll- ck «\r-.. ~\~6Y\~~ li(\~ \~ ~ ~~tl-S~~)
V\ ~ fl..., d.\I\J, (}i'\L ~~\J~Y-.c,~. \\:... VY\j,cl.vUr-l
~\\ow OL \1}V'~& t1)'o\V\. tA\~o""~~ w'0l Q ,\Ill.

of i (XY" ~ t30"(.J" ~Vtdu-' 1.Vl'\\ ~~ ze. 1- I-B-3 (3%) How many unsucces

t¥m ~Y- ~e-\(.., < ~ I ~t\ i~nt ~ ---------..,.;"'""M....,op.;-I


P'-'--C--1.-B-O-N-U-S-(5-%-)

tv ~~~~err ~ ~U'"

k CO~uW\e_~ ~\~ItJ.s fcf'S o..~6'r1 i1 M~


ftteM~~V"L\ fY\LD..~~ r~ ~'~ CbfX~ h Ue.Ui~
t:.h~'\ o.L\ t'~~ l~ l~{> bv" qV<.. II
Cb~u""'i. d~-Tt ~ >-o.\~bs-'i~V>\ ~ \k.\,J~\
tM:\-- J,~ 4 \ PnxL-un. r\ ~ f2. ~ \c\ "rv
fV1l~u.,J. 1-1 \;~. ~ ~~ C£'tv\~me~ .
'"i 'H..- '4~ a.l\ {'~W\.$ Co~I;k~ I~~ 01 ~,V\~.
I---~---.:--.-~-,-------=---l II-A-2 (5%) Final/Resulting RAG

II-B-2 (20%) If there is NO DEADLOCK: (ALL possible safe sequences)


~~~~~-L~~~~_~

~~==~~-----------~11-8-3
(20%)
Victim Which will
Finish First?
Earliest restart time
Which needs to finish?
Deadlock
Solved?
I--_-=~~U- ~
Process (b) (c)
PO
Pl
P2
P3

You might also like