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 questions in Discrete Mathematics
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
Recent
Hot!
Most votes
Most answers
Most views
Featured
Previous GATE
0
votes
1
answer
1
Doubt in P>Q>R
Which one is equivalent to p>q>r ? A) (p>q)>r B) p>(q>r) Plz give answer with proper explaination.
asked
5 hours
ago
in
Mathematical Logic
by
Dharmesh Gusai 1
(
29
points)

6
views
0
votes
1
answer
2
Group theory
How to solve it? Better solution
asked
10 hours
ago
in
Mathematical Logic
by
jatin khachane 1
(
349
points)

17
views
0
votes
1
answer
3
Self doubt
Let (g,*) be a group of order p where p is a prime number then number of proper subgroup is? I am getting 1 that is identity element, but somewhere I read, it will be 0. Who is wrong?
asked
11 hours
ago
in
Set Theory & Algebra
by
Rishav Kumar Singh
Active
(
2.8k
points)

12
views
discretemathematics
0
votes
0
answers
4
Group theory
In theorem 1: It is said that group is abelian if and only if order of group is prime number In theorem 2 : It is said that the group having order as square of prime number is abelian Theorem 1: https://yutsumura.com/asimpleabeliangroupifandonlyifthe ... The group is not abelian as order is not prime. Theorem 2: 4 = (2)^2 square of prime number hence abelian. Please clarify ..
asked
12 hours
ago
in
Set Theory & Algebra
by
jatin khachane 1
(
349
points)

12
views
0
votes
1
answer
5
Sir i am first year ug student plese help me what to concentrate for gate from 1st year
asked
1 day
ago
in
Mathematical Logic
by
Manikantashetty.4321
(
7
points)

23
views
0
votes
1
answer
6
Types of Functions
A and B are finite sets True or False 1) F:A>B is one to one then F is Onto , where A = B 2) F:A>A is one to one then F is Onto , where F is function on same set
asked
1 day
ago
in
Set Theory & Algebra
by
jatin khachane 1
(
349
points)

14
views
0
votes
1
answer
7
Combination with repetition allowed
Ans. 0
asked
1 day
ago
in
Mathematical Logic
by
Na462
Active
(
4.6k
points)

26
views
permutationsandcombinations
0
votes
0
answers
8
Lattice
Ans. C
asked
1 day
ago
in
Mathematical Logic
by
Na462
Active
(
4.6k
points)

13
views
lattice
discretemathematics
0
votes
1
answer
9
Propositional Logic
Ans. A
asked
1 day
ago
in
Mathematical Logic
by
Na462
Active
(
4.6k
points)

13
views
propositionallogic
mathematicallogic
discretemathematics
0
votes
2
answers
10
Propositional Logic
Ans. B
asked
1 day
ago
in
Mathematical Logic
by
Na462
Active
(
4.6k
points)

17
views
propositionallogic
mathematicallogic
discretemathematics
0
votes
0
answers
11
Countability and Well Ordering
Is there any relation between countability and well ordering? I mean if a set is well ordered, does it have any influence on it being countable and vice versa?
asked
1 day
ago
in
Set Theory & Algebra
by
Lakshay Kakkar
Junior
(
987
points)

6
views
#countableset
0
votes
1
answer
12
self doubt
What will be lower bound of {g}
asked
1 day
ago
in
Set Theory & Algebra
by
Vegeta
(
193
points)

10
views
lattice
discretemathematics
engineeringmathematics
0
votes
1
answer
13
Nested quantifiers
Let domain be set of all fruits. Represent the following English statement into logic. 1)There are exactly 2 apple. S1:∃x∃y[A(x)⋀A(y)⋀(x≠y)⋀∀z(A(z)→(x=z⋁y=z)] S2: ∃x∃y[A(x)⋀A(y)⋀x≠y]⋀~∃x∃y∃z[A(x)⋀A(y)∧A(z)⋀x≠y∧y≠z⋀z≠x] where A(m)= m is an apple Is S1↔S2 ? If yes then how can u convert S2 into S1 using negating quantifier predicates
asked
2 days
ago
in
Mathematical Logic
by
Rohit Pandey
(
197
points)

12
views
0
votes
0
answers
14
Eigen vector
asked
2 days
ago
in
Mathematical Logic
by
Shivangi Parashar 2
(
41
points)

11
views
0
votes
0
answers
15
Eigen vector
asked
3 days
ago
in
Mathematical Logic
by
Shivangi Parashar 2
(
41
points)

15
views
0
votes
1
answer
16
Graph theory
In tree for every pair of vertices u!=v in G their is exactly 1 path from u to v .Please help me to prove this
asked
3 days
ago
in
Graph Theory
by
Shivangi Parashar 2
(
41
points)

23
views
0
votes
1
answer
17
State True/False
1. If f is bijective function then f1 is also bijective function. 2. If f is surjective function then f1 is a function but not surjective. 3. Inverse of a function 'f' is a function only when it is bijective. 4. If a relation R: X>Y is left total, then it must be a function.
asked
3 days
ago
in
Set Theory & Algebra
by
Naveen Kumar 3
Active
(
1.4k
points)

15
views
relations
functions
discretemathematics
+1
vote
1
answer
18
Combinations and Permutations
In how many ways can 12 different books be parceled into 4 packets so that 3 of the packets contain 3 books each and one of them two books atleast, if all the packets have the same destination?
asked
3 days
ago
in
Combinatory
by
Devshree Dubey
Boss
(
13.3k
points)

62
views
discretemathematics
permutationsandcombinations
0
votes
0
answers
19
Kenneth Rosen: Algeraic structure
https://gateoverflow.in/?qa=blob&qa_blobid=8621402344393100507 I am not able to understand How both structure have same signature? Two algebras are of same signature if they have same number of operations and same number of constants and also corresponding operations are of same arity.
asked
3 days
ago
in
Mathematical Logic
by
Sandy Sharma
Junior
(
693
points)

6
views
kennethrosen
discretemathematics
settheory&algebra
0
votes
0
answers
20
Combinatorics
There are 100 students. 85 choose Math, 80 choose Physics, 75 choose Chemistry, 70 choose Biology. What is the minimum number of students choosing all 4 subjects? Assume each student chosen at least one subject?
asked
4 days
ago
in
Combinatory
by
aditi19
(
261
points)

16
views
permutationsandcombinations
0
votes
0
answers
21
Relations and lattice
1. Every complemented lattice is distributed 2. Every Distributed lattice is complemented 3.Every Distributive lattice is bounded 4 .Every complemented lattice is bounded True or false
asked
4 days
ago
in
Mathematical Logic
by
jatin khachane 1
(
349
points)

8
views
+1
vote
1
answer
22
Rosen book Generating Functions pg no 430
asked
5 days
ago
in
Combinatory
by
anip
(
33
points)

19
views
kennethrosen
generatingfunctions
discretemathematics
#counting
0
votes
0
answers
23
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.
asked
5 days
ago
in
Set Theory & Algebra
by
Manish11102
(
31
points)

9
views
+1
vote
0
answers
24
Descrete math
Which of the following is true ?
asked
5 days
ago
in
Mathematical Logic
by
Prince Sindhiya
Active
(
2.3k
points)

49
views
discretemathematics
0
votes
1
answer
25
Rosen Ch9.6
Determine whether each of these posets is wellordered. (Q ∩[0, 1], ≤) (the set of rational numbers between 0 and 1 inclusive) The answer is not well ordered because as it doesn't have any unique least element as 0 can be expressed in p/q forms like (0/12,0/23,0/234). All are representing zero but there is no unique among them. Is this the reason here? Please confirm
asked
6 days
ago
in
Set Theory & Algebra
by
Abhijit Sen 4
(
203
points)

12
views
kennethrosen
discretemathematics
po
setwell
ordered
+1
vote
1
answer
26
Sets ,DM
Let P ( S ) denotes the power set of the set S, the dual of the lattice ( P(S), ⊆ ) is a) Doesn't’t exist b) ( P(S), ⊆ ) c) ( P(S), ⊇ ) d) ( S,⊇)
asked
6 days
ago
in
Mathematical Logic
by
manisha11
(
207
points)

20
views
discretemathematics
settheory&algebra
+1
vote
2
answers
27
Graph theory Modified
What is the maximum integer value m such that every simple connected graph with r vertices and r+2 edges contains at least m different spanning trees ? 1)1 2)4 3)8 4)m
asked
Aug 13
in
Graph Theory
by
srestha
Veteran
(
92.2k
points)

132
views
graphtheory
discretemathematics
0
votes
1
answer
28
made easy test series
1) Every group of prime order is Abelien group. 2) If (G,*) be a cyclic group of even order ,then there exist atleast one elements other than identity element such that a=a^(1)
asked
Aug 13
in
Mathematical Logic
by
talha hashim
Active
(
2.1k
points)

17
views
0
votes
1
answer
29
made easy test series
Every graph with fewer edge than vertices has component of tree(explain)
asked
Aug 13
in
Mathematical Logic
by
talha hashim
Active
(
2.1k
points)

12
views
0
votes
1
answer
30
made easy test series
Consider F be a family of all subsets of set {1,2,3,.....100} that contain atleast 50 numbers,partially ordered with respect to containment.Then maximum size of chains in the poset (F,⊆) that cover F is
asked
Aug 13
in
Mathematical Logic
by
talha hashim
Active
(
2.1k
points)

23
views
Page:
1
2
3
4
5
6
...
128
next »
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
Members at the site
karensharma
sutanay3
GastonKinros
Kushagra Chatterjee
manisha11
Recent Posts
Anxiety
Nielit 2018
Donation (Kerala Flood)
Schedule for GATE 2019
GATE 2019 official website
All categories
General Aptitude
1.3k
Engineering Mathematics
5.5k
Discrete Mathematics
3.8k
Mathematical Logic
1.6k
Set Theory & Algebra
969
Combinatory
671
Graph Theory
624
Probability
673
Linear Algebra
543
Calculus
393
Digital Logic
2.1k
Programming & DS
4k
Algorithms
3.4k
Theory of Computation
4.3k
Compiler Design
1.6k
Operating System
3.1k
Databases
3.1k
CO & Architecture
2.7k
Computer Networks
3.1k
Non GATE
1.1k
Others
1.4k
Admissions
501
Exam Queries
451
Tier 1 Placement Questions
20
Job Queries
62
Projects
12
Follow @csegate
Gatecse
Recent questions in Discrete Mathematics
Recent Blog Comments
Thanx Mk utkarsh and nikhil bro ... i really ...
Firstly I am not topper. or ranker.
but ...
If you are not able to understand the concept of ...
done:)
Thanx man ... i really appreciate it ...
38,203
questions
45,703
answers
132,820
comments
49,755
users