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 Gyanu
User Gyanu
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Gyanu
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
GATE19982.15
Faster access to nonlocal variables is achieved using an array of pointers to activation records called a stack heap display activation tree
commented
Nov 25
in
Compiler Design

2.7k
views
gate1998
programming
compilerdesign
normal
runtimeenvironments
1
answer
2
GATE199202,xiii
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: For a context free grammar, FOLLOW(A) is the set of terminals that can appear immediately to the right of nonterminal $A$ in some "sentential" form. ... . FOLLOW(A) and RFOLLOW(A) are always the same. All the three sets are identical. All the three sets are different.
commented
Nov 13
in
Compiler Design

1.7k
views
gate1992
parsing
compilerdesign
normal
1
answer
3
TIFR2013B9
Suppose $n$ straight lines are drawn on a plane. When these lines are removed, the plane falls apart into several connected components called regions. $A$ region $R$ is said to be convex if it has the following property: whenever two points are in $R$, ... regions are produced, but they need not all be convex. All regions are convex but there may be exponentially many of them.
commented
Nov 10
in
Numerical Ability

216
views
tifr2013
numericalability
geometry
cartesiancoordinates
5
answers
4
GATE19983b
Give a regular expression for the set of binary strings where every $0$ is immediately followed by exactly $k$ $1$'s and preceded by at least $k$ $1$’s ($k$ is a fixed integer)
commented
Nov 8
in
Theory of Computation

1.7k
views
gate1998
theoryofcomputation
regularexpressions
easy
3
answers
5
GATE2015250
In a connected graph, a bridge is an edge whose removal disconnects the graph. Which one of the following statements is true? A tree has no bridges A bridge cannot be part of a simple cycle Every edge of a clique with size $\geq 3$ is a bridge (A clique is any complete subgraph of a graph) A graph with bridges cannot have cycle
commented
Oct 31
in
Graph Theory

3.2k
views
gate20152
graphtheory
graphconnectivity
easy
6
answers
6
GATE2007IT2
Let $A$ be the matrix $\begin{bmatrix}3 &1 \\ 1&2\end{bmatrix}$. What is the maximum value of $x^TAx$ where the maximum is taken over all $x$ that are the unit eigenvectors of $A?$ $5$ $\frac{(5 + √5)}{2}$ $3$ $\frac{(5  √5)}{2}$
commented
Oct 30
in
Linear Algebra

3.5k
views
gate2007it
linearalgebra
eigenvalue
normal
3
answers
7
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
Oct 12
in
Probability

1.6k
views
tifr2011
probability
expectation
2
answers
8
Mathematics: GATE 2015 EE How to find which coin is fair?
Two coins $R$ and $S$ are tossed. The 4 joint events $H_RH_S, T_RT_S, H_RT_S, T_RH_S$ have probabilities 0.28, 0.18, 0.30, 0.24, respectively, where H represents head and T represents tail. Which one of the following is TRUE? The coin tosses are independent. $R$ is fair, $S$ is not. $S$ is fair, $R$ is not. The coin tosses are dependent
commented
Oct 11
in
Probability

501
views
probability
gate2015ee
3
answers
9
GATE201944
Consider the following matrix: $R = \begin{bmatrix} 1 & 2 & 4 & 8 \\ 1 & 3 & 9 & 27 \\ 1 & 4 & 16 & 64 \\ 1 & 5 & 25 & 125 \end{bmatrix}$ The absolute value of the product of Eigen values of $R$ is _______
commented
Oct 8
in
Linear Algebra

2.7k
views
gate2019
numericalanswers
engineeringmathematics
linearalgebra
eigenvalue
1
answer
10
GATE2018ECE
Let M be a real 4 × 4 matrix. Consider the following statements : S1 : M has 4 linearly independent eigenvectors. S2 : M has 4 distinct eigenvalues. S3 : M is nonsingular (invertible). Whict one among the following is TRUE? (a) S1 implies S2 (b) S2 implies S1 (c) S1 implies S3 (d) S3 implies S2 Note: Plz explain in detail why other options are incorrect.
commented
Oct 8
in
Set Theory & Algebra

274
views
4
answers
11
GATE201713
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ ... of equations has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$dimensional vector of all 1. no solution infinitely many solutions finitely many solutions
commented
Oct 8
in
Linear Algebra

5.6k
views
gate20171
linearalgebra
systemofequations
normal
1
answer
12
Gate EE 2014 Eigen values
A system matrix is given as follows. The absolute value of the ratio of the maximum eigenvalue to the minimum eigenvalue is _______
commented
Oct 4
in
Linear Algebra

734
views
engineeringmathematics
eigenvalue
linearalgebra
2
answers
13
TIFR2013B1
Let $G= (V, E)$ be a simple undirected graph on $n$ vertices. A colouring of $G$ is an assignment of colours to each vertex such that endpoints of every edge are given different colours. Let $\chi (G)$ denote the chromatic number of $G$, i.e. the minimum numbers of colours ... $a\left(G\right)\leq \frac{n}{\chi \left(G\right)}$ None of the above.
commented
Sep 17
in
Graph Theory

903
views
tifr2013
graphtheory
graphcoloring
9
answers
14
GATE19941.6, ISRO200829
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
commented
Sep 17
in
Graph Theory

9.7k
views
gate1994
graphtheory
permutationandcombination
normal
isro2008
counting
2
answers
15
Mathematics: GATE 2013 ECA27
Let A be an mxn matrix and B an nxm matrix. It is given that determinant ( Im + AB ) = determinant ( In + BA ) , where Ik is the k k identity matrix. Using the above property, the determinant of the matrix given below is ... A) 2 B) 5 C) 8 D) 16
commented
Sep 15
in
Linear Algebra

1.2k
views
gate2013ec
linearalgebra
engineeringmathematics
normal
determinant
1
answer
16
IE Gate 2009
Let P ≠ 0 be a 3 × 3 real matrix. There exist linearly independent vectors x and y such that Px = 0 and Py = 0. The dimension of the range space of P is [IE: GATE2009] (a) 0 (b) 1 (c) 2 (d) 3
commented
Sep 15
in
Linear Algebra

151
views
0
answers
17
IN Gate 2007  Matrix
Let A be an nxn real matrix such that A^2=I and y be an ndimensional vector. Then the linear system of equations AX=Y has A) No solution B) Unique Solution C) More than one but finitely many independent solutions D) infinitely many independent solutions
commented
Sep 15
in
Linear Algebra

298
views
linearalgebra
2007in
engineeringmathematics
1
answer
18
Eigen Vector
The linear operation $L(x)$ is defined by the cross product $L(x)=b \times x$, where $b=\begin{bmatrix} 0 &1 & 0 \end{bmatrix}^T$ and $x=\begin{bmatrix} x_1 &x_2 & x_3 \end{bmatrix}^T$ are three dimensional vectors. The $3 \times 3$ matrix $M$ ... of $M$ are (A) $0,+1,1$ (B) $1,1,1$ (C) $i,i,1$ (D) $i,i,0$ how to solve this..??
commented
Sep 15
in
Linear Algebra

253
views
eigenvalue
linearalgebra
3
answers
19
Gate CE 2005 linear algebra
Consider a non homogeneous system of linear equations representing mathematically an over determined system. Such a system will be (A) consistent having a unique solution (B) consistent having many solutions (C) inconsistent having a unique solution (D) inconsistent having no solution
commented
Sep 14
in
Linear Algebra

661
views
engineeringmathematics
linearalgebra
2
answers
20
Graph Connectivity
Consider the given statements S1: In a simple graph G with 6 vertices, if degree of each vertex is 2, then Euler circuit exists in G. S2:In a simple graph G, if degree of each vertex is 3 then the graph G is connected. Which of the following is/are true?
commented
Sep 5
in
Graph Theory

232
views
graphtheory
eulergraph
graphconnectivity
1
answer
21
Mathematics GATE 2014 IN (2 Marks)
A scalar valued function is defined as $f(x)=x^TAx+b^Tx+c$ , where A is a symmetric positive definite matrix with dimension $n*1$ ; b and x are vectors of dimension $n*1$ .The minimum value of $f(x)$ will occur when x equals. Answer: $(\frac{A^{1}b}{2})$ How to solve this?
commented
Aug 5
in
Linear Algebra

335
views
gate2014in
linearalgebra
matrices
2
answers
22
ISRO 2015  Johnson counter [EE]
A three stage Johnson counter ring in figure is clocked at a constant frequency of fc from starting state of Q0Q1Q2 = 101. The frequency of output Q0Q1Q2 will be (a) fc / 2 (b) fc /6 (c) fc/ 3 (d) fc /8
commented
Jul 10
in
Digital Logic

640
views
digitallogic
isroee
1
answer
23
Zeal Test Series 2019: Graph Theory  Graph Connectivity
commented
Jul 7
in
Graph Theory

115
views
zeal
graphtheory
graphconnectivity
zeal2019
4
answers
24
GATE200367
Let $G =(V,E)$ be an undirected graph with a subgraph $G_1 = (V_1, E_1)$. Weights are assigned to edges of $G$ as follows. $w(e) = \begin{cases} 0 \text{, if } e \in E_1 \\1 \text{, otherwise} \end{cases}$ A singlesource shortest path algorithm is ... of edges in the shortest paths from $v_1$ to all vertices of $G$ $G_1$ is connected $V_1$ forms a clique in $G$ $G_1$ is a tree
commented
Jul 4
in
Algorithms

5.6k
views
gate2003
algorithms
graphalgorithms
normal
1
answer
25
Planar Graph
Can minimum degree of a planar graph be $5$? Give some example
commented
Jun 23
in
Graph Theory

264
views
graphtheory
graphplanarity
7
answers
26
GATE200340
A graph $G=(V,E)$ satisfies $\mid E \mid \leq 3 \mid V \mid  6$. The mindegree of $G$ is defined as $\min_{v\in V}\left\{ \text{degree }(v)\right \}$. Therefore, mindegree of $G$ cannot be $3$ $4$ $5$ $6$
commented
Jun 22
in
Graph Theory

3.9k
views
gate2003
graphtheory
normal
degreeofgraph
0
answers
27
Eulerian circuit
How many Eulerian graphs are possible?
commented
Jun 21
in
Graph Theory

137
views
engineeringmathematics
discretemathematics
graphtheory
0
answers
28
TANCET 2017 TREE
commented
Jun 17
in
Graph Theory

25
views
tancet
0
answers
29
TANCET 2017 ADJACENCY MATRIX
commented
Jun 15
in
Graph Theory

20
views
tancet
1
answer
30
Zeal Test Series 2019: Graph Theory  Counting
Is there any short trick to do it ?
comment edited
Jun 15
in
Graph Theory

132
views
zeal
graphtheory
counting
zeal2019
1
answer
31
Doubt
How many distinct unlabeled graphs are there with 4 vertices and 3 edges?
answered
Jun 13
in
Graph Theory

75
views
1
answer
32
Graph Coloring
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ? There is a condition that adjacent vertices should not be of the same color I am getting $1680$. Is it correct?
comment edited
Jun 13
in
Graph Theory

314
views
graphtheory
graphcoloring
permutationandcombination
0
answers
33
Made Easy Practice Book
The number of labelled subgraph possible for the graph given below are ________.
comment edited
Jun 12
in
Graph Theory

66
views
1
answer
34
GB DL  Test 1  Question 7
The Gray code representation of 11710 is: (A) 1111001 (B) 1001111 (C) 1110110 (D) 1110101
answered
Nov 27, 2018
in
Digital Logic

79
views
gatebook
digitallogic
3
answers
35
ISRO2017Q4
The function f:[0,3]>[1,29] defined by f(x)=2*X^3 15*X^2+36*X+1 is a) injective and surjective b) injective but not surjective c) injective but not surjective d) neither injective nor surjective
answer edited
Oct 12, 2018
in
Set Theory & Algebra

654
views
5
answers
36
TIFR2015A11
Suppose that $f(x)$ is a continuous function such that $0.4 \leq f(x) \leq 0.6$ for $0 \leq x \leq 1$. Which of the following is always true? $f(0.5) = 0.5$. There exists $x$ between $0$ and $1$ such that $f(x) = 0.8x$. There exists $x$ between $0$ and $0.5$ such that $f(x) = x$. $f(0.5) > 0.5$. None of the above statements are always true.
answered
Aug 15, 2018
in
Calculus

620
views
tifr2015
maximaminima
calculus
4
answers
37
GATE2017131
Let $A$ be $n\times n$ real valued square symmetric matrix of rank 2 with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} =$ 50. Consider the following statements. One eigenvalue must be in $\left [ 5,5 \right ]$ The eigenvalue with the largest ... greater than 5 Which of the above statements about eigenvalues of $A$ is/are necessarily CORRECT? Both I and II I only II only Neither I nor II
answered
Jul 20, 2018
in
Linear Algebra

6.3k
views
gate20171
linearalgebra
eigenvalue
normal
50,644
questions
56,523
answers
195,602
comments
101,285
users