GATE-CS-2016 (Set 1)

A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of size 1000 bytes and the transmission rate at the sender is 80 Kbps (1Kbps = 1000 bits/second). Size of an acknowledgement is 100 bytes and the transmission rate at the receiver is 8 Kbps. The one-way propagation delay is 100 milliseconds.

Assuming no frame is lost, the sender throughput is __________ bytes/second.

The worst case running times of Insertion sort, Merge sort and Quick sort, respectively, are:

The following function computes the maximum value contained in an integer array p[] of size n (n >= 1) 
 

int max(int *p, int n)
{
    int a=0, b=n-1;
    while (__________)
    {
        if (p[a] <= p[b])
        {
            a = a+1;
        }
        else
        {
            b = b-1;
        }
    }
    return p[a];
}

The missing loop condition is
 

Consider the following C program. 

#include<stdio.h>
void mystery(int *ptra, int *ptrb) 
{
   int *temp;
   temp = ptrb;
   ptrb = ptra;
   ptra = temp;
}
int main() 
{
    int a=2016, b=0, c=4, d=42;
    mystery(&a, &b);
    if (a < c)
       mystery(&c, &a);
    mystery(&a, &d);
    printf("%d", a);
}

The output of the program _____________   Note : This question was asked as Numerical Answer Type.

Consider a computer system with ten physical page frames. The system is provided with an access sequence a1, a2, ..., a20, a1, a2, ..., a20), where each ai number. The difference in the number of page faults between the last-in-first-out page replacement policy and the optimal page replacement policy is __________ [Note that this question was originally Fill-in-the-Blanks question]

Consider a computer system with 40-bit virtual addressing and page size of sixteen kilobytes. If the computer system has a one-level page table per process and each page table entry requires 48 bits, then the size of the per-process page table is _________megabytes.   Note : This question was asked as Numerical Answer Type.

Consider the following C program.

void f(int, short);
void main()
{
  int i = 100;
  short s = 12;
  short *p = &s;
  __________ ;   // call to f()
}

Which one of the following expressions, when placed in the blank above, will NOT result in a type checking error?

Consider a disk queue with requests for I/O to blocks on cylinders 47, 38, 121, 191, 87, 11, 92, 10. The C-LOOK scheduling algorithm is used. The head is initially at cylinder number 63, moving towards larger cylinder numbers on its servicing pass. The cylinders are numbered from 0 to 199. The total head movement (in number of cylinders) incurred while servicing these requests is:   Note : This question was asked as Numerical Answer Type.

Consider the recurrence relation a₁ = 8, a_n = 6n² + 2n + a_n-1. Let a₉₉ = k x 10⁴. The value of K is _____

 
Note : This question was asked as Numerical Answer Type.

What will be the output of the following JAVA program? 

#include <iostream>
using namespace std;

static int d = 1;

void count(int n) {
    cout << n << " ";
    cout << d << " ";
    d++;
    if(n > 1) count(n - 1);
    cout << d << " ";
}

int main() {
    count(3);
    return 0;
}

#include <stdio.h>

static int d = 1;

void count(int n) {
    printf("%d ", n);
    printf("%d ", d);
    d++;
    if(n > 1) count(n - 1);
    printf("%d ", d);
}

int main() {
    count(3);
    return 0;
}

class GFG
{
   static int d=1;
   static void count(int n)
    {
    System.out.print(n+" ");
    System.out.print(d+" ");
    d++;
    if(n > 1) count(n-1);
    System.out.print(d+" ");
  }

 public static void main(String args[])
    {
       count(3);
    }
}

d = 1

def count(n):
    global d
    print(n, end=' ')
    print(d, end=' ')
    d += 1
    if n > 1:
        count(n - 1)
    print(d, end=' ')

count(3)

let d = 1;

function count(n) {
    process.stdout.write(n + ' ');
    process.stdout.write(d + ' ');
    d++;
    if (n > 1) count(n - 1);
    process.stdout.write(d + ' ');
}

count(3);