UNIT -I

MULTIPLE CHOICE QUESTIONS

1: Which of the following propositions is tautology?

A.(p v q)→q B. p v (q→p) C.p v (p→q) D.Both (b) & (c)

Option: C

2: Which of the proposition is p^ (~ p v q) is

A.A tautology B.A contradiction C.Logically equivalent to p ^ q D.All of above

Option: C

3: Which of the following is/are tautology?

A.a v b → b ^ c B.a ^ b → b v c C.a v b → (b → c) D.None of these

Option: B

4: Logical expression ( A^ B) → ( C' ^ A) → ( A ≡ 1) is

A.ContradictionB.Valid C.Well-formed formula D.None of these

Option: D

5: Identify the valid conclusion from the premises Pv Q, Q → R, P → M, ˥M

A.P ^ (R v R) B.P ^ (P ^ R) C.R ^ (P v Q) D.Q ^ (P v R)

Option: D

6: Let a, b, c, d be propositions. Assume that the equivalence a ↔ (b v ˥b) and b ↔ c hold. Then

truth value of the formula ( a ^ b) → ((a ^ c) v d) is always

A.True B.False C.Same as the truth value of a D.Same as the truth value of b

Option: A

7: Which of the following is a declarative statement?

A. It's right B. He says C.Two may not be an even integer D.I love you

Option: B

8: P → (Q → R) is equivalent to
A. (P ^ Q) → R B.(P v Q) → R C.(P v Q) → ˥R D.None of these

Option: A

9: Which of the following are tautologies?

A.((P v Q) ^ Q) ↔ Q B.((P v Q) ^ ˥P) → Q C.((P v Q) ^ P) → P D.Both (a) & (b)

Option: D

10: If F1, F2 and F3 are propositional formulae such that F1 ^ F2 → F3 and F1 ^ F2→F3 are both

tautologies, then which of the following is TRUE?

A.Both F1 and F2 are tautologies B.The conjuction F1 ^ F2 is not satisfiable

C.Neither is tautologies D.None of these

43

Option: B

11. Consider two well-formed formulas in propositional logic

F1 : P →˥P F2 : (P →˥P) v ( ˥P →) Which of the following statement is correct?

A.F1 is satisfiable, F2 is unsatisfiable B.F1 is unsatisfiable, F2 is satisfiable

C.F1 is unsatisfiable, F2 is valid D.F1 & F2 are both satisfiable

Option: C

12: What can we correctly say about proposition P1 : (p v ˥q) ^ (q →r) v (r v p)

A.P1 is tautology B.P1 is satisfiable

C.If p is true and q is false and r is false, the P1 is true

D.If p as true and q is true and r is false, then P1 is true

Option: C

13: (P v Q) ^ (P → R )^ (Q →S) is equivalent to

A.S ^ R B.S → R C.S v R D.All of above

Option: C

14: The functionally complete set is

Option: C

15: (P v Q) ^ (P→R) ^ (Q → R) is equivalent to

A.P B.Q C.R D.True = T

Option: C

16: ˥(P → Q) is equivalent to

A.P ^ ˥Q B.P ^ QC.˥P v Q D.None of these

Option: A

17: In propositional logic , which of the following is equivalent to p → q?

A.~p → q B.~p v q C.~p v~ q D.p →q

Option: B

18: Which of the following is FALSE? Read ^ as And, v as OR, ~as NOT, →as one way implication

and ↔ as two way implication?

A.((x → y)^ x) →y B.((~x →y)^ ( ~x ^ ~y))→y C.(x → ( x v y)) D.((x v y) ↔( ~x v ~y))

Option: D

19: Which of the following well-formed formula(s) are valid?

A.((P → Q)^(Q → R))→ (P → R) B.(P → Q) →(˥P → ˥Q)

C.(P v (˥P v ˥Q)) →P D.((P → R) v (Q → R)) → (P v Q}→R)

Option: A

20: Let p and q be propositions. Using only the truth table decide whether p ↔ q does not imply p

→ ˥q is

A.True B.False C.None D.Both A and B

Option: A
UNIT -II

1. A _______ is an ordered collection of objects.

a) Relation b) Function c) Set d) Proposition

Answer: c

2. The set O of odd positive integers less than 10 can be expressed by ___________ .

a) {1, 2, 3} b) {1, 3, 5, 7, 9} c) {1, 2, 5, 9} d) {1, 5, 7, 9, 11}

Answer: b

3. Power set of empty set has exactly _____ subset.

a) One b) Two c) Zero d) Three

Answer: a

4. What is the Cartesian product of A = {1, 2} and B = {a, b}?

a) {(1, a), (1, b), (2, a), (b, b)} b) {(1, 1), (2, 2), (a, a), (b, b)}

c) {(1, a), (2, a), (1, b), (2, b)} d) {(1, 1), (a, a), (2, a), (1, b)}

Answer: c

5. The Cartesian Product B x A is equal to the Cartesian product A x B. Is it True or False?

a) True b) False

Answer: b

6. What is the cardinality of the set of odd positive integers less than 10?

a) 10 b) 5 c) 3 d) 20

Answer: b

7. Which of the following two sets are equal?

a) A = {1, 2} and B = {1} b) A = {1, 2} and B = {1, 2, 3}

c) A = {1, 2, 3} and B = {2, 1, 3} d) A = {1, 2, 4} and B = {1, 2, 3}

Answer: c

8. The set of positive integers is _________.

Answer: a

79

9. What is the Cardinality of the Power set of the set {0, 1, 2}.

a) 8 b) 6 c) 7 d) 9

Answer: a

10. The members of the set S = {x | x is the square of an integer and x < 100} is-----

a) {0, 2, 4, 5, 9, 58, 49, 56, 99, 12} b) {0, 1, 4, 9, 16, 25, 36, 49, 64, 81}

c) {1, 4, 9, 16, 25, 36, 64, 81, 85, 99} d) {0, 1, 4, 9, 16, 25, 36, 49, 64, 121}

Answer: b

11. Let R be the relation on the set of people consisting of (a,b) where aa is the parent of b. Let S

be the relation on the set of people consisting of (a,b) where a and b are siblings. What are S∘R

and R∘S?

A) (a,b) where a is a parent of b and b has a sibling; (a,b) where a is the aunt or uncle of b.

B) (a,b) where a is the parent of b and a has a sibling; (a,b) where a is the aunt or uncle of b.

C) (a,b) where a is the sibling of b's parents; (a,b) where aa is b's niece or nephew.

D) (a,b) where a is the parent of b; (a,b) where a is the aunt or uncle of b.

12. On the set of all integers, let (x,y)∈R(x,y)∈R iff xy≥1xy≥1. Is relation R reflexive,

symmetric, antisymmetric, transitive?

A) Yes, No, No, Yes B) No, Yes, No, Yes

C) No, No, No, Yes D) No, Yes, Yes, Yes E) No, No, Yes, No

13. Let R be a non-empty relation on a collection of sets defined by ARB if and only if A∩ B

= ØThen (pick the TRUE statement)

A.R is relexive and transitive B.R is symmetric and not transitive

C.R is an equivalence relation D.R is not relexive and not symmetric

14. Consider the divides relation, m | n, on the set A = {2, 3, 4, 5, 6, 7, 8, 9, 10}. The cardinality

of the covering relation for this partial order relation (i.e., the number of edges in the Hasse

diagram) is

(a) 4 (b) 6 (c) 5 (d) 8 (e) 7

Ans:e

15. Consider the divides relation, m | n, on the set A = {2, 3, 4, 5, 6, 7, 8, 9, 10}. Which of the

following permutations of A is not a topological sort of this partial order relation?

(a) 7,2,3,6,9,5,4,10,8 (b) 2,3,7,6,9,5,4,10,8

(c) 2,6,3,9,5,7,4,10,8 (d) 3,7,2,9,5,4,10,8,6

(e) 3,2,6,9,5,7,4,10,8

Ans:c

16. Let A = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16} and consider the divides relation

on A. Let C denote the length of the maximal chain, M the number of maximal elements, and

m the number of minimal elements. Which is true?

(a) C = 3, M = 8, m = 6 (b) C = 4, M = 8, m = 6

(c) C = 3, M = 6, m = 6 (d) C = 4, M = 6, m = 4

(e) C = 3, M = 6, m = 4

Ans:a

17. What is the smallest N > 0 such that any set of N nonnegative integers must have two distinct

integers whose sum or difference is divisible by 1000?

(a) 502 (b) 520 (c) 5002 (d) 5020 (e) 52002

Ans:a

18. Let R and S be binary relations on a set A. Suppose that R is reflexive, symmetric, and transitive and

that S is symmetric, and transitive but is not reflexive. Which statement is always true for any such R
and S?

(a) R ∪ S is symmetric but not reflexive and not transitive.

(b) R ∪ S is symmetric but not reflexive.

(c) R ∪ S is transitive and symmetric but not reflexive

80

(d) R ∪ S is reflexive and symmetric. (e) R ∪ S is symmetric but not transitive.

Ans:d

19. Let R be a relation on a set A. Is the transitive closure of R always equal to the transitive

closure of R

? Prove or disprove.

Solution: Suppose A = {1, 2, 3} and R = {(1, 2),(2, 3)}. Then R2 = {(1, 3)}.

Transitive closure of R is R∗ = {(1, 2),(2, 3),(1, 3)}.

Transitive closure of R2

is {(1, 3)}.

They are not always equal.

20. Suppose R1 and R2 are transitive relations on a set A. Is the relation R1 ∪ R2 necessariy a

transitive relation? Justify your answer.

Solution: No. {(1, 2)} and {(2, 3)} are each transitive relations, but their union

{(1, 2),(2, 3)} is not transitive.

21. Let D30 = {1, 2, 3, 4, 5, 6, 10, 15, 30} and relation I be partial ordering on D30. The all lower

bounds of 10 and 15 respectively are

A.1,3 B.1,5 C.1,3,5 D.None of these Option: B

22. Hasse diagrams are drawn for

A.partially ordered sets B.lattices C.boolean Algebra D.none of these

23. A self-complemented, distributive lattice is called

A.Boolean algebra B.Modular lattice C.Complete lattice D.Self dual lattice

Option: A

24. Let D30 = {1, 2, 3, 5, 6, 10, 15, 30} and relation I be a partial ordering on D30. The lub of

10 and 15 respectively is

A.30 B.15 C.10 D.6 Option: A

25: Let X = {2, 3, 6, 12, 24}, and ≤ be the partial order defined by X ≤ Y if X divides Y.

Number of edges in the Hasse diagram of (X, ≤ ) is

A.3 B.4 C.5 D.None of these

Option: B

26. Principle of duality is defined as

A.≤ is replaced by ≥ B.LUB becomes GLB

C.all properties are unaltered when ≤ is replaced by ≥

D.all properties are unaltered when ≤ is replaced by ≥ other than 0 and 1 element.

Option: D

27. Different partially ordered sets may be represented by the same Hasse diagram if they are

A.same B.lattices with same order C.isomorphic D.order-isomorphic

Option: D

28. The absorption law is defined as

A.a * ( a * b ) = b B.a * ( a ⊕ b ) = b C.a * ( a * b ) = a ⊕ bD.a * ( a ⊕ b ) = a

Option: D

29. A partial order is deined on the set S = {x, a1, a2, a3,...... an, y} as x ≤ a i for all i and ai

≤ y for all i, where n ≥ 1. Number of total orders on the set S which contain partial

order ≤ is
A.1 B.n C.n + 2 D.n ! Option: D

30. Let L be a set with a relation R which is transitive, antisymmetric and reflexive and for

any two elements a, b ∈ L. Let least upper bound lub (a, b) and the greatest lower

bound glb (a, b) exist. Which of the following is/are TRUE ?

A.L is a Poset B.L is a boolean algebra C.L is a lattice D.none of these

Option: C

UNIT –III

1. If a|b and b|c, then a|c.

a) True b) False

Answer: a

2. GCD(a,b) is the same as GCD(|a|,|b|).

a) True b) False

Answer: a

3. Calculate the GCD of 1160718174 and 316258250 using Euclidean algorithm.

a) 882 b) 770 c) 1078 d) 1225

Answer: c

4. Calculate the GCD of 102947526 and 239821932 using Euclidean algorithm.

a) 11 b) 12 c) 8 d) 6

Answer: d

5. Calculate the GCD of 8376238 and 1921023 using Euclidean algorithm.

a) 13 b) 12 c) 17 d) 7

Answer: a
6. What is 11 mod 7 and -11 mod 7?

a) 4 and 5 b) 4 and 4 c) 5 and 3 d) 4 and -4

Answer: d

7. Which of the following is a valid property for concurrency?

a) a = b (mod n) if n|(a-b) b) a = b (mod n) implies b = a (mod n)

c) a = b (mod n) and b = c (mod n) implies a = c (mod n)

d) All of the mentioned

Answer: d

8. [(a mod n) + (b mod n)] mod n = (a+b) mod n

a) True b) False

9. [(a mod n) – (b mod n)] mod n = (b – a) mod n

a) True b) False

Answer:b

121

10. 117 mod 13 =

a) 3 b) 7 c) 5 d) 15

Answer: d

11. The multiplicative Inverse of 1234 mod 4321 is

a) 3239 b) 3213 c) 3242 d) Does not exist

Answer: a

12. The multiplicative Inverse of 550 mod 1769 is

a) 434 b) 224 c) 550 d) Does not exist

13. The multiplicative Inverse of 24140 mod 40902 is

a) 2355 b) 5343 c) 3534 d) Does not exist

Answer: d

14. GCD(a,b) = GCD(b,a mod b)

a) True b) False

Answer: a

15. Define an equivalence relation R on the positive integers A = {2, 3, 4, . . . , 20}

if the largest prime divisor of m is the same as the largest prime divisor of n.
The number

of equivalence classes of R is

(a) 8 (b) 10 (c) 9 (d) 11 (e) 7

Ans:a

16. The set of all nth roots of unity under multiplication of complex numbers
form a/an

A.semi group with identity B.commutative semigroups with identity

C.group D.abelian group

Option: D

17. Which of the following statements is FALSE ?

A.The set of rational numbers is an abelian group under addition

B.The set of rational integers is an abelian group under addition

C.The set of rational numbers form an abelian group under multiplication

Option: D

18.In the group G = {2, 4, 6, 8) under multiplication modulo 10, the identity
element is

A.6 B.8 C.4 D.2

Option: A

19. Match the following

A. Groups I. Associativity

B. Semi groups II. Identity

C. Monoids III. Commutative

D. Abelian Groups IV Left inverse

A. A B C D B. A B C D C. A B C D D. A B C D

IV I II III III I IV II II III I IV I II III IV

Option: A

20. Let (Z,*) be an algebraic structure, where Z is the set of integers and the
operation * is

defined by n*m = maximum(n,m). Which of the following statements is TRUE

A.(Z, *) is a monoid B.(Z, *) is an abelian group C.(Z, *) is a group D.None

Option: D

21. Some group (G,0) is known to be abelian. Then which of the following is
TRUE for G ?

A.g = g-1
for every g ∈ G B.g = g

for every g ∈ G

C.(g o h) 2

=g

o h2

for every g,h ∈ G D.G is of finite order

Option: C

22. If the binary operation * is deined on a set of ordered pairs of real numbers
as (a, b)*(c, d)

122

= (ad + bc, bd) and is associative, then (1, 2) * (3, 5) * (3, 4) equals

A.(74,40) B.(32,40) C.(23,11) D.(7,11)

Option: A

23. The linear combination of gcd(252, 198) = 18 is

a) 252*4 – 198*5 b) 252*5 – 198*4 c) 252*5 – 198*2 d) 252*4 – 198*4

Answer:a

24. The inverse of 3 modulo 7 is

a) -1 b) -2 c) -3 d) -4

Answer:b

25. The integer 561 is a Carmichael number.

Answer:a

26. The linear combination of gcd(117, 213) = 3 can be written as

a) 11*213 + (-20)*117 b) 10*213 + (-20)*117

c) 11*117 + (-20)*213 d) 20*213 + (-25)*117

Answer:a

27. The inverse of 7 modulo 26 is

a) 12 b) 14 c) 15 d) 20

Answer:c

28. The inverse of 19 modulo 141 is

a) 50 b) 51 c) 54 d) 52

Answer:d

29. The value of 52003 mod 7 is

a) 3 b) 4 c) 8 d) 9

Answer:a

30. The solution of the linear congruence 4x = 5(mod 9) is

a) 6(mod 9) b) 8(mod 9) c) 9(mod 9) d) 10(mod 9)

Answer:b

31. The linear combination of gcd(10 ,11) = 1 can be written as

a) (-1)*10 + 1*11 b) (-2)*10 + 2*11

c) 1*10 + (-1)*11 d) (-1)*10 + 2*11

Answer:a