ISRO CSE 2007
Q3.
The time taken by binary search algorithm to search a key in a sorted array of n elements isQ5.
Consider the following pseudo-codex:=1; i:=1; while (x <= 1000) begin x:=2^x; i:=i+1; end; What is the value of i at the end of the pseudo-code?Q6.
Consider a system having 'm' resources of the same type. The resources are shared by 3 processes A, B, C, which have peak time demands of 3, 4, 6 respectively. The minimum value of 'm' that ensures that deadlock will never occur isQ7.
Disk requests are received by a disk drive for cylinder 5, 25, 18, 3, 39, 8 and 35 in that order. A seek takes 5 msec per cylinder moved. How much seek time is needed to serve these requests for a Shortest Seek First (SSF) algorithm? Assume that the arm is at cylinder 20 when the last of these requests is made with none of the requests yet servedQ8.
Consider a job scheduling problem with 4 jobs J_1, J_2, J_3 and J_4 with corresponding deadlines: (d_1, d_2, d_3, d_4) = (4, 2, 4, 2). Which of the following is not a feasible schedule without violating any job schedule?