Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
Recent
Hot!
Most votes
Most answers
Most views
Previous GATE
Featured
Most viewed questions in Engineering Mathematics
87
votes
7
answers
1
GATE CSE 2004 | Question: 23, ISRO2007-32
Identify the correct translation into logical notation of the following assertion. Some boys in the class are taller than all the girls Note: $\text{taller} (x, y)$ is true if $x$ is taller than $y$ ... $(\exists x) (\text{boy}(x) \land (\forall y) (\text{girl}(y) \rightarrow \text{taller}(x, y)))$
Kathleen
asked
in
Mathematical Logic
Sep 18, 2014
by
Kathleen
110k
views
gatecse-2004
mathematical-logic
easy
isro2007
first-order-logic
69
votes
5
answers
2
GATE CSE 2010 | Question: 30
Suppose the predicate $F(x, y, t)$ is used to represent the statement that person $x$ can fool person $y$ at time $t$. Which one of the statements below expresses best the meaning of the formula, $\qquad∀x∃y∃t(¬F(x,y,t))$ Everyone can ... time No one can fool everyone all the time Everyone cannot fool some person all the time No one can fool some person at some time
gatecse
asked
in
Mathematical Logic
Sep 21, 2014
by
gatecse
69.9k
views
gatecse-2010
mathematical-logic
easy
first-order-logic
39
votes
7
answers
3
GATE CSE 2008 | Question: 23
Which of the following statements is true for every planar graph on $n$ vertices? The graph is connected The graph is Eulerian The graph has a vertex-cover of size at most $\frac{3n}{4}$ The graph has an independent set of size at least $\frac{n}{3}$
Kathleen
asked
in
Graph Theory
Sep 11, 2014
by
Kathleen
54.9k
views
gatecse-2008
graph-theory
normal
graph-planarity
58
votes
7
answers
4
GATE IT 2008 | Question: 4
What is the size of the smallest $\textsf{MIS}$ (Maximal Independent Set) of a chain of nine nodes? $5$ $4$ $3$ $2$
Ishrat Jahan
asked
in
Graph Theory
Oct 27, 2014
by
Ishrat Jahan
49.5k
views
gateit-2008
normal
graph-connectivity
5
votes
2
answers
5
How many transitive relations are there on a set with n elements if a)n=1 b) n=2 c) n=3
How many transitive relations are there on a set with n elements if a)n=1 b) n=2 c) n=3
Sanjay Sharma
asked
in
Set Theory & Algebra
Mar 7, 2017
by
Sanjay Sharma
46.4k
views
13
votes
3
answers
6
relation
Number of relations $S$ over set $\{0,1,2,3 \}$ such that $(x,y) \in S \Rightarrow x = y$
Lakshman Bhaiya
asked
in
Set Theory & Algebra
Dec 27, 2017
by
Lakshman Bhaiya
44.5k
views
set-theory&algebra
relations
83
votes
6
answers
7
GATE CSE 2017 Set 1 | Question: 31
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 ... 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
Arjun
asked
in
Linear Algebra
Feb 14, 2017
by
Arjun
44.2k
views
gatecse-2017-set1
linear-algebra
eigen-value
normal
60
votes
9
answers
8
GATE CSE 2003 | Question: 36
How many perfect matching are there in a complete graph of $6$ vertices? $15$ $24$ $30$ $60$
Kathleen
asked
in
Graph Theory
Sep 16, 2014
by
Kathleen
43.7k
views
gatecse-2003
graph-theory
graph-matching
normal
97
votes
8
answers
9
GATE CSE 2014 Set 2 | Question: 47
The product of the non-zero eigenvalues of the matrix is ____ $\begin{pmatrix} 1 & 0 & 0 & 0 & 1 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 0 & 1 & 1 & 1 & 0 \\ 1 & 0 & 0 & 0 & 1 \end{pmatrix}$
go_editor
asked
in
Linear Algebra
Sep 28, 2014
by
go_editor
36.8k
views
gatecse-2014-set2
linear-algebra
eigen-value
normal
numerical-answers
111
votes
9
answers
10
GATE CSE 2012 | Question: 38
Let $G$ be a complete undirected graph on $6$ vertices. If vertices of $G$ are labeled, then the number of distinct cycles of length $4$ in $G$ is equal to $15$ $30$ $90$ $360$
gatecse
asked
in
Graph Theory
Sep 12, 2014
by
gatecse
34.6k
views
gatecse-2012
graph-theory
normal
marks-to-all
counting
76
votes
12
answers
11
GATE CSE 1994 | Question: 1.6, ISRO2008-29
The number of distinct simple graphs with up to three nodes is $15$ $10$ $7$ $9$
Kathleen
asked
in
Graph Theory
Oct 4, 2014
by
Kathleen
34.4k
views
gate1994
graph-theory
graph-connectivity
combinatory
normal
isro2008
counting
1
vote
1
answer
12
Graph
1. Suppose that G is a non-directed graph with 12 edges. Suppose that G has 6 vertices of degree 3 and the rest have degrees less than 3. The minimum number of vertices G can have? a) 2 b) 0 c)1 d)3 I am getting 3..plz verify
cse23
asked
in
Graph Theory
Jan 20, 2017
by
cse23
33.1k
views
72
votes
8
answers
13
GATE IT 2005 | Question: 32
An unbiased coin is tossed repeatedly until the outcome of two successive tosses is the same. Assuming that the trials are independent, the expected number of tosses is $3$ $4$ $5$ $6$
Ishrat Jahan
asked
in
Probability
Nov 3, 2014
by
Ishrat Jahan
29.2k
views
gateit-2005
probability
binomial-distribution
expectation
normal
66
votes
10
answers
14
GATE CSE 2016 Set 1 | Question: 27
Consider the recurrence relation $a_1 =8 , a_n =6n^2 +2n+a_{n-1}$. Let $a_{99}=K\times 10^4$. The value of $K$ is __________.
Sandeep Singh
asked
in
Combinatory
Feb 12, 2016
by
Sandeep Singh
28.0k
views
gatecse-2016-set1
combinatory
recurrence-relation
normal
numerical-answers
77
votes
7
answers
15
GATE CSE 2018 | Question: 26
Consider a matrix P whose only eigenvectors are the multiples of $\begin{bmatrix} 1 \\ 4 \end{bmatrix}$. Consider the following statements. P does not have an inverse P has a repeated eigenvalue P cannot be diagonalized Which one of the ... III are necessarily true Only II is necessarily true Only I and II are necessarily true Only II and III are necessarily true
gatecse
asked
in
Linear Algebra
Feb 14, 2018
by
gatecse
27.0k
views
gatecse-2018
linear-algebra
matrix
eigen-value
normal
2-marks
38
votes
9
answers
16
GATE CSE 2014 Set 2 | Question: 3
The maximum number of edges in a bipartite graph on $12$ vertices is____
go_editor
asked
in
Graph Theory
Sep 28, 2014
by
go_editor
26.9k
views
gatecse-2014-set2
graph-theory
graph-connectivity
numerical-answers
normal
100
votes
10
answers
17
GATE CSE 2014 Set 1 | Question: 51
Consider an undirected graph $G$ where self-loops are not allowed. The vertex set of $G$ is $\{(i,j) \mid1 \leq i \leq 12, 1 \leq j \leq 12\}$. There is an edge between $(a,b)$ and $(c,d)$ if $|a-c| \leq 1$ and $|b-d| \leq 1$. The number of edges in this graph is______.
go_editor
asked
in
Graph Theory
Sep 28, 2014
by
go_editor
26.5k
views
gatecse-2014-set1
graph-theory
numerical-answers
normal
graph-connectivity
19
votes
2
answers
18
On a set of n elements, how many relations are there that are both irreflexive and antisymmetric?
On a set of n elements, how many relations are there that are both irreflexive and antisymmetric? Please explain how to calculate .
shree
asked
in
Set Theory & Algebra
Oct 24, 2014
by
shree
25.9k
views
set-theory&algebra
relations
57
votes
17
answers
19
GATE CSE 2016 Set 1 | Question: 26
The coefficient of $x^{12}$ in $\left(x^{3}+x^{4}+x^{5}+x^{6}+\dots \right)^{3}$ is ___________.
Sandeep Singh
asked
in
Combinatory
Feb 12, 2016
by
Sandeep Singh
25.5k
views
gatecse-2016-set1
combinatory
generating-functions
normal
numerical-answers
76
votes
5
answers
20
GATE CSE 2007 | Question: 23
Which of the following graphs has an Eulerian circuit? Any $k$-regular graph where $k$ is an even number. A complete graph on $90$ vertices. The complement of a cycle on $25$ vertices. None of the above
Kathleen
asked
in
Graph Theory
Sep 21, 2014
by
Kathleen
25.0k
views
gatecse-2007
graph-theory
normal
graph-connectivity
Page:
1
2
3
4
5
6
...
519
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Discrete Mathematics
(7.1k)
Probability
(1.4k)
Linear Algebra
(1.1k)
Calculus
(792)
Optimization
(0)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Aptitude Overflow