|
61. A disk has 200 tracks (numbered 0 through 199). At a given time,
it was servicing the request of reading data from track 120, and at the
previous request, service was for track 90. the pending requests
(in order of their arrival) are for track numbers.
30 70 115 130 110 80 20 25.
How many times will the head change its direction for the disk scheduling policies
SSTF (Shortest Seek Time First) and FCFS (First Come First Serve)?
(A) 2 and 3
(B) 3 and 3
(C) 3 and 4
(D)4 and 4
62. In a certain operating system, deadlock prevention is attempted
using the following scheme. Each process is assigned a unique timestamp,
and is restarted with the same timestamp if killed. Let P be the process
holding a resource R, P be a process requesting for the same resource R,
and T(Ph) and T(PP)be their timestamps respectively. The decision to wait
or preempt one of the processes is based on the following algorithm.
if T()<T(Ph) then
kill F
else
wait
Which one of the following is TRUE?
(A) The scheme is deadlock free, but not starvation free
(B) The scheme is not deadlock free, but starvation free
(C) The scheme is neither deadlock free nor starvation free
(D) The scheme is both deadlock free and starvation free
63. A process executes the following segment of code:
fo r( i =1; i = n ; i + +)
forkQ:
The number of new processes created is:
(A) n
(B) n(n+l)
(C) 2-1
(D)3-1
64. The semaphore variables full, empty and mutex are initialized to 0, n and 1,
respectively. Process F repeatedly adds one item at a time to a buffer of size n,
and process P2 repeatedly removes one item at a time from the same buffer
suing the programs given below. In the program, K, L, M and N are unspecified
statements.
P1: while (1) {
K; P(mutex);
Add an item to the buffer;
V(mutex);L;
}
P2: while (1) {
M; P(mqt�x); Drum
Remove an item from the buffer;
V(mutex);N;
}
The statements K, L, M and N are respectively
(A) P(full), V(empty), P(full), V(empty)
(B) P(full), V(empty), P(empty), V(full)
(C) P(empty), V(full), P(empty), V(full)
(D) P(empty), V(full), P(full), V(empty)
65. In a virtual memory system, size of virtual address is 32bit,
size of physical address is 30 bit, page size is 4 Kbyte and size of
each page table entry is 32-bit. The main memory is byte addressable.
Which one of the following is the maximum number of bits that can be
used for storing protection and other information in each page table entry?
(A) 2
(B) 10
(C) 12
(D)14
66. In a particular Unix Os, each data block is of size 1024 bytes,
each node has 10 direct data block addresses and three additional addresses:
one for single indirect block, one for double indirect block and one for
triple indirect block. Also, each block can contain addresses for 128 blocks.
Which one of the following is approximately the maximum size of a file in the file system?
(A) 512 MB
(B) 2 GB
(C) 8 GB
(D) 16 GB
67. A software project involves execution of 5 tasks Ti, T2, T3, T4 and T5 of duration
10, 15, i8, 30 and 40 days, respectively. T2 and T4 can start only after Ti
completes. T3 can start after T2 completes. T5 can start only after both T3 and
T4 complete. What is the slack time of the task T3 in days?
(A) 0
(B) 3
(C) 18
(D) 30
68. Consider the following program module:
mt modulel (mt x, mt y)
while (x!=y) {
if (x>y)
x=x-y;
else y = y -
}
return x;
}
What is Cyclomatic complexity of the above module?
(A) 1
(B) 2
(C) 3
(D) 4
69. Assume that the delivered liens of code L of a software is related
to the effort E in person months and duration t in calendar months by
the relation LP * (E/B)113 * t413, where P and B are two constants for
the software process and skills factor. For a software project, the effort
was estimated to be 20 person months and the duration was estimated to be
8 months. However, the customer asked the project team to complete the
software project in 4 months. What would be the required effort in person months?
(A) 10
(B) 40
(C) 160
(D) 320
70. A software was tested using the error seeding strategy in which
20 errors were seeded in the code. When the code was tested using the
complete test suite, 16 of the seeded errors were detected. The same
test suite also detected 200 non- seeded errors. What is the estimated
number of undetected errors in the code after this testing?
(A) 4
(B) 50
(C) 200
(D)250
71. What is the availability of a software with the following reliability figures?
Mean Time Between Failure (MTBF) = 25 days
Mean Time To Repair (MTTR) = 6 hours
(A) i�h
(B) 24�h
(C) 99�h
(D)99.009�h
72. Consider the following entity relationship diagram (ERD), where two entities
El and E2 have a relation R of cardinality l:m.
El ____________ m E2
The attributes of El are All, A12 and A13 where All is the key attribute.
The attributes of E2 are A21, A22 and A23 where A21 is the key attribute
and A23 is a multi-valued attribute. Relation R does not have any attribute.
A relational database containing minimum number of tables with each table
satisfying the requirements of the third normal form (3NF) is designed
from the above ERD. The number of tables in the database is:
(A) 2
(B) 3
(C) 5
(D) 4
73. A relational database contains two table student and department in
which student table has columns roll_no, name and dept_id and department
table has columns dept_id and detp_name. the following insert statements
were executed successfully to populate the empty tables:
Insert into department values (1, �Mathematics�)
Insert into department values (2, �Physics�)
Insert into student values (1, �Navin�,l)
Insert into student values (2, �Mukesh�,2)
Insert into student values (3, �Gita�,l)
How many rows and columns will be retrieved by the following SQL statement?
Select * from student, department
(A) 0 row and 4 columns
(B) 3 rows and 4 columns
(C) 3 rows and 5 columns
(D) 6 rows and 5 columns
74. A relation Empdtl is defined with attributes empcode (unique), name,
street, city, state and pincode. For any pincode, there is only one city
and state. Also, for any given street, city and state, thereis just one pincode.
In normalization terms, Empdtl is a relation in
(A) 1 NF only
(B) 2 NF and hence also in 1 NF
(C) 3 NF and hence also in 2 NF and 1 NF
(D) BCNF and hence also in 3 NF, 2NF and 1NF
75. A table Ti in a relational database has the following rows and columns:
The following sequence of SQL statements was successfully executed on table Ti.
Update Ti set marks = marks + 5
Select avg(marks) from Ti
What is the output of the select statement?
(A) i8.75
(B) 20
(C) 25
(D)Null
|
