0% found this document useful (0 votes)
41 views2 pages

DMGT Assignment Questions

The document contains a series of assignment questions divided into two units, focusing on logical reasoning, set theory, relations, and algebraic structures. Unit 1 includes questions on tautologies, well-formed formulas, logical equivalences, and argument validity, while Unit 2 covers equivalence relations, partitions, and properties of binary operations. Each question requires analytical skills in mathematics and logic.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
41 views2 pages

DMGT Assignment Questions

The document contains a series of assignment questions divided into two units, focusing on logical reasoning, set theory, relations, and algebraic structures. Unit 1 includes questions on tautologies, well-formed formulas, logical equivalences, and argument validity, while Unit 2 covers equivalence relations, partitions, and properties of binary operations. Each question requires analytical skills in mathematics and logic.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Unit-1 (ASSIGNMENT QUESTIONS)

1. Determine (P⋀�) ⟶ � Tautology or Contradiction?


2. Define well formed formula

3. Obtain DNF and CNF of p  ( p  q ) .


4. Write the converse ,contrapositive of “If P is a square, then P is a rectangle”.
5. Without constructing the Truth Table, prove that
∼ �⋀� ⟶ ∽ � ∨ ∼ � ∨ � ��� ( ∽ � ∨ �) are Logically Equivalent

6. Obtain the PDNF of negation of p  (p  q  r ) .


7. If there was a meeting then catching the bus was difficult .If they arrived on time then catching
the bus was not difficult .They arrived on time therefore there was no meeting .Show that these
statements constitutes a valid argument
8. Using the indirect method ,show that p q,q r, ~(p r),p r is tautological implied with r
9. a) By using CP rule, show that the following argument is valid.
“If A works hard then either B or C will enjoy. If B enjoys then A will not work hard. If D enjoys
then C will not. Therefore, if A works hard then D will not enjoy”.
b) Construct the truth table for ∼ P ∨ Q ∧ R ↔ P ∨ Q ∧ (P ∨ R)
10. a) Verify the validity of the following argument “ Every living thing is a plant or an animal.
David’s dog is alive and it is not a plant. All animals have hearts. Hence, David’s dog has a heart.”
b) Show that R∧ PVQ is a valid conclusion from the premises PVQ,Q RPand ~M.

11. a) Show that (x )P ( x )  Q ( x )   (x ) P ( x )  (x )Q ( x ).


b) Show that the premises a b c), d b~ c), a d are inconsistent
12. a) Verify the validity of the following arguments:
All men are mortal.
Socrates is a man.
Therefore, Socrates is mortal

b) Obtain the PCNF of (p  r )  (q  p ). without using truth table

Unit-2 (ASSIGNMENT QUESTIONS)


1. Let S = {(1 ,2).(1,3),(2,1),(3,3)} find S2.
2. Let the seet A= {1, 2, 3, 4} and the relation R =
{(1,1),(1,4),(4,1),(4,4),(2,2),(2,3),(3,2),(3,3)}defined on [Link] its matrix and graph.
3. Define Monoid.
4. Define group with respect to any binary operation.
5. If R and S are equilence relations on set A .prove that R∩S is an equivalence relation.
6. Verify the following relation R on X = {1, 2, 3, 4} is an equivalence relation or not? Given R =
{(1, 1), (1, 4), (4, 1), (2, 2), (2, 3), (3, 4), (3, 3), (3, 2), (4, 3),(4, 4)}.
7. Show that the “greater than or equal” relation (≥) is a partial ordering on the set of integers.
8. Let X = {1, 2, 3, 4, 5, 6, 7} and R= {(x,y)/ x-y is divisible by 3} in X. show that R is and
Equivalence Relation.

9. (a)Define partition of a set and covering of sets, let


A1={{a,b},{b,c}},A2={{a},{a,c}},A3={{a},{b,c}},A4={{a,b,c}},A5={{a},{b},{c}} and
A6={{a},{a, b},{a, c}}.which of the following sets are partitions and covers the set A= { a, b, c }.
(b) Determine whether the binary operation * is commutative and associative on the set
(i) z+, where a*b = a+b+2. (ii) Z, where a*b = ab.

10. (a) Let A ={2,3,6,12,24,36} and the relation on A defined as a≤b if a divides b. Draw the Hasse
diagram for (A,≤) .
(b) Show that (Z5 -{0}, ×5) is an abelian group
11. (a) Show that (Z,*) is an abelian group with respect to the binary operation * , which is defined
by a*b=a+b+1.
(b) Give S = {1,2,3,4…10} and relation R on S where R ={(x,y)/x+y =10} what are the properties of
the relation.
12. (a) Draw the Hasse Diagram for poset {(A, B): A ⊆ � } on the power set P(S) where S = {a, b, c}
and ⊆ is a relation.
(b) Let � and � be two relations on set of positive integers � = {(�, 2�)/� ∈ �+ } , � = {(�, 7�)/� ∈
�+ } find ���, ���, ����� and �����.

You might also like