GATE CS 2012

Question 51

Wanted Temporary, Part-time persons for the post of Field Interviewer to conduct personal interviews to collect and collate economic data. Requirements: High School-pass, must be available for Day, Evening and Saturday work. Transportation paid, expenses reimbursed. Which one of the following is the best inference from the above advertisement?

• Gender-discriminatory

• Xenophobic

• Not designed to make the post attractive

• Not gender-discriminatory

Question 52

A political party orders an arch for the entrance to the ground in which the annual convention is being held. The profile of the arch follows the equation y = 2x – 0.1x² where y is the height of the arch in meters. The maximum possible height of the arch is

• 8 meters
• 10 meters
• 12 meters
• 14 meters

Question 53

An automobile plant contracted to buy shock absorbers from two suppliers X and Y. X supplies 60% and Y supplies 40% of the shock absorbers. All shock absorbers are subjected to a quality test. The ones that pass the quality test are considered reliable. Of X’s shock absorbers, 96% are reliable. Of Y’s shock absorbers, 72% are reliable. The probability that a randomly chosen shock absorber, which is found to be reliable, is made by Y is

• 0.288
• 0.334
• 0.667
• 0.720

Question 54

Which of the following assertions are CORRECT? P: Adding 7 to each entry in a list adds 7 to the mean of the list Q: Adding 7 to each entry in a list adds 7 to the standard deviation of the list R: Doubling each entry in a list doubles the mean of the list S: Doubling each entry in a list leaves the standard deviation of the list unchanged

• P, Q
• Q, R
• P, R
• R, S

Question 55

Given the sequence of terms, AD CG FK JP, the next term is

• OV

• OW

• PV

• PW

Question 56

Which of the followings is/are automatically added to every class, if we do not write our own.

• Copy Constructor
• Assignment Operator
• A constructor without any parameter
• All of the above

Question 57

Consider a source computer(S) transmitting a file of size 10⁶ bits to a destination computer(D)over a network of two routers (R₁ and R₂) and three links(L₁, L₂, and L₃). L₁connects S to R₁; L₂ connects R₁ to R₂; and L₃ connects R₂ to D.Let each link be of length 100 km. Assume signals travel over each link at a speed of 10⁸ meters per second.Assume that the link bandwidth on each link is 1Mbps. Let the file be broken down into 1000 packets each of size 1000 bits. Find the total sum of transmission and propagation delays in transmitting the file from S to D?

• 1005 ms
• 1010 ms
• 3000 ms
• 3003 ms

Question 58

Consider the following transactions with data items P and Q initialized to zero:

T1: read (P) ;
    read (Q) ;
    if P = 0 then Q : = Q + 1 ;
    write (Q) ;
T2: read (Q) ;
    read (P) ;
    if Q = 0 then P : = P + 1 ;
    write (P) ;

Any non-serial interleaving of T1 and T2 for concurrent execution leads to

• A serializable schedule

• A schedule that is not conflict serializable

• A conflict serializable schedule

• A schedule for which a precedence graph cannot be drawn

Question 59

Table A
Id   Name    Age
----------------
12   Arun    60
15   Shreya  24
99   Rohit   11


Table B
Id   Name   Age
----------------
15   Shreya  24
25   Hari    40
98   Rohit   20
99   Rohit   11


Table C
Id   Phone  Area
-----------------
10   2200   02  
99   2100   01

Consider the above tables A, B and C. How many tuples does the result of the following SQL query contains?

SELECT A.id 
FROM   A 
WHERE  A.age > ALL (SELECT B.age 
                    FROM   B 
                    WHERE  B. name = "arun") 

• 4
• 3
• 0
• 1

Question 60

Consider the following code:

C++

int a, b, c = 0;

void prtFun(void);

void main()
{
    static int a = 1;
    prtFun();
    a += 1;
    prtFun() printf("\n %d %d ", a, b);
}

void prtFun(void)
{
    static int a = 2;
    int b = 1;
    a += ++b;
    printf("\n %d %d ", a, b);
}

What output will be generated by the given code d\\segment if: 
Line 1 is replaced by “auto int a = 1;” 
Line 2 is replaced by “register int a = 2;” (GATE CS 2012) 

• 3 1
  
  4 1
  
  4 2
  
  

• 4 2
  
  6 1
  
  6 1
  
  

• 4 2
  
  6 2
  
  2 0
  
  

• 4 2
  
  4 2
  
  2 0