GATE Computer Science & IT 2012 — GATE 2012 · CS

Consider the following logical inferences.

I1: If it rains then the cricket match will not be played.
 The cricket match was played.
Inference: There was no rain.
I2: If it rains then the cricket match will not be played.
 It did not rain.
Inference: The cricket match was played.

Which of the following is TRUE?

Which of the following is TRUE?

What will be the output of the following C program segment?

char inChar = 'A';
switch (inChar) {
    case 'A': printf("Choice A\n");
    case 'B':
    case 'C': printf("Choice B");
    case 'D':
    case 'E':
    default: printf(" No Choice");
}

Assuming P ≠ NP, which of the following is TRUE?

The worst case running time to search for an element in a balanced binary search tree with $n2^n$ elements is

The truth table

represents the Boolean function

The decimal value 0.5 in IEEE single precision floating point representation has

A process executes the code

fork();
fork();
fork();

The total number of child processes created is

Consider the function f(x) = sin(x) on the interval x ∈ [π/4, 7π/4]. The number and location(s) of the local minima of this function are

The protocol data unit (PDU) for the application layer in the Internet stack is

Let A be the 2 × 2 matrix with elements a11 = a12 = a21 = +1 and a22 = −1. Then the eigenvalues of the matrix A19 are

What is the complement of the language accepted by the NFA shown below? Assume $\sum = \{a\}$ and $\varepsilon$ is the empty string

What is the correct translation of the following statement into mathematical logic?

“Some real numbers are rational”

Given the basic ER and relational models, which of the following is INCORRECT?

Which of the following statements are TRUE about an SQL query?

P : An SQL query can contain a HAVING clause even if it does not have a GROUP BY clause

Q: An SQL query can contain a HAVING clause only if it has a GROUP BY clause

R : All attributes used in the GROUP BY clause must appear in the SELECT clause

S : Not all attributes used in the GROUP BY clause need to appear in the SELECT clause

The recurrence relation capturing the optimal execution time of the Towers of Hanoi problem with $n$ discs is

Let G be a simple undirected planar graph on 10 vertices with 15 edges. If G is a connected graph, then the number of bounded faces in any embedding of G on the plane is equal to

Let ​$W(n)$ and $A(n)$ denote respectively, the worst case and average case running time of an algorithm executed on an input of size $n$. Which of the following is ALWAYS TRUE?

The amount of ROM needed to implement a 4-bit multiplier is:

Register renaming is done in pipelined processors –

Consider a random variable $X$ that takes values +1 and −1 with probability 0.5 each. The values of the cumulative distribution function $F(x)$ at $x$ = −1 and +1 are

Which of the following transport-layer protocols is used to support electronic mail?

In the IPv4 addressing format, the number of networks allowed under Class C addresses is

Which of the following problems are decidable?

1) Does a given program ever produce an output?
2) If $L$ is a context-free language, then, is $\overline L$ also context-free?
3) If $L$ is a regular language, then, is $\overline L$ also regular?
4) If $L$ is a recursive language, then, is $\overline L$ also recursive?

Given the language $L = \{ab, aa, baa\}$, which of the following strings are in $L^*$?

(1) abaabaaabaa

(2) aaaabaaaa

(3) baaaaabaaaab

(4) baaaaabaa

Which of the following graphs is isomorphic to

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

The bisection method is applied to compute a zero of the function $f(x) =x ^{4} – x ^{3} – x ^{2} – 4$ in the interval [1,9]. The method converges to a solution after ––––– iterations.

Let $G$ be a weighted graph with edge weights greater than one and $G'$ be the graph constructed by squaring the weights of edges in $G$. Let $T$ and $T'$ be the minimum spanning trees of $G$ and $G'$, respectively, with total weights $t$ and $t'$. Which of the following statements is TRUE?

Assume G is connected and undirected, has at least three vertices, and has pairwise distinct edge weights.

What is the minimal form of the Karnaugh map shown below? Assume that X denotes a don’t care term.

Consider the 3 processes, P1, P2 and P3 shown in the table.

The completion order of the 3 processes under the policies FCFS and RR2 (round robin scheduling with CPU quantum of 2-time units) are

Fetch_And_Add(X,i) is an atomic Read-Modify-Write instruction that reads the value of memory location X, increments it by the value i, and returns the old value of X. It is used in the pseudocode shown below to implement a busy-wait lock. L is an unsigned integer shared variable initialized to 0. The value of 0 corresponds to lock being available, while any non-zero value corresponds to the lock being not available.

AcquireLock(L){
    while (Fetch_And_Add(L,1))
        L = 1;
}

ReleaseLock(L){
    L = 0;
}

This implementation

Suppose a fair six-sided die is rolled once. If the value on the die is 1, 2, or 3, the die is rolled a second time. What is the probability that the sum total of values that turn up is at least 6?

An Internet Service Provider (ISP) has the following chunk of CIDR-based IP addresses available with it: 245.248.128.0/20. The ISP wants to give half of this chunk of addresses to Organization A, and a quarter to Organization B, while retaining the remaining with itself. Which of the following is a valid allocation of addresses to A and B?

Suppose a circular queue of capacity $(n −1)$ elements is implemented with an array of $n$ elements. Assume that the insertion and deletion operations are carried out using REAR and FRONT as array index variables, respectively. Initially, REAR = FRONT = 0. The conditions to detect $queue \ full$ and $\text queue \ empty$ are

Consider the program given below, in a block-structured pseudo-language with lexical scoping and nesting of procedures permitted.

Program main;
  Var ...

  Procedure A1;
    Var ...
    Call A2;
  End A1

  Procedure A2;
    Var ...

    Procedure A21;
      Var ...
      Call A1;
    End A21

    Call A21;
  End A2

  Call A1;
End main.

Consider the calling chain: Main → A1 → A2 → A21 → A1

The correct set of activation records along with their access links is given by

How many onto (or surjective) functions are there from an $n$-element $(n \geq 2)$ set to a 2-element set?

Let G be a complete undirected graph on 6 vertices. If vertices of G are labeled, then the number of distinct cycles of length 4 in G is equal to

A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is

Use standard merge sort with each string comparison scanning characters afresh from the beginning, at unit cost per character comparison. Choose the tightest listed worst-case bound.

Consider the directed graph shown in the figure below. There are multiple shortest paths between vertices S and T. Which one will be reported by Dijkstra’s shortest path algorithm? Assume that, in any iteration, the shortest path to a vertex v is updated only when a strictly shorter path to $v$ is discovered.

A file system with 300 Gbyte disk uses a file descriptor with 8 direct block addresses, 1 indirect block address and 1 doubly indirect block address. The size of each disk block is 128 Bytes and the size of each disk block address is 8 Bytes. The maximum possible file size in this file system is

Consider the virtual page reference string

1, 2, 3, 2, 4, 1, 3, 2, 4, 1

on a demand paged virtual memory system running on a computer system that has main memory size of 3 page frames which are initially empty. Let LRU, FIFO and OPTIMAL denote the number of page faults under the corresponding page replacement policy. Then

Suppose R1(A, B) and R2(C, D) are two relation schemas. Let r1 and r2 be the corresponding relation instances. B is a foreign key that refers to C in R2. If data in r1 and r2 satisfy referential integrity constraints, which of the following is ALWAYS TRUE?

Consider a source computer (S) transmitting a file of size 10^6 bits to a destination computer (D) over a network of two routers (R1 and R2) and three links (L1, L2, and L3). L1 connects S to R1; L2 connects R1 to R2; and L3 connects R2 to D. Let each link be of length 100 km. Assume signals travel over each link at a speed of 10^8 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?

Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of the slow start phase is 2 MSS and the threshold at the start of the first transmission is 8 MSS. Assume that a timeout occurs during the fifth transmission. Find the congestion window size at the end of the tenth transmission.

Treat each transmission as one round. After each successful round, replace cwnd by min(2·cwnd, ssthresh) if cwnd < ssthresh; otherwise increase cwnd by 1 MSS. The timeout ends round 5, sets ssthresh to half the cwnd used in that round, and resets cwnd to 1 MSS. Rounds 6–10 succeed.

Consider the set of strings on {0,1} in which, $every \ substring \ of \ 3 \ symbols$ has at most two zeros. For example, 001110 and 011001 are in the language, but 100010 is not. All strings of length less than 3 are also in the language. A partially completed DFA that accepts this language is shown below

The missing arcs in the DFA are

The height of a tree is defined as the number of edges on the longest path in the tree. The function shown in the pseudocode below is invoked as height(root) to compute the height of a binary tree rooted at the tree pointer root.

int height (treeptr n)
{ if (n == NULL) return -1;
  if (n → left == NULL)
      if (n → right == NULL) return 0;
      else return B1;                    // Box 1
  else { h1 = height (n → left);
         if (n → right == NULL) return (1+h1);
         else { h2 = height (n → right);
                return B2;              // Box 2
              }
       }
}

The appropriate expressions for the two boxes B1 and B2 are

Consider the following C code segment.

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

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

What output will be generated by the given code segment?

Consider the following C code segment.

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

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

What output will be generated by the given code segment if:

Line 1 is replaced by auto int a = 1;

Line 2 is replaced by register int a = 2;

Consider the following relations A, B and C:

How many tuples does the result of the following relational algebra expression contain? Assume that the schema of $A \cup B$ is the same as that of $A$.

$(A\cup B)\bowtie _{A.Id > 40 \vee C.Id < 15} C$

Consider the following relations A, B and C:

How many tuples does the result of the following SQL query contain?

SELECT A.Id
FROM A
WHERE A.Age > ALL (SELECT B.Age
                   FROM B
                   WHERE B.Name = ‘Arun’)

For the grammar below, a partial LL(1) parsing table is also presented along with the grammar. Entries that need to be filled are indicated as E1, E2, and E3. $\varepsilon$ is the empty string, $ indicates end of input, and, | separates alternate right hand sides of productions.

S $\to$ a A b B | b A a B | $\varepsilon$

A $\to$ S

B $\to$ S

The FIRST and FOLLOW sets for the non-terminals A and B are

For the grammar below, a partial LL(1) parsing table is also presented along with the grammar. Entries that need to be filled are indicated as E1, E2, and E3. $\varepsilon$ is the empty string, $ indicates end of input, and, | separates alternate right hand sides of productions.

S $\to$ a A b B | b A a B | $\varepsilon$

A $\to$ S

B $\to$ S

The appropriate entries for E1, E2, and E3 are

A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. The processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit.

The number of bits in the tag field of an address is

A computer has a 256 KByte, 4-way set associative, write back data cache with block size of 32 Bytes. The processor sends 32 bit addresses to the cache controller. Each cache tag directory entry contains, in addition to address tag, 2 valid bits, 1 modified bit and 1 replacement bit.

The size of the cache tag directory is

The cost function for a product in a firm is given by $5q^2$ , where $q$ is the amount of production. The firm can sell the product at a market price of ₹ 50 per unit. The number of units to be produced by the firm such that the profit is maximized is

Choose the most appropriate alternative from the options given below to complete the following sentence:

Despite several ––––––––– the mission succeeded in its attempt to resolve the conflict.

Which one of the following options is the closest in meaning to the word given below?

Mitigate

Choose the grammatically INCORRECT sentence:

Choose the most appropriate alternative from the options given below to complete the following sentence:

Suresh’s dog is the one ––––––––– was hurt in the stampede.

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?

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^{2}$ where $y$ is the height of the arch in meters. The maximum possible height of the arch is

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

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

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