Answers by Akash Kanase / GATE Overflow for GATE CSE

39 votes

1

GATE CSE 2009 | Question: 54
A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths $m$ and $n$, respectively with indexes of $X$ and $Y$ starting from $0$. We wish to find the length of ... $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.

A sub-sequence of a given sequence is just the given sequence with some elements (possibly none or all) left out. We are given two sequences $X[m]$ and $Y[n]$ of lengths ...

14.7k views

answered Apr 29, 2016

6 votes

2

Which all topics you covered extra?
There are many people who have got top ranks here in GATE2016 and they had a decent rank (top 1000) in GATE2015. Most of them have given their preparation strategies also. Still I would like to ask one thing- what all extra portions you ... prepared seriously in 2015 also. This can also include any topics were you were not strong in 2015 but made strong in 2016.

There are many people who have got top ranks here in GATE2016 and they had a decent rank (top 1000) in GATE2015. Most of them have given their preparation strategies also...

1.0k views

answered Apr 11, 2016

2 votes

3

GATE 2016 CSE
SET - 1, Normalized Marks - 31.39, Category - SC, What can I expect ?

SET - 1, Normalized Marks - 31.39, Category - SC, What can I expect ?

681 views

answered Feb 25, 2016

115 votes

4

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 _________.

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

21.2k views

answered Feb 14, 2016

18 votes

5

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.

Consider the following two-process synchronization solution.$$\begin{array}{l|l}\hline \text{PROCESS 0 } & \text{Process 1 }\\ \\ \text{Entry: loop while (turn == 1);...

15.3k views

answered Feb 14, 2016

33 votes

6

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 -$

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

16.9k views

answered Feb 14, 2016

61 votes

7

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

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

17.0k views

answered Feb 14, 2016

71 votes

8

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.

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

15.2k views

answered Feb 14, 2016

74 votes

9

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.

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

22.7k views

answered Feb 14, 2016

7 votes

10

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

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

18.2k views

answered Feb 14, 2016

47 votes

11

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 _________.

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

23.0k views

answered Feb 14, 2016

106 votes

12

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 _________.

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

26.1k views

answered Feb 14, 2016

79 votes

13

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}$

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 =...

14.1k views

answered Feb 13, 2016

76 votes

14

GATE CSE 2016 Set 2 | Question: 02
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 __________.

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 __________.

10.6k views

answered Feb 13, 2016

69 votes

15

GATE CSE 2016 Set 2 | Question: 25
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. HTTP GET request, DNS query, TCP SYN DNS query, HTTP GET request, TCP SYN DNS query, TCP SYN, HTTP GET request. TCP SYN, DNS query, HTTP GET request.

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 tha...

11.8k views

answered Feb 13, 2016

68 votes

16

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))$

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

17.1k views

answered Feb 13, 2016

49 votes

17

GATE CSE 2016 Set 2 | Question: 11
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^{\text{th}}$ vertex in this BFS traversal, then the maximum possible value of $n$ 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^{\text{th}...

13.3k views

answered Feb 13, 2016

48 votes

18

GATE CSE 2016 Set 2 | Question: 13
Assume that the algorithms considered here sort the input sequences in ascending order. If the input is already in the ascending order, which of the following are TRUE? Quicksort runs in $\Theta (n^2)$ time Bubblesort runs in $\Theta (n^2)$ time Mergesort runs ... Insertion sort runs in $\Theta (n)$ time I and II only I and III only II and IV only I and IV only

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

14.5k views

answered Feb 13, 2016

149 votes

19

GATE CSE 2016 Set 2 | Question: 15
$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 ... together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$

$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...

34.6k views

answered Feb 13, 2016

71 votes

20

GATE CSE 2016 Set 2 | Question: 03
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.

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

15.6k views

answered Feb 12, 2016

57 votes

21

GATE CSE 2016 Set 2 | Question: 10
A processor has $40$ distinct instruction and $24$ general purpose registers. A $32$-bit instruction word has an opcode, two registers operands and an immediate operand. The number of bits available for the immediate operand field is_______.

A processor has $40$ distinct instruction and $24$ general purpose registers. A $32$-bit instruction word has an opcode, two registers operands and an immediate operand. ...

13.8k views

answered Feb 12, 2016

65 votes

22

GATE CSE 2016 Set 2 | Question: 04
Consider the systems, each consisting of $m$ linear equations in $n$ variables. If $m < n$, then all such systems have a solution. If $m > n$, then none of these systems has a solution. If $m = n$, then there exists a system which has a solution. ... $\text{II}$ and $\text{III}$ are true. Only $\text{III}$ is true. None of them is true.

Consider the systems, each consisting of $m$ linear equations in $n$ variables.If $m < n$, then all such systems have a solution.If $m n$, then none of these systems has...

16.0k views

answered Feb 12, 2016

37 votes

23

GATE CSE 2016 Set 2 | Question: 24
In an Ethernet local area network, which one of the following statements is TRUE? A station stops to sense the channel once it starts transmitting a frame. The purpose of the jamming signal is to pad the frames that are ... the packet even after the collision is detected. The exponential back off mechanism reduces the probability of collision on retransmissions.

In an Ethernet local area network, which one of the following statements is TRUE?A station stops to sense the channel once it starts transmitting a frame.The purpose of t...

11.4k views

answered Feb 12, 2016

22 votes

24

GATE CSE 2016 Set 2 | Question: GA-09
In a $2 \times 4$ rectangle grid shown below, each cell is rectangle. How many rectangles can be observed in the grid? $\begin{array}{|c|c|c|c|c|}\hline{\;\;\;}&{\;\;\;}&{\;\;\;}&{\;\;\;}\\\hline{}&{}&{}&\\\hline\end{array}$ $21$ $27$ $30$ $36$

In a $2 \times 4$ rectangle grid shown below, each cell is rectangle. How many rectangles can be observed in the grid?$$\begin{array}{|c|c|c|c|c|}\hline{\;\;\;}&{\;\;\;}&...

8.3k views

answered Feb 12, 2016

66 votes

25

GATE CSE 2016 Set 2 | Question: 05
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 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 ...

9.8k views

answered Feb 12, 2016

10 votes

26

GATE CSE 2016 Set 2 | Question: GA-06
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 numbers of faculty members connected only through Facebook accounts is _______. $35$ $45$ $65$ $90$

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

7.5k views

answered Feb 12, 2016

34 votes

27

GATE CSE 2016 Set 2 | Question: GA-10
$f(x) = 1 - |x - 1|$ $f(x) =1 + |x - 1|$ $f(x) = 2 - |x - 1|$ $f(x) = 2 + |x - 1|$

$f(x) = 1 - |x - 1|$$f(x) =1 + |x - 1|$$f(x) = 2 - |x - 1|$$f(x) = 2 + |x - 1|$

4.8k views

answered Feb 12, 2016

27 votes

28

GATE CSE 2016 Set 2 | Question: GA-08
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? Ooty is not a hill-station. No hill-station can have more than one lake. (i) only. (ii) only. Both (i) and (ii) Neither (i) nor (ii)

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?Ooty is not a hill-s...

4.3k views

answered Feb 12, 2016

2 votes

29

What to do after GATE EXAM
Please suggest some ideas what to do after gate exam.

Please suggest some ideas what to do after gate exam.

636 views

answered Feb 10, 2016

0 votes

30

GATE 2015 EC_S03 Q 4
Q.4 Find the missing sequence in the letter series below: A, CD, GHI, ?, UVWXY (A) LMN (B) MNO (C) MNOP (D) NOPQ

Q.4 Find the missing sequence in the letter series below:A, CD, GHI, ?, UVWXY(A) LMN (B) MNO (C) MNOP (D) NOPQ

1.6k views

answered Feb 2, 2016

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true