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
Hot questions in Discrete Mathematics
51
votes
5
answers
121
GATE CSE 2010 | Question: 1
Let $G=(V, E)$ be a graph. Define $\xi(G) = \sum\limits_d i_d*d$, where $i_d$ is the number of vertices of degree $d$ in $G.$ If $S$ and $T$ are two different trees with $\xi(S) = \xi(T)$, then $| S| = 2| T |$ $| S | = | T | - 1$ $| S| = | T | $ $| S | = | T| + 1$
gatecse
asked
in
Graph Theory
Sep 21, 2014
by
gatecse
11.4k
views
gatecse-2010
graph-theory
normal
degree-of-graph
32
votes
7
answers
122
GATE IT 2007 | Question: 23
A partial order $P$ is defined on the set of natural numbers as follows. Here $\frac{x}{y}$ denotes integer division. $(0, 0) \in P.$ $(a, b) \in P$ if and only if $(a \% 10) \leq (b \% 10$) and $(\frac{a}{10},\frac{b}{10})\in P.$ ... $P$? (i) and (iii) (ii) and (iv) (i) and (iv) (iii) and (iv)
Ishrat Jahan
asked
in
Set Theory & Algebra
Oct 29, 2014
by
Ishrat Jahan
11.3k
views
gateit-2007
set-theory&algebra
partial-order
normal
38
votes
9
answers
123
GATE CSE 2001 | Question: 2.1
How many $4$-digit even numbers have all $4$ digits distinct? $2240$ $2296$ $2620$ $4536$
Kathleen
asked
in
Combinatory
Sep 14, 2014
by
Kathleen
12.6k
views
gatecse-2001
combinatory
normal
29
votes
6
answers
124
GATE CSE 1990 | Question: 3-x
Indicate which of the following well-formed formulae are valid: $\left(P\Rightarrow Q\right) {\wedge} \left(Q \Rightarrow R\right) \Rightarrow \left(P \Rightarrow R\right)$ ...
makhdoom ghaya
asked
in
Mathematical Logic
Nov 22, 2016
by
makhdoom ghaya
9.3k
views
gate1990
normal
mathematical-logic
propositional-logic
multiple-selects
77
votes
3
answers
125
GATE CSE 2018 | Question: 28
Consider the first-order logic sentence $\varphi \equiv \exists \: s \: \exists \: t \: \exists \: u \: \forall \: v \: \forall \: w \forall \: x \: \forall \: y \: \psi(s, t, u, v, w, x, y)$ ... or equal to $3$ There exists no model of $\varphi$ with universe size of greater than $7$ Every model of $\varphi$ has a universe of size equal to $7$
gatecse
asked
in
Mathematical Logic
Feb 14, 2018
by
gatecse
22.3k
views
gatecse-2018
mathematical-logic
normal
first-order-logic
2-marks
41
votes
9
answers
126
GATE IT 2004 | Question: 31
Let $p, q, r$ and $s$ be four primitive statements. Consider the following arguments: $P: [(¬p\vee q) ∧ (r → s) ∧ (p \vee r)] → (¬s → q)$ $Q: [(¬p ∧q) ∧ [q → (p → r)]] → ¬r$ $R: [[(q ∧ r) → p] ∧ (¬q \vee p)] → r$ $S: [p ∧ (p → r) ∧ (q \vee ¬ r)] → q$ Which of the above arguments are valid? $P$ and $Q$ only $P$ and $R$ only $P$ and $S$ only $P, Q, R$ and $S$
Ishrat Jahan
asked
in
Mathematical Logic
Nov 2, 2014
by
Ishrat Jahan
11.7k
views
gateit-2004
mathematical-logic
normal
propositional-logic
2
votes
2
answers
127
GATE CSE 2024 | Set 2 | Question: 7
Let $\text{A}$ be the adjacency matrix of a simple undirected graph $\text{G}$. Suppose $\text{A}$ is its own inverse. Which one of the following statements is always TRUE? $\text{G}$ is a cycle $\text{G}$ is a perfect matching $\text{G}$ is a complete graph There is no such graph $\text{G}$
Arjun
asked
in
Graph Theory
Feb 16
by
Arjun
2.5k
views
gatecse2024-set2
graph-theory
46
votes
6
answers
128
GATE CSE 2002 | Question: 1.4
The minimum number of colours required to colour the vertices of a cycle with $n$ nodes in such a way that no two adjacent nodes have the same colour is $2$ $3$ $4$ $n-2 \left \lfloor \frac{n}{2} \right \rfloor+2$
Kathleen
asked
in
Graph Theory
Sep 15, 2014
by
Kathleen
11.1k
views
gatecse-2002
graph-theory
graph-coloring
normal
30
votes
3
answers
129
GATE CSE 1998 | Question: 1.7
Let $R_1$ and $R_2$ be two equivalence relations on a set. Consider the following assertions: $R_1 \cup R_2$ is an equivalence relation $R_1 \cap R_2$ is an equivalence relation Which of the following is correct? Both assertions are true Assertions (i) is true ... (ii) is not true Assertions (ii) is true but assertions (i) is not true Neither (i) nor (ii) is true
Kathleen
asked
in
Set Theory & Algebra
Sep 25, 2014
by
Kathleen
12.4k
views
gate1998
set-theory&algebra
relations
normal
15
votes
6
answers
130
GATE CSE 2022 | Question: 41
Consider the following recurrence: $\begin{array}{} f(1) & = & 1; \\ f(2n) & = & 2f(n) - 1, & \; \text{for}\; n \geq 1; \\ f(2n+1) & = & 2f(n) + 1, & \; \text{for}\; n \geq 1. \end{array}$ Then, which of the following statements is/are $\text{TRUE}?$ ... $f(2^{n}) = 1$ $f(5 \cdot 2^{n}) = 2^{n+1} + 1$ $f(2^{n} + 1) = 2^{n} + 1$
Arjun
asked
in
Combinatory
Feb 15, 2022
by
Arjun
7.7k
views
gatecse-2022
combinatory
recurrence-relation
multiple-selects
2-marks
29
votes
8
answers
131
GATE CSE 2017 Set 1 | Question: 01
The statement $\left ( ¬p \right ) \Rightarrow \left ( ¬q \right )$ is logically equivalent to which of the statements below? $p \Rightarrow q$ $q \Rightarrow p$ $\left ( ¬q \right ) \vee p$ $\left ( ¬p \right ) \vee q$ I only I and IV only II only II and III only
khushtak
asked
in
Mathematical Logic
Feb 14, 2017
by
khushtak
8.9k
views
gatecse-2017-set1
mathematical-logic
propositional-logic
easy
58
votes
9
answers
132
GATE CSE 2017 Set 2 | Question: 47
If the ordinary generating function of a sequence $\left \{a_n\right \}_{n=0}^\infty$ is $\large \frac{1+z}{(1-z)^3}$, then $a_3-a_0$ is equal to ___________ .
Arjun
asked
in
Combinatory
Feb 14, 2017
by
Arjun
17.6k
views
gatecse-2017-set2
combinatory
generating-functions
numerical-answers
normal
69
votes
6
answers
133
GATE CSE 2016 Set 2 | Question: 27
Which one of the following well-formed formulae in predicate calculus is NOT valid ? $(\forall _{x} p(x) \implies \forall _{x} q(x)) \implies (\exists _{x} \neg p(x) \vee \forall _{x} q(x))$ ... $\forall x (p(x) \vee q(x)) \implies (\forall x p(x) \vee \forall x q(x))$
Akash Kanase
asked
in
Mathematical Logic
Feb 12, 2016
by
Akash Kanase
16.8k
views
gatecse-2016-set2
mathematical-logic
first-order-logic
normal
40
votes
7
answers
134
GATE CSE 2010 | Question: 28
The degree sequence of a simple graph is the sequence of the degrees of the nodes in the graph in decreasing order. Which of the following sequences can not be the degree sequence of any graph? $7, 6, 5, 4, 4, 3, 2, 1$ $6, 6, 6, 6, 3, 3, 2, 2$ $7, 6, 6, 4, 4, 3, 2, 2$ $8, 7, 7, 6, 4, 2, 1, 1$ I and II III and IV IV only II and IV
gatecse
asked
in
Graph Theory
Sep 21, 2014
by
gatecse
18.4k
views
gatecse-2010
graph-theory
degree-of-graph
43
votes
8
answers
135
GATE CSE 2006 | Question: 73
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in $G$ is: $n$ $n + 2$ $2^{\frac{n}{2}}$ $\frac{2^{n}}{n}$
go_editor
asked
in
Graph Theory
Apr 24, 2016
by
go_editor
8.6k
views
gatecse-2006
graph-theory
normal
graph-connectivity
23
votes
2
answers
136
GATE CSE 1999 | Question: 1.2
The number of binary relations on a set with $n$ elements is: $n^2$ $2^n$ $2^{n^2}$ None of the above
Kathleen
asked
in
Set Theory & Algebra
Sep 23, 2014
by
Kathleen
11.2k
views
gate1999
set-theory&algebra
relations
combinatory
easy
65
votes
9
answers
137
GATE CSE 2004 | Question: 75
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pairs used to colour any two letters are different. Both prints of a letter can also be coloured with the same colour. What is the minimum value of $k$ that satisfies this requirement? $9$ $8$ $7$ $6$
Kathleen
asked
in
Combinatory
Sep 18, 2014
by
Kathleen
16.6k
views
gatecse-2004
combinatory
36
votes
5
answers
138
GATE CSE 2007 | Question: 85
Suppose that a robot is placed on the Cartesian plane. At each step it is allowed to move either one unit up or one unit right, i.e., if it is at $(i,j)$ then it can move to either $(i + 1, j)$ or $(i,j + 1)$. Suppose that the robot is not allowed to traverse the ... $^{20}\mathrm{C}_{10} - ^{8}\mathrm{C}_{4}\times ^{11}\mathrm{C}_{5}$
go_editor
asked
in
Combinatory
Apr 23, 2016
by
go_editor
9.4k
views
gatecse-2007
combinatory
normal
discrete-mathematics
2
votes
2
answers
139
GATE CSE 2024 | Set 2 | Question: 53
Let $Z_{n}$ be the group of integers $\{0,1,2, \ldots, n-1\}$ with addition modulo $n$ as the group operation. The number of elements in the group $Z_{2} \times Z_{3} \times Z_{4}$ that are their own inverses is ___________.
Arjun
asked
in
Set Theory & Algebra
Feb 16
by
Arjun
1.8k
views
gatecse2024-set2
numerical-answers
set-theory&algebra
group-theory
1
vote
2
answers
140
GATE CSE 2024 | Set 2 | Question: 24
Let $\text{P}$ be the partial order defined on the set $\{1,2,3,4\}$ as follows \[ P=\{(x, x) \mid x \in\{1,2,3,4\}\} \cup\{(1,2),(3,2),(3,4)\} \] The number of total orders on $\{1,2,3,4\}$ that contain $\text{P}$ is __________.
Arjun
asked
in
Set Theory & Algebra
Feb 16
by
Arjun
1.8k
views
gatecse2024-set2
numerical-answers
set-theory&algebra
partial-order
Page:
« prev
1
2
3
4
5
6
7
8
9
10
11
12
...
355
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)
Mathematical Logic
(2.5k)
Set Theory & Algebra
(1.9k)
Combinatory
(1.6k)
Graph Theory
(1.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