The man who is now Municipal Commissioner worked as ____________________.

Nobody knows how the Indian cricket team is going to cope with the difficult and seamer-friendly wickets in Australia.

Choose the option which is closest in meaning to the underlined phrase in the above sentence.

Find the odd one in the following group of words.

mock, deride, praise, jeer

Pick the odd one from the following options.

In a quadratic function, the value of the product of the roots $(\alpha, \beta)$ is 4. Find the value of

Among 150 faculty members in an institute, 55 are connected with each other through Facebook and 85 are connected through WhatsApp. 30 faculty members do not have Facebook or WhatsApp accounts. The number of faculty members connected only through Facebook accounts is ______________.

Computers were invented for performing only high-end useful computations. However, it is no understatement that they have taken over our world today. The internet, for example, is ubiquitous. Many believe that the internet itself is an unintended consequence of the original invention. With the advent of mobile computing on our phones, a whole new dimension is now enabled. One is left wondering if all these developments are good or, more importantly, required.

Which of the statement(s) below is/are logically valid and can be inferred from the above paragraph?
(i) The author believes that computers are not good for us.
(ii) Mobile computers and the internet are both intended inventions

All hill-stations have a lake. Ooty has two lakes.

Which of the statement(s) below is/are logically valid and can be inferred from the above sentences?
(i) Ooty is not a hill-station.
(ii) No hill-station can have more than one lake.

In a $2 \times 4$ rectangle grid shown below, each cell is a rectangle. How many rectangles can be observed in the grid?

Choose the correct expression for $f(x)$ given in the graph.

Consider the following expressions:
(i) $\text{false}$
(ii) $Q$
(iii) $\text{true}$
(iv) $P \lor Q$
(v) $\neg Q \lor P$

The number of expressions given above that are logically implied by $P \land (P \implies Q)$ is ________.

Let $f(x)$ be a polynomial and $g(x) = f'(x)$ be its derivative. If the degree of $(f(x) + f(-x))$ is 10, then the degree of $(g(x) - g(-x))$ is ________.

The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.

Consider the systems, each consisting of $m$ linear equations in $n$ variables.

I. If $m < n$, then all such systems have a solution
II. If $m > n$, then none of these systems has a solution
III. If $m = n$, then there exists a system which has a solution

Which one of the following is CORRECT?

Suppose that a shop has an equal number of LED bulbs of two different types. The probability of an LED bulb lasting more than 100 hours given that it is of Type 1 is 0.7, and given that it is of Type 2 is 0.4. The probability that an LED bulb chosen uniformly at random lasts more than 100 hours is ________.

Suppose that the eigenvalues of matrix $A$ are 1, 2, 4.

The determinant of $(A^{-1})^T$ is ________.

Consider an eight-bit ripple-carry adder for computing the sum of $A$ and $B$, where $A$ and $B$ are integers represented in 2's complement form. If the decimal value of $A$ is one, the decimal value of $B$ that leads to the longest latency for the sum to stabilize is ________.

Let $x_1 \oplus x_2 \oplus x_3 \oplus x_4 = 0$ where $x_1, x_2, x_3, x_4$ are Boolean variables, and $\oplus$ is the XOR operator. Which one of the following must always be TRUE?

Let $X$ be the number of distinct 16-bit integers in 2's complement representation. Let $Y$ be the number of distinct 16-bit integers in sign magnitude representation.

Then $X - Y$ is ________.

A processor has 40 distinct instructions and 24 general purpose registers. A 32-bit instruction word has an opcode, two register operands and an immediate operand. The number of bits available for the immediate operand field is ________.

Breadth First Search (BFS) is started on a binary tree beginning from the root vertex. There is a vertex $t$ at a distance four from the root. If $t$ is the $n$-th vertex in this BFS traversal, then the maximum possible value of $n$ is ________.

The value printed by the following program is ________.

void f(int* p, int m){
    m = m + 5;
    *p = *p + m;
    return;
}
void main(){
    int i=5, j=10;
    f(&i, j);
    printf("%d", i+j);
}

Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in ascending order, which of the following are TRUE?

I. Quicksort runs in $\Theta(n^2)$ time
II. Bubblesort runs in $\Theta(n^2)$ time
III. Mergesort runs in $\Theta(n)$ time
IV. Insertion sort runs in $\Theta(n)$ time

The Floyd-Warshall algorithm for all-pair shortest paths computation is based on

$N$ items are stored in a sorted doubly linked list. For a delete operation, a pointer is provided to the record to be deleted. For a decrease-key operation, a pointer is provided to the record on which the operation is to be performed.

An algorithm performs the following operations on the list in this order: $\Theta(N)$ delete, $O(\log N)$ insert, $O(\log N)$ find, and $\Theta(N)$ decrease-key. What is the time complexity of all these operations put together?

The number of states in the minimum sized DFA that accepts the language defined by the regular expression

is ________.

Language $L_1$ is defined by the grammar: $S_1 \to a S_1 b \mid \varepsilon$
Language $L_2$ is defined by the grammar: $S_2 \to a b S_2 \mid \varepsilon$

Consider the following statements:
$P$: $L_1$ is regular
$Q$: $L_2$ is regular

Which one of the following is TRUE?

Consider the following types of languages: $L_1$ : Regular, $L_2$ : Context-free, $L_3$ : Recursive, $L_4$ : Recursively enumerable. Which of the following is/are TRUE?

I. $L_3 \cup L_4$ is recursively enumerable
II. $L_2 \cup L_3$ is recursive
III. $L_1^* \cap L_2$ is context-free
IV. $L_1 \cup L_2$ is context-free

Match the following:

(P) Lexical analysis
(Q) Top down parsing
(R) Semantic analysis
(S) Runtime environments

(i) Leftmost derivation
(ii) Type checking
(iii) Regular expressions
(iv) Activation records

In which one of the following page replacement algorithms it is possible for the page fault rate to increase even when the number of allocated frames increases?

B+ Trees are considered BALANCED because

Suppose a database schedule $S$ involves transactions $T_1, \dots, T_n$. Construct the precedence graph of $S$ with vertices representing the transactions and edges representing the conflicts. If $S$ is serializable, which one of the following orderings of the vertices of the precedence graph is guaranteed to yield a serial schedule?

Anarkali digitally signs a message and sends it to Salim. Verification of the signature by Salim requires

In an Ethernet local area network, which one of the following statements is TRUE?

Identify the correct sequence in which the following packets are transmitted on the network by a host when a browser requests a webpage from a remote server, assuming that the host has just been restarted.

A binary relation $R$ on $\mathbb{N} \times \mathbb{N}$ is defined as follows: $(a, b)R(c, d)$ if $a \le c$ or $b \le d$. Consider the following propositions:
$P$: $R$ is reflexive
$Q$: $R$ is transitive

Which one of the following statements is TRUE?

Which one of the following well-formed formulae in predicate calculus is NOT valid?

Consider a set $U$ of 23 different compounds in a Chemistry lab. There is a subset $S$ of $U$ of 9 compounds, each of which reacts with exactly 3 compounds of $U$. Consider the following statements:

I. Each compound in $U \setminus S$ reacts with an odd number of compounds.
II. At least one compound in $U \setminus S$ reacts with an odd number of compounds.
III. Each compound in $U \setminus S$ reacts with an even number of compounds.

Which one of the above statements is ALWAYS TRUE?

The value of the expression $13^{99} \pmod{17}$, in the range 0 to 16, is ________.

Suppose the functions $F$ and $G$ can be computed in 5 and 3 nanoseconds by functional units $U_F$ and $U_G$, respectively. Given two instances of $U_F$ and two instances of $U_G$, it is required to implement the computation $F(G(X_i))$ for $1 \le i \le 10$. Ignoring all other delays, the minimum time required to complete this computation is ________ nanoseconds.

Consider a processor with 64 registers and an instruction set of size twelve. Each instruction has five distinct fields, namely, opcode, two source register identifiers, one destination register identifier, and a twelve-bit immediate value. Each instruction must be stored in memory in a byte-aligned fashion. If a program has 100 instructions, the amount of memory (in bytes) consumed by the program text is ________.

The width of the physical address on a machine is 40 bits. The width of the tag field in a 512 KB 8-way set associative cache is ________ bits.

Consider a 3 GHz (gigahertz) processor with a three-stage pipeline and stage latencies $\tau_1, \tau_2,$ and $\tau_3$ such that $\tau_1 = 3\tau_2 / 4 = 2\tau_3$. If the longest pipeline stage is split into two pipeline stages of equal latency, the new frequency is ________ GHz, ignoring delays in the pipeline registers.

A complete binary min-heap is made by including each integer in $[1, 1023]$ exactly once. The depth of a node in the heap is the length of the path from the root of the heap to that node. Thus, the root is at depth 0. The maximum depth at which integer 9 can appear is ________.

The following function computes $X^Y$ for positive integers $X$ and $Y$.

int exp(int X, int Y) {
    int res = 1, a = X, b = Y;
    while ( b != 0 ){
        if ( b%2 == 0) { a = a*a; b = b/2; }
        else
        { res = res*a; b = b-1; }
    }
    return res;
}

Which one of the following conditions is TRUE before every iteration of the loop?

Consider the following New-order strategy for traversing a binary tree:

• Visit the root;
• Visit the right subtree using New-order;
• Visit the left subtree using New-order;

The New-order traversal of the expression tree corresponding to the reverse polish expression

is given by:

Consider the following program:

int f(int *p, int n)
{
    if (n <= 1) return 0;
    else return max(f(p+1,n-1),p[0]-p[1]);
}
int main()
{
    int a[] = {3,5,2,6,4};
    printf("%d", f(a,5));
}

Note: max(x,y) returns the maximum of x and y.

The value printed by this program is ________.

Let $A_1, A_2, A_3,$ and $A_4$ be four matrices of dimensions $10 \times 5$, $5 \times 20$, $20 \times 10$, and $10 \times 5$, respectively. The minimum number of scalar multiplications required to find the product $A_1 A_2 A_3 A_4$ using the basic matrix multiplication method is ________.

The given diagram shows the flowchart for a recursive function $A(n)$. Assume that all statements, except for the recursive calls, have $O(1)$ time complexity. If the worst case time complexity of this function is $O(n^\alpha)$, then the least possible value (accurate up to two decimal positions) of $\alpha$ is ________.

The number of ways in which the numbers 1, 2, 3, 4, 5, 6, 7 can be inserted in an empty binary search tree, such that the resulting tree has height 6, is ________.

Note: The height of a tree with a single node is 0.

In an adjacency list representation of an undirected simple graph $G = (V, E)$, each edge $(u, v)$ has two adjacency list entries: $[v]$ in the adjacency list of $u$, and $[u]$ in the adjacency list of $v$. These are called twins of each other. A twin pointer is a pointer from an adjacency list entry to its twin. If $|E| = m$ and $|V| = n$, and the memory size is not a constraint, what is the time complexity of the most efficient algorithm to set the twin pointer in each entry in each adjacency list?

Consider the following two statements:
I. If all states of an NFA are accepting states then the language accepted by the NFA is $\Sigma^*$.
II. There exists a regular language $A$ such that for all languages $B$, $A \cap B$ is regular.

Which one of the following is CORRECT?

Consider the following languages:
$L_1 = \{a^n b^m c^{n+m} \mid m, n \ge 1\}$
$L_2 = \{a^n b^n c^{2n} \mid n \ge 1\}$

Which one of the following is TRUE?

Consider the following languages.
$L_1 = \{\langle M \rangle \mid M \text{ takes at least 2016 steps on some input}\}$,
$L_2 = \{\langle M \rangle \mid M \text{ takes at least 2016 steps on all inputs}\}$ and
$L_3 = \{\langle M \rangle \mid M \text{ accepts } \varepsilon\}$,
where for each Turing machine $M$, $\langle M \rangle$ denotes a specific encoding of $M$. Which one of the following is TRUE?

Which one of the following grammars is free from left recursion?

A student wrote two context-free grammars $G_1$ and $G_2$ for generating a single C-like array declaration. The dimension of the array is at least one. For example,

int a[10][3];

The grammars use $D$ as the start symbol, and use six terminal symbols int ; id [ ] num.

Grammar $G_1$:
$D \to \text{int } L;$
$L \to \text{id } [ E$
$E \to \text{num}]$
$E \to \text{num}] [ E$

Grammar $G_2$:
$D \to \text{int } L;$
$L \to \text{id } E$
$E \to E[\text{num}]$
$E \to [\text{num}]$

Which of the grammars correctly generate the declaration mentioned above?

Consider the following processes, with the arrival time and the length of the CPU burst given in milliseconds. The scheduling algorithm used is preemptive shortest remaining-time first.

Process | Arrival Time | Burst Time
P1 | 0 | 10
P2 | 3 | 6
P3 | 7 | 1
P4 | 8 | 3

The average turn around time of these processes is _____ milliseconds.

Consider the following two-process synchronization solution.

Process 0
--------
Entry: loop while (turn == 1);
(critical section)
Exit: turn = 1;

Process 1
---------
Entry: loop while (turn == 0);
(critical section)
Exit: turn = 0;

The shared variable turn is initialized to zero. Which one of the following is TRUE?

Consider a non-negative counting semaphore $S$. The operation $P(S)$ decrements $S$, and $V(S)$ increments $S$. During an execution, 20 $P(S)$ operations and 12 $V(S)$ operations are issued in some order. The largest initial value of $S$ for which at least one $P(S)$ operation will remain blocked is _____.

A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is 1 ms and to read a block from the disk is 10 ms. Assume that the cost of checking whether a block exists in the cache is negligible. Available cache sizes are in multiples of 10 MB.

The smallest cache size required to ensure an average read latency of less than 6 ms is _____ MB.

Consider the following database schedule with two transactions, $T_1$ and $T_2$.

where $r_i(Z)$ denotes a read operation by transaction $T_i$ on a variable $Z$, $w_i(Z)$ denotes a write operation by $T_i$ on a variable $Z$ and $a_i$ denotes an abort by transaction $T_i$.

Which one of the following statements about the above schedule is TRUE?

Consider the following database table named water_schemes:

scheme_no | district_name | capacity
1 | Ajmer | 20
1 | Bikaner | 10
2 | Bikaner | 10
3 | Bikaner | 20
1 | Churu | 10
2 | Churu | 20
1 | Dungargarh | 10

The number of tuples returned by the following SQL query is _____.

with total(name, capacity) as
    select district_name, sum(capacity)
    from water_schemes
    group by district_name
with total_avg(capacity) as
    select avg(capacity)
    from total
select name
from total, total_avg
where total.capacity >= total_avg.capacity

A network has a data transmission bandwidth of $20 \times 10^6$ bits per second. It uses CSMA/CD in the MAC layer. The maximum signal propagation time from one node to another node is 40 microseconds. The minimum size of a frame in the network is _____ bytes.

For the IEEE 802.11 MAC protocol for wireless communication, which of the following statements is/are TRUE?
I. At least three non-overlapping channels are available for transmissions.
II. The RTS-CTS mechanism is used for collision detection.
III. Unicast frames are ACKed.

Consider a $128 \times 10^3$ bits/second satellite communication link with one way propagation delay of 150 milliseconds. Selective retransmission (repeat) protocol is used on this link to send data with a frame size of 1 kilobyte. Neglect the transmission time of acknowledgement. The minimum number of bits required for the sequence number field to achieve 100% utilization is _____.