ISRO Scientist/Engineer Question Paper Computer Science 2018

A has table with 10 buckets with one slot per bucket is depicted here. The symbols, S1 to S7 are initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is

The running time of an algorithm is given by
T(n) = T(n-1) + T(n-2) – T(n-3) , if n > 3
        = n, otherwise
Then what should be the relation between T(1), T(2) and T(3), so that the order of the algorithm is constant?

The number of edges in a regular graph of degree d and n vertices is

Perform window to viewport transformation for the point (20, 15). Assume that (X _wmin , Y _wmin ) is (0,0) ; (X _wmax , Y _wmax ) is (100,100) ; (X _vmin , Y _vmin ) is (5,5) ; (X _vmax , Y _vmax ) is (20,20). The value of x and y in the viewport is

Given relations R(w,x) and S(y,z), the result of
SELECT DISTINCT w, x
FROM R, S
Is guaranteed to be same as R, if