ISRO Scientist/Engineer Question Paper Computer Science 2017

Consider a disk system with 100 cylinders. The request to access the cylinders occur in the following sequences
4, 37, 10, 7, 19, 73, 2, 15, 6, 20
Assuming the head is currently at cylinder 50, what is the time taken to satisfy all requests if it takes 1 ms to move from one cylinder to adjacent one and shortest seek time first algorithm is used

A B-Tree used as an index for a large database table has four levels including the root node. If a new key is inserted in this index, then the maximum number of nodes that could be newly created in the process are

A critical region

Choose the equivalent prefix form of the following expression
( a + ( b − c ) ) * ( ( d − e ) / ( f + g − h ) )

We use malloc and calloc for