# ISRO Scientist/Engineer Question Paper Computer Science 2018

##### 36. Question

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

 0 S7 1 S1 2 3 S4 4 S2 5 6 S5 7 8 S6 9 S3

`Answer`
##### 37. Question

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?

`Answer`
##### 38. Question

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

`Answer`
##### 39. Question

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

`Answer`
##### 40. Question

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

`Answer`