All 65 questions of GATE 2015 CS (Set 3)

Extreme focus on syllabus and studying for tests has become such a dominant concern of Indian students that they close their minds to anything __________ to the requirements of the exam.

The Tamil version of __________ John Abraham-starrer Madras Cafe __________ cleared by the Censor Board with no cuts last week, but the film's distributors __________ no takers among the exhibitors for a release in Tamil Nadu __________ this Friday.

A function $f(x)$ is linear and has a value of 29 at $x=-2$ and 39 at $x=3$. Find its value at $x=5$.

If ROAD is written as URDG, then SWAN should be written as:

Select the pair that best expresses a relationship similar to that expressed in the pair:

Children : Pediatrician

Alexander turned his attention towards India, since he had conquered Persia.

Which one of the statements below is logically valid and can be inferred from the above sentence?

Most experts feel that in spite of possessing all the technical skills required to be a batsman of the highest order, he is unlikely to be so due to lack of requisite temperament. He was guilty of throwing away his wicket several times after working hard to lay a strong foundation. His critics pointed out that until he addressed this problem, success at the highest level will continue to elude him.

Which of the statement(s) below is/are logically valid and can be inferred from the above passage?

(i) He was already a successful batsman at the highest level.
(ii) He has to improve his temperament in order to become a great batsman.
(iii) He failed to make many of his good starts count.
(iv) Improving his technical skills will guarantee success.

The head of a newly formed government desires to appoint five of the six selected members P, Q, R, S, T, and U to portfolios of Home, Power, Defense, Telecom, and Finance. U does not want any portfolio if S gets one of the five. R wants either Home or Finance or no portfolio. Q says that if S gets either Power or Telecom, then she must get the other one. T insists on a portfolio if P gets one.

Which is the valid distribution of portfolios?

The exports and imports (in crores of Rs.) of a country from the year 2000 to 2007 are given in the following bar chart. In which year is the combined percentage increase in imports and exports the highest?

(Answer in integer)

Choose the most appropriate equation for the function drawn as a thick line, in the plot below.

In a room there are only two types of people, namely Type 1 and Type 2. Type 1 people always tell the truth and Type 2 people always lie. You give a fair coin to a person in that room, without knowing which type he is from and tell him to toss it and hide the result from you till you ask for it.

Upon asking, the person replies the following:

“The result of the toss is head if and only if I am telling the truth.”

Which of the following options is correct?

Consider a software project with the following information domain characteristics for calculation of function point metric.

• Number of external inputs $(I) = 30$
• Number of external outputs $(O) = 60$
• Number of external enquiries $(E) = 23$
• Number of files $(F) = 08$
• Number of external interfaces $(N) = 02$

It is given that the complexity weighting factors for $I, O, E, F$ and $N$ are 4, 5, 4, 10 and 7, respectively. It is also given that, out of fourteen value adjustment factors that influence the development effort, four factors are not applicable, each of the other factors have value 3, and each of the remaining factors have value 4. The computed value of function point metric is __________.

Let # be a binary operator defined as

where $X$ and $Y$ are Boolean variables.

Consider the following two statements:

Which of the following is/are true for the Boolean variables $P,Q$ and $R$?

The number of 4 digit numbers having their digits in non-decreasing order from left to right, constructed using the digits belonging to the set $\{1,2,3\}$, is __________.

The value of

is

Let $L$ be the language represented by the regular expression

where $\Sigma = \{0,1\}$. What is the minimum number of states in a DFA that recognizes $\overline{L}$, the complement of $L$?

Consider a machine with a byte addressable main memory of $2^{20}$ bytes, block size of 16 bytes and a direct mapped cache having $2^{12}$ cache lines. Let the addresses of two consecutive bytes in main memory be $(E201F)_{16}$ and $(E2020)_{16}$. What are the tag and cache line address in hex for main memory address $(E201F)_{16}$?

Consider a CSMA/CD network that transmits data at a rate of 100 Mbps $(10^8$ bits per second) over a 1 km cable with no repeaters. If the minimum frame size required for this network is 1250 bytes, what is the signal speed in km/sec in the cable?

Consider a software program that is artificially seeded with 100 faults. While testing this program, 159 faults are detected, out of which 75 faults are from those artificially seeded faults. Assuming that both real and seeded faults are of same nature and have same distribution, the estimated number of undetected real faults is __________.

Consider a binary tree $T$ that has 200 leaf nodes. Then, the number of nodes in $T$ that have exactly two children are __________.

Consider the following C program segment.

#include <stdio.h>

int main()
{
    char s1[7] = "1234", *p;
    p = s1 + 2;
    *p = '\0';
    printf("%s", s1);
}

What will be printed by the program?

The result evaluating the postfix expression

10 5 + 60 6 / * 8 -

is

In the given matrix

one of the eigenvalues is 1. The eigenvectors corresponding to the eigenvalue 1 are

While inserting the elements 71, 65, 84, 69, 67, 83 in an empty binary search tree (BST) in the sequence shown, the element in the lowest level is

In a web server, ten webpages are stored with the URLs of the form http://www.yourname.com/var.html, where var is a different number from 1 to 10 for each webpage. Suppose the client stores the webpage with var = 1 locally, edits and then tests. Rest of the webpages remains on the web server. W1 contains several relative URLs of the form ...var.html referring to the other webpages.

Which one of the following statements needs to be added in W1, so that all the relative URLs in W1 refer to the appropriate webpages on the web server?

Consider the following relation:

Which of the following options will be needed at the end of the SQL query

SELECT P1.address
FROM Cinema P1

such that it always finds the addresses of theaters with maximum capacity?

Consider the equality

and the following choices for $X$:

I. $\Theta(n^4)$
II. $\Theta(n^5)$
III. $O(n^5)$
IV. $\Omega(n^3)$

The equality above remains correct if $X$ is replaced by

Among simple LR (SLR), canonical LR, and look-ahead LR (LALR), which of the following pairs identify the method that is very easy to implement and the method that is the most powerful, in that order?

The maximum number of processes that can be in Ready state for a computer system with $n$ CPUs is

Two processes $X$ and $Y$ need to access a critical section. Consider the following synchronization construct used by both the processes.

/* Process X */
while (true) {
    varP = true;
    while (varQ == true) {
        /* Critical Section */
        varP = false;
    }
}

/* Process Y */
while (true) {
    varQ = true;
    while (varP == true) {
        /* Critical Section */
        varQ = false;
    }
}

Here, varP and varQ are shared variables and both are initialized to false. Which one of the following statements is true?

Consider the following array of elements:

The minimum number of interchanges needed to convert it into a max-heap is

Given a hash table $T$ with 25 slots that stores 2000 elements, the load factor $\alpha$ for $T$ is __________.

Consider the relation $X(P,Q,R,S,T,U)$ with the following set of functional dependencies:

Which of the following is the trivial functional dependency in $F^+$, where $F^+$ is the closure of $F$?

Consider the following statements.

I. TCP connections are full duplex.
II. TCP has no option for selective acknowledgement.
III. TCP connections are message streams.

Which of the following is correct?

Suppose $U$ is the power set of the set $S = \{1,2,3,4,5,6\}$. For any $T \in U$, let $|T|$ denote the number of elements in $T$ and $T'$ denote the complement of $T$. For any $T, R \in U$, let $T \setminus R$ be the set of all elements in $T$ which are not in $R$.

Which one of the following is true?

Consider the following policies for preventing deadlock in a system with mutually exclusive resources.

I. Processes should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released.
II. The resources are numbered uniquely, and processes are allowed to request resources only in increasing resource numbers.
III. The resources are numbered uniquely, and processes are allowed to request resources only in decreasing resource numbers.
IV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources.

Which of the above policies can be used for preventing deadlock?

Suppose $X_i$ for $i=1,2,3$ are independent and identically distributed random variables whose probability mass functions are

for $i=1,2,3$. Define another random variable

where $\oplus$ denotes XOR. Then

__________.

Consider the following grammar $G$:

where $S,F,H$ are non-terminal symbols, and $p,d,c$ are terminal symbols. Which of the following statement(s) is/are correct?

S1. LL(1) can parse all strings that are generated using grammar $G$.
S2. LR(1) can parse all strings that are generated using grammar $G$.

Consider a B+ tree in which the search key is 12 bytes long, block size is 1024 bytes, record pointer is 10 bytes long and block pointer is 8 bytes long. The maximum number of keys that can be accommodated in each non-leaf node of the tree is __________.

Consider the following reservation table for a pipeline having three stages $S_1$, $S_2$ and $S_3$.

The minimum average latency (MAL) is __________.

Assume that a mergesort algorithm in the worst case takes 30 seconds for an input of size 64. Which of the following most closely approximates the maximum input size of a problem that can be solved in 6 minutes?

Consider the following partial schedule $S$ involving two transactions $T1$ and $T2$. Only the read and write operations are shown. The read operation on data item $P$ is denoted by read(P) and the write operation on data item $P$ is denoted by write(P).

Suppose that transaction $T1$ fails immediately after time instance 9. Which one of the following statements is correct?

Language $L_1$ is polynomial-time reducible to language $L_2$. Language $L_3$ is polynomial-time reducible to $L_2$, which in turn is polynomial-time reducible to language $L_4$. Which of the following is/are true?

I. If $L_4 \in P$, then $L_2 \in P$
II. If $L_1 \in P$ or $L_3 \in P$, then $L_2 \in P$
III. $L_1 \in P$ if and only if $L_3 \in P$
IV. If $L_4 \in P$, then $L_1 \in P$ and $L_3 \in P$

Consider the following code sequence having five instructions $I_1$ to $I_5$. Each instruction has the following format:

OP Ri, Rj, Rk

where operation OP is performed on contents of registers Rj and Rk, and the result is stored in register Ri.

I1: ADD R1, R2, R3
I2: MUL R7, R1, R3
I3: SUB R4, R1, R5
I4: ADD R3, R2, R4
I5: MUL R7, R8, R9

Consider the following statements:

S1: There is an anti-dependence between instructions $I_2$ and $I_5$.
S2: There is an anti-dependence between instructions $I_2$ and $I_4$.
S3: Within an instruction pipeline, an anti-dependence always creates one or more stalls.

Which one of the above statements is/are correct?

Consider the equation

where $x$ and $y$ are unknown. The number of possible solutions is __________.

Which of the following languages are context-free?

In the network 200.10.11.144/27, the fourth octet in decimal of the last IP address of the network which can be assigned to a host is __________.

If for non-zero $x$,

where $a \ne b$, then

is

Suppose $c = \langle c[0],\ldots,c[k-1]\rangle$ is an array of length $k$, where all entries are from the set $\{0,1\}$. For any positive integers $a$ and $n$, consider the following pseudocode.

DOSOMETHING(c,a,n)
z <- 1
for i <- 0 to k-1
    do z <- z^2 mod n
       if c[i] = 1
          then z <- (z * a) mod n
return z

If $k=4$, $c=\langle 1,0,1,1\rangle$, $a=2$ and $n=8$, then the output of DOSOMETHING(c,a,n) is __________.

Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of 20 microseconds. The switch begins forwarding a packet 35 microseconds after it receives the same. If 10000 bits of data are to be transmitted between the two hosts using a packet size of 5000 bits, the time elapsed between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is __________.

If the following system has non-trivial solution,

then which one of the following options is TRUE?

Let $G$ be a connected undirected graph of 100 vertices and 300 edges. The weight of a minimum spanning tree of $G$ is 500. When the weight of each edge of $G$ is increased by five, the weight of a minimum spanning tree becomes __________.

The total number of prime implicants of the function

is __________.

Given the function

where $F$ is a function in three Boolean variables $P,Q,R$ and $P' = \neg P$, consider the following statements:

Which of the following is true?

Consider the following C program.

#include <stdio.h>
int main()
{
    int i, j, k = 0;
    j = 2 * 3 / 4 + 2.0 / 5 + 8 / 5;
    k -= --j;
    for (i = 0; i < 5; i++)
    {
        switch(i + k)
        {
            case 1:
            case 2: printf("\n%d", i+k);
            case 3: printf("\n%d", i+k);
            default: printf("\n%d", i+k);
        }
    }
    return 0;
}

The number of times printf statement is executed is __________.

Let $f(n)=n$ and $g(n)=n^{(1+\sin n)}$, where $n$ is a positive integer. Which of the following statements is/are correct?

I. $f(n)=O(g(n))$
II. $f(n)=\Omega(g(n))$

For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?

Consider the following C program.

#include <stdio.h>
int main()
{
    static int a[] = {10, 20, 30, 40, 50};
    static int *p[] = {a, a+3, a+4, a+1, a+2};
    int **ptr = p;
    ptr++;
    printf("%d%d", ptr-p, **ptr);
}

The output of the program is __________.

Consider a network connecting two systems located 8000 kilometers apart. The bandwidth of the network is $500 \times 10^6$ bits per second. The propagation speed of the media is $4 \times 10^6$ meters per second. It is needed to design a Go-Back-N sliding window protocol for this network. The average packet size is $10^7$ bits. The network is to be used to its full capacity. Assume that processing delays at nodes are negligible.

Then, the minimum size in bits of the sequence number field has to be __________.

Consider the following recursive C function.

void get(int n)
{
    if (n < 1) return;
    get(n-1);
    get(n-3);
    printf("%d", n);
}

If get(6) is called in main(), then how many times will the get() function be invoked before returning to main()?

Consider the following C program.

#include <stdio.h>
int f1(void);
int f2(void);
int f3(void);
int x = 10;

int main()
{
    int x = 1;
    x += f1() + f2() + f3() + f2();
    printf("%d", x);
    return 0;
}

int f1() { int x = 25; x++; return x; }
int f2() { static int x = 50; x++; return x; }
int f3() { x *= 10; return x; }

The output of the program is __________.

Consider the following two C code segments. Y and X are one and two dimensional arrays of size $n$ and $n \times n$ respectively, where $2 \le n \le 10$. Assume that in both code segments, elements of Y are initialized to 0 and each element X[i][j] of array X is initialized to i+j. Further assume that when stored in main memory, all elements of X are in the same main memory page frame.

Code segment 1:

for (i = 0; i < n; i++)
    Y[i] += X[0][i];

Code segment 2:

for (i = 0; i < n; i++)
    Y[i] += X[i][0];

Which of the following statements is/are correct?

S1: Final contents of array Y will be same in both code segments.
S2: Elements of array X accessed inside the loop shown in code segment 1 are contiguous in main memory.
S3: Elements of array X accessed inside the loop shown in code segment 2 are contiguous in main memory.

Let $R$ be a relation on the set of ordered pairs of positive integers such that $((p,q),(r,s)) \in R$ if and only if $p-s=q-r$. Which one of the following is true about $R$?

The velocity $v$ in kilometer/minute of a motorbike which starts from rest is given at fixed intervals of time $t$ in minutes as follows:

The approximate distance in kilometers rounded to two places of decimal covered in 20 minutes using Simpson’s $1/3$ rule is __________.

Consider three software items: Program-X, Control Flow Diagram of Program-Y and Control Flow Diagram of Program-Z as shown below.

The values of McCabe’s cyclomatic complexity of Program-X, Program-Y, and Program-Z respectively are: