Didn't you buy _____ when you went shopping?

Which of the following options is the closest in meaning to the sentence below?

She enjoyed herself immensely at the party.

Given Set $A = \{2, 3, 4, 5\}$ and Set $B = \{11, 12, 13, 14, 15\}$, two numbers are randomly selected, one from each set. What is the probability that the sum of the two numbers equals $16$?

Based on the given statements, select the most appropriate option to solve the given question.

If two floors in a certain building are $9$ feet apart, how many steps are there in a set of stairs that extends from the first floor to the second floor of the building?

Statements:

I. Each step is $3/4$ foot high
II. Each step is $1$ foot wide

Which one of the following combinations is incorrect?

The number of students in a class who have answered correctly, wrongly, or not attempted each question in an exam, are listed in the table below. The marks for each question are also listed. There is no negative or partial marking.

What is the average of the marks obtained by the class in the examination?

Select the alternative meaning of the underlined part of the sentence.

The chain snatchers took to their heels when the police party arrived.

The given statement is followed by some courses of action. Assuming the statement to be true, decide the correct option.

Statement:

There has been a significant drop in the water level in the lakes supplying water to the city.

Courses of action:

I. The water supply authority should impose a partial cut in supply to tackle the situation.
II. The government should appeal to all the residents through mass media for minimal use of water.
III. The government should ban the water supply in lower areas.

The pie chart below has the breakup of the number of students from different departments in an engineering college for the year 2012. The proportion of male to female students in each department is $5:4$. There are $40$ males in Electrical Engineering. What is the difference between the numbers of female students in the Civil department and the female students in the Mechanical department?

The probabilities that a student passes in Mathematics, Physics and Chemistry are $m, p,$ and $c$ respectively. Of these subjects, the student has $75\%$ chance of passing in at least one, a $50\%$ chance of passing in at least two and a $40\%$ chance of passing in exactly two. Following relations are drawn in $m, p, c$:

Which of the following options is correct?

Match the following:

Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting $n$ ($n \ge 2$) numbers? In the recurrence equations given in the options below, $c$ is a constant.

For any two languages $L_1$ and $L_2$ such that $L_1$ is context-free and $L_2$ is recursively enumerable but not recursive, which of the following is/are necessarily true?

I. $\overline{L_1}$ (complement of $L_1$) is recursive
II. $\overline{L_2}$ (complement of $L_2$) is recursive
III. $\overline{L_1}$ is context-free
IV. $\overline{L_1} \cup L_2$ is recursively enumerable

$\lim_{x \to \infty} x^{1/x}$ is:

If $g(x) = 1 - x$ and $h(x) = \dfrac{x}{x-1}$, then $\dfrac{g(h(x))}{h(g(x))}$ is:

Match the following:

SELECT operation in SQL is equivalent to:

For computers based on three-address instruction formats, each address field can be used to specify which of the following:

(S1) A memory operand
(S2) A processor register
(S3) An implied accumulator register

The following two functions P1 and P2 that share a variable B with an initial value of $2$ execute concurrently.

P1() {
    C = B - 1;
    B = 2 * C;
}

P2() {
    D = 2 * B;
    B = D - 1;
}

The number of distinct values that B can possibly take after the execution is _____.

Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s)?

I. $3, 5, 7, 8, 15, 19, 25$
II. $5, 8, 9, 12, 10, 15, 25$
III. $2, 7, 10, 8, 14, 16, 20$
IV. $4, 6, 7, 9, 18, 20, 25$

The output of the following C program is _____.

#include <stdio.h>

void f1(int a, int b) {
    int c;
    c = a; a = b; b = c;
}

void f2(int *a, int *b) {
    int c;
    c = *a; *a = *b; *b = c;
}

int main() {
    int a = 4, b = 5, c = 6;
    f1(a, b);
    f2(&b, &c);
    printf("%d", c - a - b);
    return 0;
}

Consider a system with byte-addressable memory, 32-bit logical addresses, $4\text{ kilobyte}$ page size and page table entries of $4\text{ bytes}$ each. The size of the page table in the system in megabytes is _____.

Which one of the following is TRUE at any valid state in shift-reduce parsing?

Which one of the following is NOT equivalent to $p \leftrightarrow q$?

Which of the following statements is/are FALSE?

I. XML overcomes the limitations in HTML to support a structured way of organizing content.
II. XML specification is not case sensitive while HTML specification is case sensitive.
III. XML supports user defined tags while HTML uses pre-defined tags.
IV. XML tags need not be closed while HTML tags must be closed.

For a set $A$, the power set of $A$ is denoted by $2^A$. If $A = \{5, \{6\}, \{7\}\}$, which of the following options are TRUE?

I. $\emptyset \in 2^A$
II. $\emptyset \subseteq 2^A$
III. $\{5, \{6\}\} \in 2^A$
IV. $\{5, \{6\}\} \subseteq 2^A$

In one of the pairs of protocols given below, both the protocols can use multiple TCP connections between the same client and the server. Which one is that?

In the LU decomposition of the matrix $\begin{bmatrix} 2 & 2 \\ 4 & 9 \end{bmatrix}$, if the diagonal elements of $U$ are both $1$, then the lower diagonal entry $l_{22}$ of $L$ is _____.

Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are FALSE with respect to the TCP connection?

I. If the sequence number of a segment is $m$, then the sequence number of the subsequent segment is always $m+1$.
II. If the estimated round trip time at any given point of time is $t\text{ sec}$, the value of the retransmission timeout is always set to greater than or equal to $t\text{ sec}$.
III. The size of the advertised window never changes during the course of the TCP connection.
IV. The number of unacknowledged bytes at the sender is always less than or equal to the advertised window.

Consider a 4-bit Johnson counter with an initial value of $0000$. The counting sequence of this counter is:

Suppose that everyone in a group of $N$ people wants to communicate secretly with the $N-1$ others using symmetric key cryptographic system. The communication between any two persons should not be decodable by the others in the group. The number of keys required in the system as a whole to satisfy the confidentiality requirement is:

Which one of the following fields of an IP header is NOT modified by a typical IP router?

What are the worst-case complexities of insertion and deletion of a key in a binary search tree?

A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called:

The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height $5$ are:

The value of the summation is _____.

Consider the following relations:

Student

Performance

Consider the following SQL query:

SELECT S.Student_Name, sum(P.Marks)
FROM Student S, Performance P
WHERE S.Roll_No = P.Roll_No
GROUP BY S.Student_Name

The number of rows that will be returned by the SQL query is _____.

The binary operator $\ne$ is defined by the following truth table:

Which one of the following is true about the binary operator $\ne$?

Consider a LAN with four nodes $S_1, S_2, S_3$ and $S_4$. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A collision is said to have occurred if more than one node transmit in the same slot. The probabilities of generation of a frame in a time slot by $S_1, S_2, S_3$ and $S_4$ are $0.1, 0.2, 0.3$ and $0.4$, respectively. The probability of sending a frame in the first slot without any collision by any of these four stations is _____.

Suppose the following disk request sequence (track numbers) for a disk with $100$ tracks is given: $45, 20, 90, 10, 50, 60, 80, 25, 70$. Assume that the initial position of the R/W head is on track $50$. The additional distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards $100$ when it starts execution) is _____ tracks.

Consider the following C function:

int fun1(int n) {
    int i, j, k, p, q = 0;
    for (i = 1; i < n; ++i) {
        p = 0;
        for (j = n; j > 1; j = j / 2)
            ++p;
        for (k = 1; k < p; k = k * 2)
            ++q;
    }
    return q;
}

Which one of the following most closely approximates the return value of the function fun1?

Consider a max heap, represented by the array:

Now consider that a value $35$ is inserted into this heap. After insertion, the new heap is:

Consider the following pseudo code, where $x$ and $y$ are positive integers:

begin
    q := 0
    r := x
    while r >= y do
    begin
        r := r - y
        q := q + 1
    end
end

The post condition that needs to be satisfied after the program terminates is:

Suppose $L = \{p, q, r, s, t\}$ is a lattice represented by the following Hasse diagram:

For any $x, y \in L$, not necessarily distinct, $x \lor y$ and $x \land y$ are join and meet of $x, y$, respectively. Let $L^3 = \{(x, y, z) : x, y, z \in L\}$ be the set of all ordered triplets of the elements of $L$. Let $p_r$ be the probability that an element $(x, y, z) \in L^3$ chosen equiprobably satisfies $x \lor (y \land z) = (x \lor y) \land (x \lor z)$. Then:

What is the output of the following C code? Assume that the address of x is $2000$ (in decimal) and an integer requires four bytes of memory.

#include <stdio.h>

int main() {
    unsigned int x[4][3] = {
        {1, 2, 3},
        {4, 5, 6},
        {7, 8, 9},
        {10, 11, 12}
    };
    printf("%u, %u, %u", x + 3, *(x + 3), *(x + 2) + 3);
    return 0;
}

Consider the following $2 \times 2$ matrix $A$ where two elements are unknown and are marked by $a$ and $b$. The eigenvalues of this matrix are $-1$ and $7$. What are the values of $a$ and $b$?

A positive edge-triggered D flip-flop is connected to a positive edge-triggered JK flip-flop as follows. The Q output of the D flip-flop is connected to both the J and K inputs of the JK flip-flop, while the Q output of the JK flip-flop is connected to the input of the D flip-flop. Initially, the output of the D flip-flop is set to logic one and the output of the JK flip-flop is cleared. Which one of the following is the bit sequence (including the initial state) generated at the Q output of the JK flip-flop when the flip-flops are connected to a free-running common clock? Assume that $J = K = 1$ is the toggle mode and $J = K = 0$ is the state-holding mode of the JK flip-flop. Both the flip-flops have non-zero propagation delays.

Consider a non-pipelined processor with a clock rate of $2.5\text{ gigahertz}$ and average cycles per instruction of four. The same processor is upgraded to a pipelined processor with five stages; but due to the internal pipeline delay, the clock speed is reduced to $2\text{ gigahertz}$. Assume that there are no stalls in the pipeline. The speed up achieved in this pipelined processor is _____.

Consider the operations:

Which one of the following is correct?

An algorithm performs $(\log N)^{1/2}$ find operations, $N$ insert operations, $(\log N)^{1/2}$ delete operations, and $(\log N)^{1/2}$ decrease-key operations on a set of data items with keys drawn from a linearly ordered set. For a delete operation, a pointer is provided to the record that must be deleted. For the decrease-key operation, a pointer is provided to the record that has its key decreased. Which one of the following data structures is the most suited for the algorithm to use, if the goal is to achieve the best total asymptotic complexity considering all the operations?

Consider an Entity-Relationship (ER) model in which entity sets $E_1$ and $E_2$ are connected by an $m:n$ relationship $R_{12}$. $E_1$ and $E_3$ are connected by a $1:n$ ($1$ on the side of $E_1$ and $n$ on the side of $E_3$) relationship $R_{13}$.

$E_1$ has two single-valued attributes $a_{11}$ and $a_{12}$ of which $a_{11}$ is the key attribute. $E_2$ has two single-valued attributes $a_{21}$ and $a_{22}$ of which $a_{21}$ is the key attribute. $E_3$ has two single-valued attributes $a_{31}$ and $a_{32}$ of which $a_{31}$ is the key attribute. The relationships do not have any attributes.

If a relational model is derived from the above ER model, then the minimum number of relations that would be generated if all the relations are in 3NF is _____.

Consider the following C program segment.

while (first <= last)
{
    if (array[middle] < search)
        first = middle + 1;
    else if (array[middle] == search)
        found = TRUE;
    else last = middle - 1;
    middle = (first + last) / 2;
}
if (first > last) notPresent = TRUE;

The cyclomatic complexity of the program segment is _____.

The graph shown below has 8 edges with distinct integer edge weights. The minimum spanning tree (MST) is of weight 36 and contains the edges: {(A, C), (B, C), (B, E), (E, F), (D, F)}. The edge weights of only those edges which are in the MST are given in the figure shown below. The minimum possible sum of weights of all 8 edges of this graph is _____.

The value of the integral is _____.

Let $G = (V, E)$ be a simple undirected graph, and $s$ be a particular vertex in it called the source. For $x \in V$, let $d(x)$ denote the shortest distance in $G$ from $s$ to $x$. A breadth first search (BFS) is performed starting at $s$. Let $T$ be the resultant BFS tree. If $(u, v)$ is an edge of $G$ that is not in $T$, then which one of the following CANNOT be the value of $d(u) - d(v)$?

Consider a uniprocessor system executing three tasks $T_1$, $T_2$ and $T_3$, each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of $3$, $7$ and $20$ milliseconds, respectively. The priority of each task is the inverse of its period, and the available tasks are scheduled in order of priority, with the highest priority task scheduled first. Each instance of $T_1$, $T_2$ and $T_3$ requires an execution time of $1$, $2$ and $4$ milliseconds, respectively. Given that all tasks initially arrive at the beginning of the $1^{\text{st}}$ millisecond and task preemptions are allowed, the first instance of $T_3$ completes its execution at the end of _____ milliseconds.

Consider a main memory with five page frames and the following sequence of page references: $3, 8, 2, 3, 9, 1, 6, 3, 8, 9, 3, 6, 2, 1, 3$. Which one of the following is true with respect to page replacement policies First In First Out (FIFO) and Least Recently Used (LRU)?

Consider a disk pack with a seek time of $4$ milliseconds and rotational speed of $10000$ rotations per minute (RPM). It has $600$ sectors per track and each sector can store $512$ bytes of data. Consider a file stored in the disk. The file contains $2000$ sectors. Assume that every sector access necessitates a seek, and the average rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in milliseconds) needed to read the entire file is _____.

Let $a_n$ represent the number of bit strings of length $n$ containing two consecutive 1s. What is the recurrence relation for $a_n$?

A variable $x$ is said to be live at a statement $S_i$ in a program if the following three conditions hold simultaneously:
i. There exists a statement $S_j$ that uses $x$
ii. There is a path from $S_i$ to $S_j$ in the flow graph corresponding to the program
iii. The path has no intervening assignment to $x$ including at $S_i$ and $S_j$

The variables which are live both at the statement in basic block 2 and at the statement in basic block 3 of the above control flow graph are

Consider the NPDA $(Q = \{q_0, q_1, q_2\}, \Sigma = \{0, 1\}, \Gamma = \{0, 1, \bot\}, \delta, q_0, \bot, F = \{q_2\})$, where (as per usual convention) $Q$ is the set of states, $\Sigma$ is the input alphabet, $\Gamma$ is the stack alphabet, $\delta$ is the state transition function, $q_0$ is the initial state, $\bot$ is the initial stack symbol, and $F$ is the set of accepting states. The state transition is as follows:

Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton?

Consider the DFAs $M$ and $N$ given below.

The number of states in a minimal DFA that accepts the language $L(M) \cap L(N)$ is _____.

Suppose that the stop-and-wait protocol is used on a link with a bit rate of $64$ kilobits per second and $20$ milliseconds propagation delay. Assume that the transmission time for the acknowledgement and the processing time at nodes are negligible. Then the minimum frame size in bytes to achieve a link utilization of at least $50\%$ is _____.

Let $G$ be a connected planar graph with $10$ vertices. If the number of edges on each face is three, then the number of edges in $G$ is _____.

The least number of temporary variables required to create a three-address code in static single assignment form for the expression $q + r / 3 + s - t * 5 + u * v / w$ is _____.