CS-63
CS-63
BACHELOR IN COMPUTER
cN1 APPLICATIONS
O Term-End Examination
O June, 2010
CS - 63 1 P.T.O.
(a) Explain the conditions necessary for a 6
deadlock to occur. Also, explain the
deadlock avoidance algorithm with an
example.
(b) Differentiate between contiguous and non
contiguous disk allocation methods.
P2 8 3.0
P3 10 2.0
P4 3 4.0
Calculate the average turnaround time and
response time by SJF and FIFO algorithms.
CS-63 2
5. (a) Construct a context-free grammar for 4
accepting an English language statement
"i am a boy".
Give a short note on client-server model in 3
a distributed environment.
Explain X-WINDOWS architecture. 3
CS-63 3