GATE CS 1998 (original) (raw)

In a computer system where the 'best-fit' algorithm is used for allocating 'jobs' to 'memory partitions', the following situation was encountered:When will the 20K job complete?Note - This question was subjective type.

Give the correct matching for the following pairs:

A. O(log n) 1. Selection sort B. O(n) 2. Insertion sort C. O(nlog n) 3. Binary search D. O(n^2) 4. Merge sort

codes: A B C D a. 3 1 2 4 b. 3 1 4 2 c. 1 3 4 2 d. 1 4 3 2

Which of the following algorithm design technique is used in finding all pairs of shortest distances in a graph?

Solve the following recurrence relation:

xn = 2xn-1 -1, n>1 x1 = 2

What value would the following function return for the input x=95 ?

function fun (x:integer):integer; Begin If x >100 then fun = x-10 Else fun = fun(fun( x+11)) End;

Let A be a two dimensional array declared as follows:

A: array [1 ... 10] [1 ... 15] of integer;

Assuming that each integer takes one memory location, the array is stored in row-major order and the first element of the array is stored at location 100, what is the address of the element a[i][j] ?

Faster access to non-local variables is achieved using an array of pointers to activation records, called a

Free disk space can be kept track of using a free list or a bit map. Disk addresses require d bits. For a disk with 13 blocks, F of which is free, state the condition under which the free list uses less space than the bit map.

The overlay tree for a program is as shown below:What will be the size of the partition (in physical memory) required to load (and run) this program?

When the result of a computation depends on the speed of the processes involved, there is said to be

There are 83 questions to complete.

Take a part in the ongoing discussion