GATE-CS-2017 (Set 2)

Consider the following function implemented in C:

void printxy(int x, int y)
{
    int *ptr;
    x = 0;
    ptr = &x;
    y = *ptr;
    *ptr = 1;
    printf("%d,%d", x, y);
}

The output of the printxy(1,1) is

Consider the following snippet of a C program. Assume that swap(&x, &y) exchanges the contents of x and y.

int main()
{
    int array[] = {3, 5, 1, 4, 6, 2};
    int done = 0;
    int i;

    while (done == 0)
    {
        done  = 1;
        for (i = 0; i <= 4; i++)
        {
            if (array[i] < array[i+1])
            {
                swap(&array[i], &array[i+1]);
                done = 0;
            }
        }
        for (i = 5; i >= 1; i--)
        {
            if (array[i] > array[i-1])
            {
                swap(&array[i], &array[i-1]);
                done = 0;
            }
        }
    }

    printf("%d", array[3]);
}

The output of the program is _____. Note: This question appeared as Numerical Answer Type.

In a two-level cache system, the access times of L₁ and L₂ 1 and 8 clock cycles, respectively. The miss penalty from the L₂ cache to main memory is 18 clock cycles. The miss rate of L₁ cache is twice that of L₂. The average memory access time(AMAT) of this cache system is 2 cycles. The miss rates of L₁ and L₂ respectively are:

Consider the following C function.

int fun(int n)
{
    int i, j;
    for (i = 1; i <= n ; i++)
    {
        for (j = 1;  j < n; j += i)
        {
            printf("%d %d", i, j);
        }
    }
}

Time complexity of fun in terms of θ notation is:

Consider the following languages.
L₁ = {a^p | p is a prime number}
L₂ = {aⁿb^mc^2m | n >= 0, m >= 0}
L₃ = {aⁿbⁿc²ⁿ | n >= 0}
L₄ = {aⁿbⁿ | n >= 1}

Which of the following are CORRECT ?
I. L₁ is context free but not regular.
II. L₂ is not context free.
III. L₃ is not context free but recursive.
IV. L₄ is deterministic context free.

Consider the set of processes with arrival time(in milliseconds), CPU burst time (in milliseconds), and priority(0 is the highest priority) shown below. None of the processes have I/O burst time.



The average waiting time (in milliseconds) of all the processes using preemptive priority scheduling algorithm is ____.




Note: This question appeared as Numerical Answer Type.

The pre-order traversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the post-order traversal of this tree is:

If w, x, y, z are boolean variables, then which of the following in INCORRECT?

Consider two hosts X and Y, connected by a single direct link of rate 10⁶ bits/sec. The distance between the two hosts is 10,000 km and the propagation speed along the link is 2 x 10⁸ m/s. Hosts X send a file of 50,000 bytes as one large message to hosts Y continuously. Let the transmission and propagation delays be p milliseconds and q milliseconds, respectively. Then the vales of p and q are:

Consider the following C program:

#include 
int main()
{
    int m = 10;
    int n, n1;
    n = ++m;
    n1 = m++;
    n--;
    --n1;
    n -= n1;
    printf("%d",n);
    return 0;
}

The output of the program is ______.

Note:

This questions appeared as Numerical Answer Type.