Log In

Answers by Akash Kanase

36 votes
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 the longest common ... major order of $L[M, N]$. $L[p, q]$ needs to be computed before $L[r, s]$ if either $p<r$ or $q < s$.
answered Apr 29, 2016 in Algorithms 5.1k views
6 votes
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 did in GATE2016 compared ... you prepared seriously in 2015 also. This can also include any topics were you were not strong in 2015 but made strong in 2016.
answered Apr 12, 2016 in Study Resources 480 views
2 votes
SET - 1, Normalized Marks - 31.39, Category - SC, What can I expect ?
answered Feb 25, 2016 in GATE Application 398 views
81 votes
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 instruction must be stored in memory ... . If a program has $100$ instructions, the amount of memory (in bytes) consumed by the program text is _________.
answered Feb 14, 2016 in CO and Architecture 8.1k views
17 votes
Consider the following two-process synchronization solution. ... two- process synchronization solution. This solution violates mutual exclusion requirement. This solution violates progress requirement. This solution violates bounded wait requirement.
answered Feb 14, 2016 in Operating System 6k views
24 votes
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 by: ... $1 \ 7 \ 6 * + \ 2 \ 5 \ 4 \ 3 \ * \ - \wedge -$
answered Feb 14, 2016 in DS 6.5k views
54 votes
For the $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
answered Feb 14, 2016 in Computer Networks 6.5k views
56 votes
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 ... 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.
answered Feb 14, 2016 in CO and Architecture 6.1k views
49 votes
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); r_{1} \left(Y\right); w_{2} \left(X\right); a_{1}; a_{2}$ ... the above schedule is TRUE? $S$ is non-recoverable. $S$ is recoverable, but has a cascading abort. $S$ does not have a cascading abort. $S$ is strict.
answered Feb 14, 2016 in Databases 7.4k views
7 votes
The value of the expression $13^{99}\pmod{17}$ in the range $0$ to $16$, is ________.
answered Feb 14, 2016 in Combinatory 8.4k views
41 votes
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 _________.
answered Feb 14, 2016 in Algorithms 7.1k views
71 votes
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 _________.
answered Feb 14, 2016 in DS 9.3k views
57 votes
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 ... the loop? $X^{Y} = a^{b}$ $(res * a)^{Y} = (res * X)^{b}$ $X^{Y} = res * a^{b}$ $X^{Y} = (res * a)^{b}$
answered Feb 14, 2016 in Programming 4.2k views
56 votes
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 __________.
answered Feb 14, 2016 in Calculus 4.2k views
57 votes
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.
answered Feb 13, 2016 in Computer Networks 4.5k views
48 votes
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))$ $(\exists x p(x) \vee \exists x q (x)) \implies \exists x (p(x) \vee q (x))$ ... $\forall x (p(x) \vee q(x)) \implies (\forall x p(x) \vee \forall x q(x))$
answered Feb 13, 2016 in Mathematical Logic 7.3k views
39 votes
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 __________
answered Feb 13, 2016 in Algorithms 4.1k views
38 votes
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 in $\Theta (n)$ time Insertion sort runs in $\Theta (n)$ time I and II only I and III only II and IV only I and IV only
answered Feb 13, 2016 in Algorithms 4.8k views
88 votes
$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 ... operations put together? $O(\log^{2} N)$ $O(N)$ $O(N^{2})$ $\Theta\left(N^{2}\log N\right)$
answered Feb 13, 2016 in DS 13.7k views
48 votes
The minimum number of colours that is sufficient to vertex-colour any planar graph is ________.
answered Feb 13, 2016 in Graph Theory 6.6k views
48 votes
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_______.
answered Feb 13, 2016 in CO and Architecture 4.3k views
46 votes
Consider the system, 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. Which one of the following is CORRECT? $I, II$ and $III$ are true. Only $II$ and $III$ are true. Only $III$ is true. None of them is true.
answered Feb 12, 2016 in Linear Algebra 5.5k views
30 votes
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 smaller than the ... to transmit the packet even after the collision is detected. The exponential back off mechanism reduces the probability of collision on retransmissions.
answered Feb 12, 2016 in Computer Networks 4.2k views
18 votes
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$
answered Feb 12, 2016 in Numerical Ability 4.1k views
42 votes
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 _________.
answered Feb 12, 2016 in Probability 3.4k views
10 votes
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$
answered Feb 12, 2016 in Numerical Ability 3.3k views
24 votes
20 votes
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)
answered Feb 12, 2016 in Verbal Ability 1.8k views
2 votes
Please suggest some ideas what to do after gate exam.
answered Feb 11, 2016 in Others 386 views
0 votes
Q.4 Find the missing sequence in the letter series below: A, CD, GHI, ?, UVWXY (A) LMN (B) MNO (C) MNOP (D) NOPQ
answered Feb 2, 2016 in Numerical Ability 726 views