Register

Recent questions tagged gatecse-2016-set2

23.0k
views
12 answers
100 votes
GATE CSE 2016 Set 2 | Question: 30
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...
User Avatar
9.1k
views
1 answers
26 votes
GATE CSE 2016 Set 2 | Question: 47
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 remain...
User Avatar
18.1k
views
4 answers
50 votes
GATE CSE 2016 Set 2 | Question: 32
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.
User Avatar
20.0k
views
4 answers
94 votes
GATE CSE 2016 Set 2 | Question: 41
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 $...
User Avatar
17.2k
views
6 answers
72 votes
GATE CSE 2016 Set 2 | Question: 27
Which one of the following well-formed formulae in predicate calculus is NOT valid ?$(\forall _{x} p(x) \implies \forall _{x} q(x)) \implies (\exists _{x} \neg p(x) \vee ...
User Avatar
21.8k
views
5 answers
50 votes
GATE CSE 2016 Set 2 | Question: 43
Consider the following languages:$L_{1}=\left\{a^{n}b^{m}c^{n+m}:m, n\geq 1\right\}$$L_{2}=\left\{a^{n}b^{n}c^{2n} :n\geq 1\right\}$Which one of the following is TRUE?Bot...
User Avatar
11.3k
views
1 answers
56 votes
GATE CSE 2016 Set 2 | Question: 52
Consider the following database table named water_schemes:$$\overset{\text{Water_schemes}}{\begin{array}{|c|c|c|}\hline\textbf{scheme_no}& \textbf{district_name}& \te...
User Avatar
14.9k
views
8 answers
52 votes
GATE CSE 2016 Set 2 | Question: 26
A binary relation $R$ on $\mathbb{N} \times \mathbb{N}$ is defined as follows: $(a, b) R(c, d)$ if $a \leq c$ or $b \leq d$. Consider the following propositions:$P:$ $R$ ...
User Avatar
13.8k
views
6 answers
41 votes
GATE CSE 2016 Set 2 | Question: 37
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 ); } int main () { int a[] = {3, 5, 2, 6, 4}; ...
User Avatar
21.3k
views
4 answers
68 votes
GATE CSE 2016 Set 2 | Question: 31
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...
User Avatar
15.5k
views
8 answers
42 votes
GATE CSE 2016 Set 2 | Question: 48
Consider the following two-process synchronization solution.$$\begin{array}{l|l}\hline \text{PROCESS 0 } & \text{Process 1 }\\ \\ \text{Entry: loop while (turn == 1);...
User Avatar
9.1k
views
1 answers
40 votes
GATE CSE 2016 Set 2 | Question: 46
A student wrote two context-free grammars G1 and G2 for generating a single C-like array declaration. The dimension of the array is at least one. For example,int a[10] [3...
User Avatar
17.1k
views
6 answers
65 votes
GATE CSE 2016 Set 2 | Question: 36
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 N...
User Avatar
34.0k
views
7 answers
108 votes
GATE CSE 2016 Set 2 | Question: 44
Consider the following languages.$L_{1} = \left\{\left\langle M \right\rangle \mid M \text{ takes at least 2016 steps on some input} \right\}$,$L_{2} = \left\{\left\langl...
User Avatar
17.1k
views
8 answers
86 votes
GATE CSE 2016 Set 2 | Question: 28
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$. ...
User Avatar
9.8k
views
4 answers
39 votes
GATE CSE 2016 Set 2 | Question: 45
Which one of the following grammars is free from left recursion?$S \rightarrow AB$$A \rightarrow Aa \mid b$$B \rightarrow c$$S \rightarrow Ab \mid Bb \mid c$$A \rightarro...
User Avatar
17.1k
views
3 answers
35 votes
GATE CSE 2016 Set 2 | Question: 54
For the $\text{IEEE 802.11 MAC}$ protocol for wireless communication, which of the following statements is/are TRUE?At least three non-overlapping channels are available ...
User Avatar
15.3k
views
13 answers
63 votes
GATE CSE 2016 Set 2 | Question: 50
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...
User Avatar
26.2k
views
3 answers
79 votes
GATE CSE 2016 Set 2 | Question: 42
Consider the following two statements:If all states of an NFA are accepting states then the language accepted by the NFA is $\Sigma_{}^{*}$.There exists a regular languag...
User Avatar
22.9k
views
6 answers
64 votes
GATE CSE 2016 Set 2 | Question: 51
Consider the following database schedule with two transactions $T_{1}$ and $T_{2}$.$S= r_{2}\left(X\right); r_{1}\left(X\right); r_{2} \left(Y\right); w_{1} \left(X\right...
User Avatar
9.5k
views
5 answers
33 votes
GATE CSE 2016 Set 2 | Question: 53
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 ...
User Avatar
18.4k
views
11 answers
44 votes
GATE CSE 2016 Set 2 | Question: 29
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
User Avatar
23.2k
views
7 answers
42 votes
GATE CSE 2016 Set 2 | Question: 38
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 scala...
User Avatar
50.6k
views
17 answers
169 votes
GATE CSE 2016 Set 2 | Question: 40
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 _________.No...
User Avatar
26.3k
views
5 answers
73 votes
GATE CSE 2016 Set 2 | Question: 34
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 h...
User Avatar
16.7k
views
2 answers
61 votes
GATE CSE 2016 Set 2 | Question: 39
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 wor...
User Avatar
19.5k
views
8 answers
76 votes
GATE CSE 2016 Set 2 | Question: 33
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac...
User Avatar
14.2k
views
7 answers
50 votes
GATE CSE 2016 Set 2 | Question: 35
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 =...
User Avatar
23.1k
views
6 answers
53 votes
GATE CSE 2016 Set 2 | Question: 55
Consider a $128 \times 10^3$ bits/second satellite communication link with one way propagation delay of $150$ milliseconds. Selective retransmission (repeat) protocol is ...
User Avatar
16.3k
views
10 answers
51 votes
GATE CSE 2016 Set 2 | Question: 49
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)...
User Avatar
Page: