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
Recent activity by paraskk
User paraskk
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User paraskk
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
GATE19982.20
Suppose the domain set of an attribute consists of signed four digit numbers. What is the percentage of reduction in storage space of this attribute if it is stored as an integer rather than in character form? $\text{80%}$ $\text{20%}$ $\text{60%}$ $\text{40%}$
commented
Nov 6
in
Digital Logic

2.1k
views
gate1998
digitallogic
numberrepresentation
normal
1
answer
2
GATE20152GA9
If p, q, r, s are distinct integers such that: $f (p, q, r, s) = \text{ max } (p, q, r, s)$ $g (p, q, r, s) = \text{ min } (p, q, r, s)$ ... the same operations are valid with two variable functions of the form $f(p, q)$ What is the value of $fg \left(h \left(2, 5, 7, 3\right), 4, 6, 8\right)$?
commented
Oct 31
in
Set Theory & Algebra

1.8k
views
gate20152
settheory&algebra
functions
normal
numericalanswers
11
answers
3
GATE2014149
A pennant is a sequence of numbers, each number being $1$ or $2$. An $n$pennant is a sequence of numbers with sum equal to $n$. For example, $(1,1,2)$ is a $4$pennant. The set of all possible $1$pennants is ${(1)}$, the set of all possible $2$pennants is ... $(1,2)$ is not the same as the pennant $(2,1)$. The number of $10$pennants is________
answered
Oct 28
in
Combinatory

3k
views
gate20141
permutationandcombination
numericalanswers
normal
2
answers
4
GATE2008IT25
In how many ways can $b$ blue balls and $r$ red balls be distributed in $n$ distinct boxes? $\frac{(n+b1)!\,(n+r1)!}{(n1)!\,b!\,(n1)!\,r!}$ $\frac{(n+(b+r)1)!}{(n1)!\,(n1)!\,(b+r)!}$ $\frac{n!}{b!\,r!}$ $\frac{(n + (b + r)  1)!} {n!\,(b + r  1)}$
commented
Oct 28
in
Combinatory

2.4k
views
gate2008it
permutationandcombination
normal
4
answers
5
GATE199114,a
Consider the binary tree in the figure below: (a). What structure is represented by the binary tree?
commented
Sep 10
in
DS

1.2k
views
gate1991
datastructure
binarytree
timecomplexity
normal
2
answers
6
GATE199110a
Consider the following grammar for arithmetic expressions using binary operators $$ and $/$ which are not associative $E \rightarrow E T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol) Is the grammar unambiguous? Is so, what is the relative precedence between $$ and $/$? If not, give an unambiguous grammar that gives $/$ precedence over $$.
commented
Aug 26
in
Compiler Design

1.3k
views
gate1991
grammar
compilerdesign
normal
descriptive
4
answers
7
GATE199417
State whether the following statements are True or False with reasons for your answer: Coroutine is just another name for a subroutine. A two pass assembler uses its machine opcode table in the first pass of assembly.
answered
Aug 25
in
Compiler Design

657
views
gate1994
compilerdesign
normal
assembler
2
answers
8
GATE199201,viii
The purpose of instruction location counter in an assembler is _______
answered
Aug 25
in
Compiler Design

848
views
gate1992
compilerdesign
assembler
normal
2
answers
9
GATE19991.15
The number of articulation points of the following graph is $0$ $1$ $2$ $3$
commented
Aug 24
in
Graph Theory

1.7k
views
gate1999
graphtheory
graphconnectivity
normal
5
answers
10
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 ... $\left(\frac{1}{n}\right)$ $\left(\frac{2}{n}\right)$ $\left(\frac{3}{n}\right)$
commented
Aug 22
in
Graph Theory

3.1k
views
gate2006it
graphtheory
graphcoloring
normal
2
answers
11
GATE199613
Let $Q=\left( \left\{q_1,q_2 \right\}, \left\{a,b\right \}, \left\{a,b,\bot \right\}, \delta, \bot, \phi \right)$ be a pushdown automaton accepting by empty stack for the language which is the set of all nonempty even palindromes over the set $\left\{a,b\right\}$. ... $\delta(q_2,b,b) = \left\{(q_2, \epsilon)\right\}$ $\delta(q_2,\epsilon,\bot) = \left\{(q_2, \epsilon)\right\}$
commented
Aug 17
in
Theory of Computation

988
views
gate1996
theoryofcomputation
pushdownautomata
normal
5
answers
12
TIFR2010B36
In a directed graph, every vertex has exactly seven edges coming in. What can one always say about the number of edges going out of its vertices? Exactly seven edges leave every vertex. Exactly seven edges leave some vertex. Some vertex has at least seven edges leaving it. The number of edges coming out of vertex is odd. None of the above.
commented
Aug 16
in
Graph Theory

1.2k
views
tifr2010
graphtheory
degreeofgraph
2
answers
13
GATE2007IT14
Consider a $TCP$ connection in a state where there are no outstanding $ACK$s. The sender sends two segments back to back. The sequence numbers of the first and second segments are $230$ and $290$ respectively. The first segment was lost, but the second segment was received correctly by the ... and $Y$ (in that order) are $60$ and $290$ $230$ and $291$ $60$ and $231$ $60$ and $230$
commented
Jul 6
in
Computer Networks

2.6k
views
gate2007it
computernetworks
tcp
normal
1
answer
14
GATE20136
Which one of the following is the tightest upper bound that represents the number of swaps required to sort $n$ numbers using selection sort? $O(\log n$) $O(n$) $O(n \log n$) $O(n^{2}$)
commented
Jun 15
in
Algorithms

2k
views
gate2013
algorithms
sorting
easy
1
answer
15
Minimum Number of Comparisons Required
Q.13 The minimum number of comparisons required to find the minimum and the maximum of 100 numbers is _________________. (a) 147.1 to 148.1 (b) 140 to 146 (c)145.1 to 146.1 (d) 140 to 148
commented
Jun 14
in
Algorithms

169
views
algorithms
6
answers
16
TIFR2017B12
An undirected graph is complete if there is an edge between every pair of vertices. Given a complete undirected graph on $n$ vertices, in how many ways can you choose a direction for the edges so that there are no directed cycles? $n$ $\frac{n(n1)}{2}$ $n!$ $2^n$ $2^m, \: \text{ where } m=\frac{n(n1)}{2}$
commented
Jun 10
in
Graph Theory

1.8k
views
tifr2017
graphtheory
counting
3
answers
17
GATE200479
How many graphs on $n$ labeled vertices exist which have at least $\frac{(n^2  3n)}{ 2}$ edges ? $^{\left(\frac{n^2n}{2}\right)}C_{\left(\frac{n^23n} {2}\right)}$ $^{{\large\sum\limits_{k=0}^{\left (\frac{n^23n}{2} \right )}}.\left(n^2n\right)}C_k\\$ $^{\left(\frac{n^2n}{2}\right)}C_n\\$ $^{{\large\sum\limits_{k=0}^n}.\left(\frac{n^2n}{2}\right)}C_k$
commented
Jun 9
in
Graph Theory

4.4k
views
gate2004
graphtheory
permutationandcombination
normal
counting
1
answer
18
self doubt about maths practice
Where can i find only maths PYQ all branches . for practice ?
commented
Apr 27
in
Mathematical Logic

34
views
1
answer
19
TIFR2019A12
Let $f$ be a function with both input and output in the set $\{0,1,2, \dots ,9\}$, and let the function $g$ be defined as $g(x) = f(9x)$. The function $f$ is nondecreasing, so that $f(x) \geq f(y)$ for $x \geq y$. Consider the following statements: There ... must be TRUE for ALL such functions $f$ and $g$ ? Only $(i)$ Only $(i)$ and $(ii)$ Only $(iii)$ None of them All of them
commented
Apr 26
in
Set Theory & Algebra

512
views
tifr2019
engineeringmathematics
discretemathematics
settheory&algebra
functions
6
answers
20
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$
commented
Apr 26
in
Combinatory

1.6k
views
gate2005
normal
generatingfunctions
3
answers
21
GATE2017231
For any discrete random variable $X$, with probability mass function $P(X=j)=p_j, p_j \geq 0, j \in \{0, \dots , N \}$, and $\Sigma_{j=0}^N \: p_j =1$, define the polynomial function $g_x(z) = \Sigma_{j=0}^N \: p_j \: z^j$. For a certain discrete random ... $Y$ is $N \beta(1\beta)$ $N \beta$ $N (1\beta)$ Not expressible in terms of $N$ and $\beta$ alone
commented
Apr 22
in
Probability

4.5k
views
gate20172
probability
randomvariable
1
answer
22
TIFR2012B7
A bag contains $16$ balls of the following colors: 8 red, 4 blue, 2 green, 1 black, and 1 white. Anisha picks a ball randomly from the bag, and messages Babu its color using a string of zeros and ones. She replaces the ball in the bag, and repeats this experiment, many times. What is the ... to Babu per experiment? $\dfrac{3}{2}\\$ ${\log 5}\\$ $\dfrac{15}{8}\\$ $\dfrac{31}{16}\\$ $2$
commented
Apr 21
in
Probability

620
views
tifr2012
probability
expectation
3
answers
23
TIFR2011A6
Assume that you are flipping a fair coin, i.e. probability of heads or tails is equal. Then the expected number of coin flips required to obtain two consecutive heads for the first time is. $4$ $3$ $6$ $10$ $5$
commented
Apr 21
in
Probability

1.6k
views
tifr2011
probability
expectation
3
answers
24
GATE2014134
A canonical set of items is given below $S \to L .> R $ $Q \to R.$ On input symbol $<$ the set has a shiftreduce conflict and a reducereduce conflict. a shiftreduce conflict but not a reducereduce conflict. a reducereduce conflict but not a shiftreduce conflict. neither a shiftreduce nor a reducereduce conflict.
commented
Mar 30
in
Compiler Design

4.3k
views
gate20141
compilerdesign
parsing
normal
50,644
questions
56,505
answers
195,555
comments
101,051
users