## ISRO | ISRO CS 2018 | Question 80

Consider the following C program #include main() { float sum = 0.0, j =1.0, i = 2.0; while(i/j > 0.001) { j = j +… Read More »

Consider the following C program #include main() { float sum = 0.0, j =1.0, i = 2.0; while(i/j > 0.001) { j = j +… Read More »

Let P be a procedure that for some inputs calls itself (i.e. is recursive). If P is guaranteed to terminate, which of the following statement(s)… Read More »

In multi-programmed systems, it is advantageous if some programs such as editors and compilers can be shared by several users. Which of the following must… Read More »

The time complexity of computing the transitive closure of binary relation on a set of n elements is known to be (A) O(n) (B) O(n… Read More »

Let us assume that transaction T1 has arrived before transaction T2. Consider the schedule S=r1(A); r2(B) ; w2(A); w1(B) Which of the following is true?… Read More »

The set of attributes X will be fully functionally dependent on the set of attributes Y if the following conditions are satisfied. (A) X is… Read More »

Immunity of the external schemas (or application programs) to changes in the conceptual schema is referred to as: (A) Physical Data Independence (B) Logical Data… Read More »

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 (A) R… Read More »

Perform window to viewport transformation for the point (20, 15). Assume that (Xwmin, Ywmin) is (0,0); (Xwmax, Ywmax) is (100,100); (Xvmin, Yvmin) is (5,5); (Xvmax,… Read More »

The number of edges in a regular graph of degree d and n vertices is (A) maximum of n and d (B) n + d… Read More »

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… Read More »

A hash table with 10 buckets with one slot per bucket is depicted here. The symbols, S1 to 57 are initially entered using a hashing… Read More »

Disk requests come to a disk driver for cylinders in the order 10, 22, 20, 2, 40, 6, and 38 at a time when the… Read More »

A computer has 1000 K of main memory. The jobs arrive and finish in the sequence Job 1 requiring 200 K arrives Job 2 requiring… Read More »

Consider a system having m resources of the same type. These resources are shared by 3 processes A, B, C which have peak time demands… Read More »