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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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 akankshadewangan24
User akankshadewangan24
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User akankshadewangan24
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
GATE2017119
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $max\left ( X,0 \right )$ where $max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
commented
Mar 23
in
Probability

3.4k
views
gate20171
probability
randomvariable
numericalanswers
2
answers
2
data structure
the number of inversions in (n,n1,.........3,2,1) is n(n1)/2 how??????????????????/
answer selected
Mar 19
in
Programming

49
views
datastructure
3
answers
3
GATE2015151
Consider the NPDA $$ \left \langle Q= \left \{ q_{0}, q_{1}, q_{2} \right \},\Sigma = \left \{ 0, 1 \right \}, \Gamma = \left \{ 0, 1, \perp \right \}, \delta, q_{0}, \perp, F =\left \{ q_{2} ... state transition is as follows: Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton? $10110$ $10010$ $01010$ $01001$
commented
Mar 15
in
Theory of Computation

4.4k
views
gate20151
theoryofcomputation
pushdownautomata
normal
5
answers
4
GATE2014234
For a C program accessing $\mathbf{X[i] [j] [k]}$, the following intermediate code is generated by a compiler. Assume that the size of an integer is $32$ bits and the size of a character is $8$ bits. t0 = i ∗ 1024 t1 = j ∗ 32 t2 = k ∗ 4 t3 = t1 + t0 t4 = t3 + t2 ... is declared as "char $\mathbf{X[4] [32] [8]}$ . $\mathbf{X}$ is declared as "char $\mathbf{X[32] [16] [2]}$ .
commented
Mar 13
in
Compiler Design

3.9k
views
gate20142
compilerdesign
intermediatecode
programminginc
normal
1
answer
5
GATE201221
Consider a random variable $X$ that takes values $+1$ and $−1$ with probability $0.5$ each. The values of the cumulative distribution function $F(x)$ at $x = −1$ and $+1$ are $0$ and $0.5$ $0$ and $1$ $0.5$ and $1$ $0.25$ and $0.75$
commented
Mar 9
in
Probability

1.9k
views
gate2012
probability
randomvariable
easy
2
answers
6
GATE2007IT65
Consider a selection of the form $\sigma_{A\leq 100} (r)$, where $r$ is a relation with 1000 tuples. Assume that the attribute values for A among the tuples are uniformly distributed in the interval [0, 500]. Which one of the following options is the best estimate of the number of tuples returned by the given selection query ? 50 100 150 200
commented
Mar 8
in
Databases

1.8k
views
gate2007it
databases
relationalcalculus
probability
uniformdistribution
normal
4
answers
7
GATE200845
Dijkstra's single source shortest path algorithm when run from vertex $a$ in the above graph, computes the correct shortest path distance to only vertex $a$ only vertices $a, e, f, g, h$ only vertices $a, b, c, d$ all the vertices
commented
Feb 18
in
Algorithms

3.9k
views
gate2008
algorithms
graphalgorithms
normal
3
answers
8
GATE2006IT25
Consider the undirected graph $G$ defined as follows. The vertices of $G$ are bit strings of length $n$. We have an edge between vertex $u$ and vertex $v$ if and only if $u$ and $v$ differ in exactly one bit position (in other words, $v$ can be obtained from $u$ by flipping a single bit). ... 1}\right)}$ $\left(\frac{1}{n}\right)$ $\left(\frac{2}{n}\right)$ $\left(\frac{3}{n}\right)$
commented
Feb 13
in
Graph Theory

1.7k
views
gate2006it
graphtheory
graphcoloring
normal
2
answers
9
GATE19903xi
Choose the correct alternatives (More than one may be correct). A graph is planar if and only if, It does not contain subgraphs homeomorphic to $k_{5}$ and $k_{3, 3}$. It does not contain subgraphs isomorphic to $k_{5}$ or $k_{3, 3}$. It does not contain a subgraph isomorphic to $k_{5}$ or $k_{3, 3}$ It does not contain a subgraph homeomorphic to $k_{5}$ or $k_{3, 3}$.
commented
Feb 13
in
Graph Theory

698
views
gate1990
normal
graphtheory
graphplanarity
4
answers
10
ISRO20157
If half adders and full adders are implements using gates, then for the addition of two 17 bit numbers (using minimum gates) the number of half adders and full adders required will be 0,17 16,1 1,16 8,8
commented
Feb 11
in
Digital Logic

4.5k
views
isro2015
digitallogic
adder
halfadder
1
answer
11
GATE2011GGGA8
Three sisters $(R, S,$ and $T)$ received a total of $24$ toys during Christmas. The toys were initially divided among them in a certain proportion. Subsequently, $R$ gave some toys to $S$ which doubled the share of $S$. Then $S$ in turn gave some ... all such exchanges, the three sisters were left with equal number of toys. How many toys did $R$ have originally? $8$ $9$ $11$ $12$
commented
Jan 27
in
Numerical Ability

361
views
gate2011gg
logicalreasoning
numericalability
1
answer
12
test series
plz help me . how to solve that type of question
answered
Jan 27
in
Algorithms

59
views
algo
1
answer
13
GATE20022.2
Consider the following multiplexer where 10, 11, 12, 13 are four data input lines selected by two address line combinations A1A0=00,01,10,11 respectively and f is the output of the multiplexor. EN is the Enable input. The function f(x,y,z) implemented by the above circuit is xyz' xy + z x + y None of the above
commented
Jan 27
in
Digital Logic

2.1k
views
gate2002
digitallogic
circuitoutput
normal
1
answer
14
arun sharma
commented
Jan 26
in
Numerical Ability

97
views
numericalability
number
system
1
answer
15
ethernet
if an ethernet station collide 4 times to try to transmit a single frame .How long might it wait to be before the next attempt if time slot 51.2 micro sec ...................micro sec. a. 768 b. 819.2 c.409.6 d. none
commented
Jan 26
in
Computer Networks

102
views
ethernet
1
answer
16
time complexity
time complexity questions like : h(n)=O(n2); f(n)= O(logn); g(n)=omega(n2); what is the complexity of :::: 1. h(n)g(n)=?? 2. h(n)f(n)=??? elaborate plz
commented
Jan 22
in
Algorithms

92
views
timecomplexity
asymptoticnotations
3
answers
17
GATE2016Session1GA9
If $\large q^{a} = \dfrac{1}{r}$ and $\large r^{b} = \dfrac{1}{s}$ and $\large s^{c} = \dfrac{1}{q}$, the value of $abc$ is ________. $\left(rqs\right)^{1}$ $0$ $1$ $r+q+s$
comment moved
Jan 22
in
Numerical Ability

343
views
gate2016session1aptitude
numericalability
fractions
1
answer
18
gateforum test series
answer given is : 0.153
commented
Jan 21
in
Probability

128
views
gateforumtestseries
probability
0
answers
19
ACE Test Series
commented
Jan 21
in
Probability

91
views
0
answers
20
Nielt ques
commented
Jan 21
in
Probability

39
views
0
answers
21
Declarartion
Void fun(){ int i=0; Printf("%d", i); Static in j=12; // this is error to declare here right????? J=j+1; }
commented
Jan 18
in
Programming

89
views
programminginc
0
answers
22
Associative mapping
If the main memory is of 128 K byte and the cache memory is of 16 byte line . It uses associative mapping . Then the tag bits for cache blocks are......... 11 bit 21bits 16bits 20 bits
asked
Jan 18
in
CO & Architecture

105
views
coandarchitecture
0
answers
23
Test series
How to calculate number of stalls here I m confused
commented
Jan 17
in
CO & Architecture

71
views
0
answers
24
associative mapping
if the main memory is of 8Kbyte and the cache memory 2K word .it uses associative mapping .then each word of cache memory shall be ................................. ans::::: 16 bits how????????????????????
commented
Jan 17
in
CO & Architecture

223
views
coandarchitecture
0
answers
25
database
what is the concept of nested loop join in database????????? link plz or give any example.
asked
Jan 12
in
Databases

24
views
rdbmstables
0
answers
26
networking
Consider the effect of using slow start on a line with 10 msec round trip time. The receiver window and the size of congestion window are set to 38 KB and 36 KB respectively. Sender side threshold is set to 18 KB. After 8 transmission a timeout occurs, after ... to send first full window of 18 KB is____________ (in msec). Assume window size at the start of slow start phase is 2 KB.
asked
Jan 11
in
Computer Networks

29
views
computernetworks
0
answers
27
Graph theory
How many simple graph are possible on six vertices in which the number of edge is odd??
commented
Jan 10
in
Mathematical Logic

109
views
graphtheory
0
answers
28
Ptobability
In any given year the probability of an earthquake greater the magnitude 6 occurring in the Himalaya is 0.04 .the average time between successive occurrence of such earthquake is.........year.?
asked
Jan 1
in
Verbal Ability

88
views
0
answers
29
linear algebra
The number of linearly independent eigen vectors of a scalar matrix of order ‘ n ‘ is / are (A)1 (B)2 (C)n1 (D)n
commented
Dec 30, 2017
in
Mathematical Logic

24
views
engineeringmathematics
0
answers
30
Graphs
How many subgraph with atleast one vertices does k2 have?
commented
Dec 19, 2017
in
Mathematical Logic

48
views
0
answers
31
Computer network
523^21mod55687=? And how
asked
Dec 19, 2017
in
Computer Networks

22
views
computernetworks
1
answer
32
Online_Test
answered
Dec 11, 2017
in
Numerical Ability

102
views
acetestseries
numericalability
0
answers
33
turing machine
is recursive enumerable and recursive set both are infinitely countable set??????? explain if yes or why not.
asked
Dec 6, 2017
in
Theory of Computation

26
views
0
answers
34
Regular expression
Infinite intersection of regular set need not be regular. Example please?
asked
Dec 4, 2017
in
Theory of Computation

44
views
regularexpressions
0
answers
35
Data structure
Which of the following statement are true? 1. Computing the most frequently occurring elements in an array a(1....n) can be done in o(nlogn) time.
asked
Dec 2, 2017
in
Programming

47
views
datastructure
0
answers
36
data structtures
complexity of algorithm to interchange the nth and mth element (node) of singly link list is: a.m+n b.m if m>=n otherwise n c.m if m<=n otherwise n d.m+min(m,n) ans given c???????????how
commented
Dec 2, 2017
in
Programming

48
views
datastructure
1
answer
37
data structure
to find the maximum elements in a min heap represnted by an array can be computed in ____________ time a. theta n b.theta n2 c.theta nlogn d.theta 1
asked
Dec 2, 2017
in
Algorithms

47
views
datastructure
0
answers
38
data structure
you are given an array which contain bboth positive and negative integers in it and asked to design an algorithm to find maximum sum which doest contain twp consecutive numbers .what is the time complexiy of efficient algorithm ? nlogn n2 n n2logn
commented
Dec 2, 2017
in
Algorithms

55
views
datastructure
2
answers
39
aptitude
a principal become rupee 900 after 3 years and 1200 after 6 years on simple intrest then find the principal and rate of intrest?
answer selected
Oct 31, 2017
in
Verbal Ability

65
views
numericalability
5
answers
40
GATE2015134
Suppose $L = \left\{ p, q, r, s, t\right\}$ is a lattice represented by the following Hasse diagram: For any $x, y ∈ L$, not necessarily distinct , $x ∨ y$ and $x ∧ y$ are join and meet of $x, y$, respectively. Let $L^3 = \left\{\left(x, y, z\right): ... ; (x ∨ z)$. Then $p_r = 0$ $p_r = 1$ $0 < p_r ≤ \frac{1}{5}$ $\frac{1}{5} < p_r < 1$
commented
Oct 21, 2017
in
Set Theory & Algebra

3.3k
views
gate20151
settheory&algebra
normal
lattice
36,203
questions
43,662
answers
124,116
comments
42,944
users