Dark Mode

Recent questions tagged gatecse-2016-set2

99 votes

12 answers

1

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 instances of $U_{G}$, it is required to implement ... $1 \leq i \leq 10$. Ignoring all other delays, the minimum time required to complete this computation is ____________ nanoseconds.

Akash Kanase asked in CO and Architecture Feb 12, 2016

by Akash Kanase

22.6k views

26 votes

1 answer

2

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 remaining-time first. ... The average turn around time of these processes is ___________ milliseconds.

Akash Kanase asked in Operating System Feb 12, 2016

by Akash Kanase

8.8k views

50 votes

4 answers

3

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.

Akash Kanase asked in CO and Architecture Feb 12, 2016

by Akash Kanase

17.7k views

93 votes

4 answers

4

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 $[u]$ in the adjacency list of $v$. These are called twins of each other. A twin pointer ... $\Theta\left(n+m\right)$ $\Theta\left(m^{2}\right)$ $\Theta\left(n^{4}\right)$

Akash Kanase asked in Algorithms Feb 12, 2016

by Akash Kanase

19.6k views

69 votes

6 answers

5

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 \forall _{x} q(x))$ ... $\forall x (p(x) \vee q(x)) \implies (\forall x p(x) \vee \forall x q(x))$

Akash Kanase asked in Mathematical Logic Feb 12, 2016

by Akash Kanase

16.8k views

50 votes

5 answers

6

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? Both $L_{1}$ and $L_{2}$ are context-free. $L_{1}$ is context ... $L_{2}$ is context-free while $L_{1}$ is not context-free. Neither $L_{1}$ nor $L_{2}$ is context-free.

Akash Kanase asked in Theory of Computation Feb 12, 2016

by Akash Kanase

20.9k views

56 votes

1 answer

7

GATE CSE 2016 Set 2 | Question: 52
Consider the following database table named water_schemes: ... total_avg (capacity) as select avg (capacity) from total select name from total, total_avg where total.capacity ≥ total_avg.capacity

Akash Kanase asked in Databases Feb 12, 2016

by Akash Kanase

11.0k views

50 votes

8 answers

8

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$ is reflexive. $Q:$ $R$ is transitive. Which one of the following statements is TRUE? ... and $Q$ are true. $P$ is true and $Q$ is false. $P$ is false and $Q$ is true. Both $P$ and $Q$ are false.

Akash Kanase asked in Set Theory & Algebra Feb 12, 2016

by Akash Kanase

14.6k views

41 votes

6 answers

9

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[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 ________.

Akash Kanase asked in Programming in C Feb 12, 2016

by Akash Kanase

13.5k views

67 votes

4 answers

10

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, one destination register identifier, and twelve-bit immediate value. Each ... program has $100$ instructions, the amount of memory (in bytes) consumed by the program text is _________.

Akash Kanase asked in CO and Architecture Feb 12, 2016

by Akash Kanase

20.9k views

42 votes

8 answers

11

GATE CSE 2016 Set 2 | Question: 48
Consider the following two-process synchronization solution. ... synchronization solution. This solution violates mutual exclusion requirement. This solution violates progress requirement. This solution violates bounded wait requirement.

Akash Kanase asked in Operating System Feb 12, 2016

by Akash Kanase

14.8k views

40 votes

1 answer

12

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]; The grammars use D as the start symbol, and use six ... Which of the grammars correctly generate the declaration mentioned above? Both G1 and G2 Only G1 Only G2 Neither G1 nor G2

Akash Kanase asked in Compiler Design Feb 12, 2016

by Akash Kanase

8.9k views

65 votes

6 answers

13

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 New-order traversal of the expression tree corresponding to the reverse polish expression 3 4 * 5 - 2 ^ 6 7 * 1 + - is given ... $1 \ 7 \ 6 * + \ 2 \ 5 \ 4 \ 3 \ * \ - \wedge -$

Akash Kanase asked in DS Feb 12, 2016

by Akash Kanase

16.6k views

108 votes

7 answers

14

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\}$ ... not recursive $L_{1}, L_{2}$ are recursive and $L_{3}$ is not recursive $L_{1}, L_{2}, L_{3}$ are recursive

Akash Kanase asked in Theory of Computation Feb 12, 2016

by Akash Kanase

33.5k views

85 votes

8 answers

15

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$. Consider the following statements: Each compound in U \ S reacts ... \ S reacts with an even number of compounds. Which one of the above statements is ALWAYS TRUE? Only I Only II Only III None.

Akash Kanase asked in Set Theory & Algebra Feb 12, 2016

by Akash Kanase

16.5k views

39 votes

4 answers

16

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 \rightarrow Bd \mid \epsilon$ $B \rightarrow e$ $S \rightarrow Aa \mid B$ ... $ B \rightarrow d$ $S \rightarrow Aa \mid Bb \mid c$ $A \rightarrow Bd \mid \epsilon$ $B \rightarrow Ae \mid \epsilon$

Akash Kanase asked in Compiler Design Feb 12, 2016

by Akash Kanase

9.5k views

35 votes

3 answers

17

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 for transmissions. The RTS-CTS mechanism is used for collision detection. Unicast frames are ACKed. All I, II, and III I and III only II and III only II only

Akash Kanase asked in Computer Networks Feb 12, 2016

by Akash Kanase

16.8k views

63 votes

13 answers

18

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 read a block from the disk is $10$ ms. Assume that the cost ... in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.

Akash Kanase asked in CO and Architecture Feb 12, 2016

by Akash Kanase

15.0k views

79 votes

3 answers

19

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 language $A$ such that for all languages $B$, $A \cap B$ is regular. Which one of the following is CORRECT? Only I is true Only II is true Both I and II are true Both I and II are false

Akash Kanase asked in Theory of Computation Feb 12, 2016

by Akash Kanase

25.0k views

64 votes

6 answers

20

GATE CSE 2016 Set 2 | Question: 51
Consider the following database schedule with two transactions $T_{1}$ and $T_{2}$ ... is TRUE? $S$ is non-recoverable. $S$ is recoverable, but has a cascading abort. $S$ does not have a cascading abort. $S$ is strict.

Akash Kanase asked in Databases Feb 12, 2016

by Akash Kanase

21.9k views

33 votes

5 answers

21

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 another node is $40$ microseconds. The minimum size of a frame in the network is __________ bytes.

Akash Kanase asked in Computer Networks Feb 12, 2016

by Akash Kanase

9.1k views

44 votes

10 answers

22

GATE CSE 2016 Set 2 | Question: 29
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.

Akash Kanase asked in Combinatory Feb 12, 2016

by Akash Kanase

17.7k views

41 votes

7 answers

23

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 scalar multiplications required to find the product $A_{1}A_{2}A_{3}A_{4}$ using the basic matrix multiplication method is _________.

Akash Kanase asked in Algorithms Feb 12, 2016

by Akash Kanase

22.5k views

168 votes

17 answers

24

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 _________. Note: The height of a tree with a single node is $0$.

Akash Kanase asked in DS Feb 12, 2016

by Akash Kanase

49.6k views

73 votes

5 answers

25

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 heap to that node. Thus, the root is at depth $0$. The maximum depth at which integer $9$ can appear is _________.

Akash Kanase asked in DS Feb 12, 2016

by Akash Kanase

25.7k views

61 votes

2 answers

26

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 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 ________. Flow chart for Recursive Function $A(n)$.

Akash Kanase asked in Algorithms Feb 12, 2016

by Akash Kanase

16.3k views

75 votes

8 answers

27

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{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 __________ $\text{GHz}$, ignoring delays in the pipeline registers.

Akash Kanase asked in CO and Architecture Feb 12, 2016

by Akash Kanase

19.1k views

50 votes

7 answers

28

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 = a * a; b = b/2; } else {res = res * a; b = b - 1; } } return res; } Which one of the following ... $X^{Y} = a^{b}$ $(res * a)^{Y} = (res * X)^{b}$ $X^{Y} = res * a^{b}$ $X^{Y} = (res * a)^{b}$

Akash Kanase asked in Programming in C Feb 12, 2016

by Akash Kanase

13.9k views

52 votes

6 answers

29

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 used on this link to send data with a frame size of $1$ kilobyte ... acknowledgement. The minimum number of bits required for the sequence number field to achieve $100 \%$ utilization is ________.

Akash Kanase asked in Computer Networks Feb 12, 2016

by Akash Kanase

22.3k views

51 votes

10 answers

30

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)$ operations are issued in some order. The largest initial value of $S$ for which at least one $P(S)$ operation will remain blocked is _______

Akash Kanase asked in Operating System Feb 12, 2016

by Akash Kanase

15.7k views

Page:

1
2
3
next »

Recent questions tagged gatecse-2016-set2