Concept drill
proof
GATE CSE & IT · Algebraic Structures · 1995-1999
3
PYQs
0%
keyed
0
elite explanations
3
years appeared
Study anchor
Rosen — Discrete Mathematics and Its Applications
Discrete structures, counting, relations, graph theory
Practice action
Start latest PYQPYQs in this concept
All concepts →1999 PYQ
(a) Show that the formula $$\left[ {\left( { \sim p \vee Q} \right) \Rightarrow \left( {q \Rightarrow p} \right)} \right]$$ is not a tautology. (b) Let $$A$$ be a tautology and $$B...
easy
1998 PYQ
Let (A, *) be a semigroup. Furthermore, for every a and b in A, if $$a\, \ne \,b$$, then $$a\,*\,b \ne \,\,b\,*\,a$$. (a) Show that for every a in A a * a = a (b) Show that for eve...
hard
1995 PYQ
Prove that in a finite graph, the number of vertices of odd degree is always even.
easy