GATE CS 2011

Question 41

An application loads 100 libraries at start-up. Loading each library requires exactly one disk access. The seek time of the disk to a random location is given as 10 ms. Rotational speed of disk is 6000 rpm. If all 100 libraries are loaded from random locations on the disk, how long does it take to load all libraries? (The time to transfer data from the disk block once the head has been positioned at the start of the block may be neglected)

• 0.50 s
• 1.50 s
• 1.25 s
• 1.00 s

Question 42

A deterministic finite automation (DFA)D with alphabet {a,b} is given below Which of the following finite state machines is a valid minimal DFA which accepts the same language as D?

• A
• B
• C
• D

Question 43

The following is the comment written for a C function.

 
        /* This function computes the roots of a quadratic equation
           a.x^2 + b.x + c = . The function stores two real roots
           in *root1 and *root2 and returns the status of validity
           of roots. It handles four different kinds of cases.
           (i) When coefficient a is zero irrespective of discriminant
           (ii) When discriminant is positive
           (iii) When discriminant is zero
           (iv) When discriminant is negative.
           Only in case (ii) and (iii) the stored roots are valid.
           Otherwise 0 is stored in roots. The function returns
           0 when the roots are valid and -1 otherwise.
           The function also ensures root1 >= root2
              int get_QuadRoots( float a, float b, float c,
                 float *root1, float *root2);
        */

A software test engineer is assigned the job of doing black box testing. He comes up with the following test cases, many of which are redundant. 

[caption width="800"] [/caption]

 Which one of the following option provide the set of non-redundant tests using equivalence class partitioning approach from input perspective for black box testing?

• T1,T2,T3,T6

• T1,T3,T4,T5

• T2,T4,T5,T6

• T2,T3,T4,T5

Question 44

Consider the following recursive C++ function that takes two arguments 

C++

 unsigned int foo(unsigned int n, unsigned int r) {
  if (n  > 0) return (n%r +  foo (n/r, r ));
  else return 0;
}

What is the return value of the function foo when it is called foo(345, 10)?

• 345

• 12

• 5

• 3