The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent activity by Rakesh K
User Rakesh K
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Rakesh K
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
GATE2016254
For the $IEEE$ $802.11$ MAC protocol for wireless communication, which of the following statements is/are TRUE? At least three nonoverlapping channels are available for transmissions. The RTSCTS 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
commented
Jan 20, 2017
in
Computer Networks

4.8k
views
gate20162
computernetworks
wifi
normal
7
answers
2
GATE2016235
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 ... loop? $X^{Y} = a^{b}$ $(res * a)^{Y} = (res * X)^{b}$ $X^{Y} = res * a^{b}$ $X^{Y} = (res * a)^{b}$
answered
Jan 20, 2017
in
Programming

3.1k
views
gate20162
programming
loopinvariants
normal
9
answers
3
GATE200867
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as follows: ... page tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$
commented
Jan 17, 2017
in
Operating System

24.1k
views
gate2008
operatingsystem
virtualmemory
normal
4
answers
4
GATE2016152
Consider that $B$ wants to send a message $m$ that is digitally signed to $A$. Let the pair of private and public keys for $A$ and $B$ be denoted by ${K_{x}}^$ and ${K_{x}}^+$ for $x=A, B$, respectively. Let $K_{x}(m)$ represent the operation of encrypting $m$ with a key $K_{x}$ and ... $\left\{m, {K_{A}}^(H(m))\right\}$ $\left\{m, {K_{A}}^+(m)\right\}$
commented
Jan 17, 2017
in
Computer Networks

3.1k
views
gate20161
computernetworks
networksecurity
easy
5
answers
5
GATE200661
The atomic fetchandset $x, y$ instruction unconditionally sets the memory location $x$ to $1$ and fetches the old value of $x$ in $y$ without allowing any intervening access to the memory location $x$. Consider the following implementation of $P$ and $V$ ... set, a pair of normal load/store can be used The implementation of $V$ is wrong The code does not implement a binary semaphore
commented
Jan 16, 2017
in
Operating System

7.6k
views
gate2006
operatingsystem
processsynchronization
normal
4
answers
6
GATE200870
Consider a file of $16384$ records. Each record is $32$ $bytes$ long and its key field is of size $6$ $bytes$. The file is ordered on a nonkey field, and the file organization is unspanned. The file is stored in a file system with block size $1024$ $bytes$, and the ... secondlevel blocks in the multilevel index are respectively $8$ and $0$ $128$ and $6$ $256$ and $4$ $512$ and $5$
commented
Jan 15, 2017
in
Databases

5.4k
views
gate2008
databases
indexing
normal
8
answers
7
GATE2004IT88
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the connection is in slowstart phase with a current transmit window of $4000$ $\text{bytes}$. ... current transmit window? $4000$ $\text{bytes}$ $8000$ $\text{bytes}$ $10000$ $\text{bytes}$ $12000$ $\text{bytes}$
commented
Jan 14, 2017
in
Computer Networks

6.8k
views
gate2004it
computernetworks
slidingwindow
normal
2
answers
8
GATE200777
Suppose the letters $a, \,b, \,c, \,d, \,e, \,f$ have probabilities $\dfrac{1}{2}, \dfrac{1}{4}, \dfrac{1}{8}, \dfrac{1}{16}, \dfrac{1}{32}, \dfrac{1}{32}$, respectively. What is the average length of the Huffman code for the letters $a, \,b, \,c, \,d, \,e, \,f$? $3$ $2.1875$ $2.25$ $1.9375$
commented
Jan 13, 2017
in
Algorithms

2.1k
views
gate2007
algorithms
greedyalgorithm
normal
huffmancode
7
answers
9
GATE200724
Suppose we uniformly and randomly select a permutation from the $20 !$ permutations of $1, 2, 3\ldots ,20.$ What is the probability that $2$ appears at an earlier position than any other even number in the selected permutation? $\left(\dfrac{1}{2} \right)$ $\left(\dfrac{1}{10}\right)$ $\left(\dfrac{9!}{20!}\right)$ None of these
commented
Jan 12, 2017
in
Probability

4.2k
views
gate2007
probability
easy
uniformdistribution
4
answers
10
GATE200624
Given a set of elements N = {1, 2, ..., n} and two arbitrary subsets A⊆N and B⊆N, how many of the n! permutations $\pi$ from N to N satisfy min($\pi$(A)) = min($\pi$(B)), where min(S) is the smallest integer in the set of integers S, and $\pi$(S) is the set of integers obtained by applying ... $n! \frac{A ∩ B}{A ∪ B}$ $\dfrac{A ∩ B^2}{^n \mathrm{C}_{A ∪ B}}$
commented
Jan 11, 2017
in
Set Theory & Algebra

2.8k
views
gate2006
settheory&algebra
normal
sets
3
answers
11
GATE200614, ISRO201114
Which one of the following in place sorting algorithms needs the minimum number of swaps? Quick sort Insertion sort Selection sort Heap sort
answered
Jan 10, 2017
in
Algorithms

6.2k
views
gate2006
algorithms
sorting
easy
isro2011
4
answers
12
GATE20064
A relation $R$ is defined on ordered pairs of integers as follows: $(x,y)R(u,v) \text{ if } x<u \text{ and } y>v$ Then R is: Neither a Partial Order nor an Equivalence Relation A Partial Order but not a Total Order A total Order An Equivalence Relation
answered
Jan 10, 2017
in
Set Theory & Algebra

1.6k
views
gate2006
settheory&algebra
normal
relations
2
answers
13
GATE200631
Let SHAM$_3$ be the problem of finding a Hamiltonian cycle in a graph $G=(V,E)$ with $V$ divisible by $3$ and DHAM$_3$ be the problem of determining if a Hamiltonian cycle exists in such graphs. Which one of the following is true? Both DHAM$_3$ and SHAM$_3$ are NP ... is NPhard, but DHAM$_3$ is not DHAM$_3$ is NPhard, but SHAM$_3$ is not Neither DHAM$_3$ nor SHAM$_3$ is NPhard
comment edited
Jan 10, 2017
in
Theory of Computation

1.1k
views
gate2006
theoryofcomputation
pnpnpcnph
normal
2
answers
14
GATE200652
The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot? $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$ $\Theta (n^{3})$
commented
Jan 9, 2017
in
Algorithms

4.6k
views
gate2006
algorithms
sorting
easy
4
answers
15
GATE200638
Consider a Boolean function $ f(w,x,y,z)$. Suppose that exactly one of its inputs is allowed to change at a time. If the function happens to be true for two input vectors $ i_{1}=\left \langle w_{1}, x_{1}, y_{1},z_{1}\right \rangle $ ... $ wx\overline{y} \overline{z}, xz, w\overline{x}yz$ $ wx\overline{y}, wyz, wxz, \overline{w}xz, x\overline{y}z, xyz$
commented
Jan 9, 2017
in
Digital Logic

6.7k
views
gate2006
digitallogic
minsumofproductsform
difficult
statichazard
5
answers
16
GATE200523
Packets of the same session may be routed through different paths in: TCP, but not UDP TCP and UDP UDP, but not TCP Neither TCP nor UDP
commented
Jan 8, 2017
in
Computer Networks

5.1k
views
gate2005
computernetworks
tcp
udp
easy
3
answers
17
GATE200582b
Let $s$ and $t$ be two vertices in a undirected graph $G=(V,E)$ having distinct positive edge weights. Let $[X,Y]$ be a partition of $V$ such that $s \in X$ and $t \in Y$. Consider the edge $e$ having the minimum weight amongst all those edges that have ... weighted spanning tree a weighted shortest path from $s$ to $t$ an Euler walk from $s$ to $t$ a Hamiltonian path from $s$ to $t$
commented
Jan 8, 2017
in
Algorithms

1.7k
views
gate2005
algorithms
graphalgorithms
normal
2
answers
18
GATE200583b
Consider the following expression grammar. The semantic rules for expression evaluation are stated next to each grammar production. ... $7$ Precedence of $+$' is higher than that of $\times$', and both operators are left associative; expression is evaluated to $9$
commented
Jan 8, 2017
in
Compiler Design

2.7k
views
gate2005
compilerdesign
parsing
normal
6
answers
19
GATE200550
Let $G(x) = \frac{1}{(1x)^2} = \sum\limits_{i=0}^\infty g(i)x^i$, where $x < 1$. What is $g(i)$? $i$ $i+1$ $2i$ $2^i$
answered
Jan 7, 2017
in
Combinatory

1.5k
views
gate2005
normal
generatingfunctions
1
answer
20
GATE200489
$L_1$ is a recursively enumerable language over $\Sigma$. An algorithm $A$ effectively enumerates its words as $\omega_1, \omega_2, \omega_3, \dots .$ Define another language $L_2$ over $\Sigma \cup \left\{\text{#}\right\}$ ... are true $S_1$ is true but $S_2$ is not necessarily true $S_2$ is true but $S_1$ is not necessarily true Neither is necessarily true
commented
Jan 7, 2017
in
Theory of Computation

3.8k
views
gate2004
theoryofcomputation
turingmachine
difficult
3
answers
21
GATE200474
An examination paper has $150$ multiple choice questions of one mark each, with each question having four choices. Each incorrect answer fetches $0.25$ marks. Suppose $1000$ students choose all their answers randomly with uniform probability. The sum total of the expected marks obtained by all these students is $0$ $2550$ $7525$ $9375$
commented
Jan 7, 2017
in
Probability

2.1k
views
gate2004
probability
expectation
normal
3
answers
22
GATE200437
The elements $32, 15, 20, 30, 12, 25, 16,$ are inserted one by one in the given order into a maxHeap. The resultant maxHeap is
answered
Jan 6, 2017
in
DS

1.5k
views
gate2004
datastructure
heap
normal
4
answers
23
GATE200426
The number of different $n \times n $ symmetric matrices with each element being either 0 or 1 is: (Note: $\text{power} \left(2, X\right)$ is same as $2^X$) $\text{power} \left(2, n\right)$ $\text{power} \left(2, n^2\right)$ $\text{power} \left(2,\frac{ \left(n^2+ n \right) }{2}\right)$ $\text{power} \left(2, \frac{\left(n^2  n\right)}{2}\right)$
answered
Jan 6, 2017
in
Linear Algebra

3.4k
views
gate2004
linearalgebra
normal
matrices
5
answers
24
GATE200384
Host $A$ is sending data to host $B$ over a full duplex link. $A$ and $B$ are using the sliding window protocol for flow control. The send and receive window sizes are $5$ packets each. Data packets (sent only from $A$ to $B$) are all $1000$ bytes long and the transmission ... communication? $7.69 \times 10^6$ Bps $11.11 \times 10^6$ Bps $12.33 \times 10^6$ Bps $15.00 \times 10^6$ Bps
commented
Jan 6, 2017
in
Computer Networks

8.4k
views
gate2003
computernetworks
slidingwindow
normal
5
answers
25
GATE200346
Consider the ALU shown below. If the operands are in $2's$ complement representation, which of the following operations can be performed by suitably setting the control lines $K$ and $C_0$ only (+ and  denote addition and subtraction respectively)? $A + B$, and $A  B$, but not $A + 1$ $A + B$ ... $A  B$ $A + B$, but not $A  B$ or $A + 1$ $A + B$, and $A  B$, and $A + 1$
commented
Jan 5, 2017
in
Digital Logic

5k
views
gate2003
digitallogic
normal
adder
3
answers
26
GATE200341
Consider the following system of linear equations ... are linearly dependent. For how many values of $\alpha$, does this system of equations have infinitely many solutions? \(0\) \(1\) \(2\) \(3\)
commented
Jan 5, 2017
in
Linear Algebra

3k
views
gate2003
linearalgebra
systemofequations
normal
4
answers
27
GATE20124
Assuming $P \neq NP$, which of the following is TRUE? $NP \ complete = NP$ $NPcomplete \cap P = \phi$ $NPhard = NP$ $P = NPcomplete$
comment edited
Jan 4, 2017
in
Theory of Computation

2.8k
views
gate2012
theoryofcomputation
pnpnpcnph
2
answers
28
Implicants and prime implicants
For F(x,y,z)=$\sum (1,3,4,5)$ , what is the number of implicants and prime implicants?
commented
Dec 26, 2016
in
Digital Logic

540
views
digitallogic
kmap
primeimplicants
5
answers
29
GATE2015141
Consider an EntityRelationship $(ER)$ model in which entity sets E$_{1}$ and E$_{2}$ are connected by an m:n relationship R$_{12}$. E$_{1}$ and E$_{3}$ are connected by a 1 : n (1 on the side of E$_{1}$ and n on ... If a relational model is derived from the above $ER$ model, then the minimum number of relations that would be generated if all relation are in $3NF$ is________________.
answered
Dec 24, 2016
in
Databases

4.5k
views
gate20151
databases
erdiagram
normal
numericalanswers
5
answers
30
GATE2015134
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram: For any $x, y \in L$, not necessarily distinct , $x \vee y$ and $x \wedge y$ are join and meet of $x, y$ ... $p_r = 0$ $p_r = 1$ $0 < p_r ≤ \frac{1}{5}$ $\frac{1}{5} < p_r < 1$
commented
Dec 24, 2016
in
Set Theory & Algebra

5k
views
gate20151
settheory&algebra
normal
lattice
5
answers
31
GATE2015131
Consider the following C function. int fun1 (int n) { int i, j, k, p, q = 0; for (i = 1; i < n; ++i) { p = 0; for (j = n; j > 1; j = j/2) ++p; for (k = 1; k < p; k = k * 2) ++q; } return q; } Which one of the following most closely approximates the return value of the function fun1? $n^3$ $n(\log n)^2$ $n \log n$ $n \log(\log n)$
comment edited
Dec 24, 2016
in
Algorithms

4.3k
views
gate20151
algorithms
normal
identifyfunction
6
answers
32
Regular Languages
If L1 contains finite number of strings and L2 is a CFL then $L1\cap L2$ is ____ (A) Regular (B) CSL (C) CFL (D) None of these
commented
Dec 24, 2016
in
Theory of Computation

263
views
theoryofcomputation
regularlanguages
contextfreelanguage
2
answers
33
GATE20143GA7
By the beginning of the $20^{th}$ century, several hypotheses were being proposed, suggesting a paradigm shift in our understanding of the universe. However, the clinching evidence was provided by experimental measurements of the position of a star which was ... the universe Experimental evidence was important in confirming this paradigm shift i, ii and iv iii only i and iv iv only
commented
Dec 22, 2016
in
Verbal Ability

382
views
gate20143
verbalability
passagereading
easy
2
answers
34
GATE19891vii, ISRO201514
A hash table with ten buckets with one slot per bucket is shown in the following figure. The symbols $S1$ to $S7$ initially entered using a hashing function with linear probing. The maximum number of comparisons needed in searching an item that is not present is $4$ $5$ $6$ $3$
commented
Dec 20, 2016
in
DS

6.5k
views
hashing
isro2015
gate1989
datastructure
normal
3
answers
35
GATE201326
The line graph $L(G)$ of a simple graph $G$ is defined as follows: There is exactly one vertex $v(e)$ in $L(G)$ for each edge $e$ in $G$. For any two edges $e$ and $e'$ in $G$, $L(G)$ has an edge between $v(e)$ and $v(e')$, if and only if $e$ and $e'$ ... graph of a planar graph is planar. (S) The line graph of a tree is a tree. $P$ only $P$ and $R$ only $R$ only $P, Q$ and $S$ only
commented
Dec 14, 2016
in
Graph Theory

4.1k
views
gate2013
graphtheory
normal
linegraph
2
answers
36
GATE201315
An index is clustered, if it is on a set of fields that form a candidate key it is on a set of fields that include the primary key the data records of the file are organized in the same order as the data entries of the index the data records of the file are organized not in the same order as the data entries of the index
commented
Dec 14, 2016
in
Databases

3.5k
views
gate2013
databases
indexing
normal
2
answers
37
Instruction pipeline utilization factor
answered
Dec 13, 2016
in
CO and Architecture

232
views
coandarchitecture
pipelining
1
answer
38
Lossy join decomposition
commented
Dec 9, 2016
in
Databases

600
views
databases
databasenormalization
decomposition
1
answer
39
Register data transfer
Registers R1 and R2 contain memory address and data to be written in that memory adress respectively. To execute the instruction that transfers content of R2 to memory adress pointed by R1 we would first need to transfer content of R1 to MAR and R2 to MDR. MAR < R1 MDR < R2 Can both of these operations be performed in same clock cycle?
asked
Dec 9, 2016
in
CO and Architecture

383
views
coandarchitecture
dma
2
answers
40
Statement and Conclusions
commented
Dec 9, 2016
in
Verbal Ability

152
views
verbalability
verbalreasoning
50,309
questions
55,747
answers
192,248
comments
90,539
users