There are n unsorted arrays : A₁, A₂, …, A_n. Assume that n is odd. Each of A₁, A₂, …, A_n contains n distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of A₁, A₂, …, A_n is :

Consider the following grammar and the semantic actions to support the inherited type declaration attributes. Let $X_1, X_2, X_3, X_4, X_5$, and $X_6$ be the placeholders for the nonterminals $\mathrm{D}, \mathrm{T}, \mathrm{L}$ or $\mathrm{L}_1$ in the following table :

Which one of the following are the appropriate choices for $X_1, X_2, X_3$ and $X_4$ ?

Consider three machines M, N, and P with IP addresses 100.10.5.2, 100.10.5.5, and 100.10.5.6 respectively. The subnet mask is set to 255.255 .255 .252 for all the three machines. Which one of the following is true?

Suppose that in an IP-over-Ethernet network, a machine X wishes to find the MAC address of another machine Y in its subnet. Which one of the following techniques can be used for this?

SELECT S.Student_name, sum (P.Marks)
       FROM Student S, Performance P
       WHERE P.Marks > 84
       GROUP BY S.Student_name;

Let G be any connected, weighted, undirected graph.

I. G has a unique minimum spanning tree, if no two edges of G have the same weight.

II. G has a unique minimum spanning tree, if, for every cut of G, there is a unique minimum-weight edge crossing the cut.

Which of the above two statements is/are TRUE?

Consider the following matrix :

$$ R=\left[\begin{array}{cccc} 1 & 2 & 4 & 8 \\ 1 & 3 & 9 & 27 \\ 1 & 4 & 16 & 64 \\ 1 & 5 & 25 & 125 \end{array}\right] $$

The absolute value of the product of Eigen values of $R$ is ___________.

         #include < unistd.h >
            int main ()
            {
                  int i ;
                  for (i=0; i<10; i++)
                         if (i%2 == 0) fork ( ) ;
                  return 0 ;
            }

Assume that in a certain computer, the virtual addresses are 64 bits long and the physical addresses are 48 bits long. The memory is word addressable. The page size is 8 kB and the word size is 4 bytes. The Translation Look-aside Buffer (TLB) in the address translation path has 128 valid entries. At most how many distinct virtual addresses can be translated without any TLB miss?

        #include < stdio.h >
         int jumble (int x, int y)  {
               x = 2 * x + y ;
               return x ;
         }
         int main ( )  {
               int x=2, y=5 ;
               y = jumble (y, x) ;
               x = jumble (y, x) ;
               printf ("%d \n", x) ;
               return 0 ;
         }

       #include < stdio.h >
       int main()
       {
           int a[] = {2, 4, 6, 8, 10} ;
           int i, sum = 0, *b = a + 4 ;
           for (i = 0; i < 5; i++)
                 sum = sum + (*b - i) - *(b - i) ;
           printf ("%d\n", sum) ;
           return 0 ;
        }

#include < stdio.h >
 int main ()  {
            int arr [] = {1,2,3,4,5,6,7,8,9,0,1,2,5}, *ip = arr+4;
             printf ("%d\n", ip[1]);
             return 0;
}

Consider the following C function.

void convert(int n){

    if(n < 0)

        printf("%d",n);

    else {

        convert(n/2);

        printf("%d",n%2);

    }

}

Which one of the following will happen when the function convert is called with any positive integer n as argument?

Consider the following C program :

#include<stdio.h>

int r()

{

        static int num=7;

        return num--;

}

int main()

{

        for(r();r();r())

        printf("%od ",r());

        return 0;

}

Which one of the following values will be displayed on execution of the programs?

Consider the following C program :

#include <stdio.h>

int main(){

    float sum = 0.0, j = 1.0, i = 2.0;

    while (i/j > 0.0625){

        j = j + j;

        sum = sum + i/j;

        printf("%f\n", sum);

    }

    return 0;

}

The number of times the variable sum will be printed, when the above program is executed, is _________.

Which one of the following languages over $\Sigma=\{a, b\}$ is NOT context-free?

Consider the following sets :

S1. Set of all recursively enumerable languages over the alphabet $\{0,1\}$

S2. Set of all syntactically valid C programs

S3. Set of all languages over the alphabet $\{0,1\}$

S4. Set of all non-regular languages over the alphabet $\{0,1\}$

Which of the above sets are uncountable?