Sri Adichunchangiri Shikshsna Trust ®

S J B INSTITUTE OF TECHNOLOGY
Kengeri Bangalore-60
Department of ISE
Subject: D M S Sub Code: CS 34
Sem : III ISE Faculty: Vidyananda MS
Date :20/9/06
QUESTION BANK
SET THEORY AND MATHEMATICAL INDUCTION

1. Show that A∪B = A∩B where A, B⊂U

2. Show that for any 2 sets A & B, A−B = A−(A∩B)
3. Given U = {1,2,3,4,5,6,7,8,9}, A = {1,2,4,6,8}, B = {2,4,5,9} & C = {x | x is a
+ve integers ∃ x2 ≤16}.
____
Compute (i) A∪B (ii) B ⊕ C
4. Determine the sets A & B, given that A - B ={1,3,7,11}, B – A = {2,6,8} &
A∩B = {4,9}
5. Using Venn diagrams, prove the following property of the symmetric difference
A ∆ ( B ∆ C) = (A ∆ B) ∆ C
6. Define (i) Symmetric difference, (ii) Complement & (iii) Disjoint sets with an
example for each.
7. For any sets A, B & C prove the following (i) If A⊆B & B⊆C then A⊆C
(ii) If A⊆B & B⊂C then A⊂C
8. In a survey of 260 college students, the following data were obtained:
64 had taken mathematics course,
94 had taken computer science course,
58 had taken business course,
24 had taken mathematics and business course,
26 had taken mathematics computer science course,
22 had taken computer science & business course,
14 had taken all the three course.
Fine the number of students who had taken
I) none of the courses
II) only the computer science course
9. For all n ∈ Z+ , Show that if n≥ 24 then n can written as a sum of 5’s and / or 7’s.
10. Prove that 3 divides n3-n for every integer n ≥ 2
11. Prove that 4n<(n2−7) for Z+, n≥ 6
12. Prove the following statement by Mathematical Induction “ If a set has n
elements, then its power set has 2n elements”.
13. Prove by M.I. n C 2 + n+1 C 2 = n2
14. A sequence {an} is defined recursively by a1=8, and = an-1 + n2, n≥ 2. Find an in
explicit form
15. Solve the difference equation an = 3 an-1 − 2 an-2 , given that a1=5 and a2=3
16. Ackermann’s function A(m, n) is defined recursively as follows:
A(0,n) = n+1(n≥ 0)
A(m,0)=A(m-1,1) (m>0)
A(m,n) = A(m-1), A(m,n-1)) (m,n>0)
Prove that A(1,n) = n+2 for all n ∈ N
17. Prove that a set of all real numbers in (0,1) is uncountable.
18. Show that the set of all integers is countable.
19. In a survey of 120 passengers, an airline found that 48 enjoyed wine with their
meals, 78 enjoyed mixed drinks, 66 enjoyed iced tea. In addition, 36 enjoyed any
given pair of these beverages and 24 enjoyed them all. If two passengers are
selected at random from the survey sample of 120, what is the probability that
(i) they both want only iced tea with their meals?
(ii) They both enjoy exactly two of the three beverage offerings?
20. A fair dice is thrown twice. Find the probability that
(i) even nos, occur on both throws (ii) even no. occurs in at least one throw

MATHEMATICAL LOGIC

1. Show that for any propositions p & q, the compound proposition p→ (p∨q) is a
tautology & the compound proposition p∧(¬ p∧q) is a contradiction.
2. Prove that for any 3 propositions p, q& r, [p→ (q∧r)] ⇔ [(p→q) ∧(p→r)]
3. Let s be a specified number. Write down the negation of the following conditions,
“ If x is an integer, then x is a rational number”.
4. Prove that [(¬p∨q) ∧(p∧(p∧q))] ⇔p∧q Hence deduce that [(¬p∧q)
∨(p∨(p∨q))] ⇔p∨q.

1. For any propositions p, q & r, Prove the following

(i) p ↑ (q ↑ r) ⇔ ¬ p∨(q ∧r)
(ii) (p ↓ q) ↓ r⇔ (p∨q) ∧¬r
2. Prove the following
(i) [p∧(p→q) ∧r] ⇒ [(p∨q) →r] (ii)
[[p∨(q ∨r)] ∧¬ q] ⇒ p∨r
3. Test whether the following argument is valid, using Rules of Inference.
If I drive to work, then I will arrive tired.
I am not tired (when I arrive at work)
__________________________________
∴ I do not drive to work
4. Test whether the following arguments are valid,
 (i) p →q (ii) p →q
r →s r →s
p ∨r ¬ q ∨¬s
∴ q ∨s ∴ ¬(p ∧r)
5. Write down the following is a valid argument for which the universe is the set of
all students.
No Engg. Student is bad in studies
Anil is not bad in studies
____________________________
∴ Anil is an Engg. Student.
6. Write down the following proposition in symbolic form and find its negation. “
All inters are rational nos. & some rational nos. are not inters”.
7. Give a direct proof of the student. “ The square of an odd inter is an odd integer”
8. For each of the following statements, provide an indirect proof by stating &
providing the contra positive of the given statement.
(i) For all inter k & l, if kl is odd then both k & l are odd
(ii) For all integers k & l, if k+l is even, then k & l are both even or both odd.
9. Provide an indirect proof of the following statement. “For all positive real
numbers x & y, if the product xy exceeds 25, then x>5 or y>5”.
10. Provide a proof by contradiction of the following statement: “For every inter n, if
n2 is odd, then n is odd”.
11. Prove that if m is an even integer, then m+7 is an odd integer.
12. Prove there is no rational nos. whose square is 2.
13. Prove or disprove that the sum of squares of any four non-zero inters is an even
integers.
14. Show that r ∨s follows from c ∨d, c∨d→ ¬ h, ¬ h→a∧¬b & a ∧¬b → r ∨s
15. Let p(x): x ≥ 0, q(x): x2≥ 0 & r(x): x2-3x-4 =0. Then, for the universe comprising
of all real nos, find the truth values of
(i) ∃ x, [p(x) ∧q(x)],
(ii) ∀ x,[p(x) → q(x)] &
(iii) ∃ x, [p(x) ∧r(x)]
16. Define (i) Open Sentence (ii) Quantifiers. Write down the following proposition is
symbolic form, and find is negation. “ If all triangles are right-angled, then no
triangle is equi-angular”.
17. When is a conclusion said to follow from a set of premises? Let p, q & r be the
primitive statements
p: Roger studies. q: Roger plays tennis r: Roger passes in discrete
mathematics.
Let H1, H2 & H3 be the premises:
H1: If Roger studies, then he will pass in Discrete Mathematics.
H2: If Roger does not play tennis, then he will study.
H3: Roger failed in Discrete Mathematics.
Show that q follows from H1, H2, H3
 RELATIONS AND FUNCTIONS

1. For any non-empty sets A, B, C prove the following results:

(i) A × (B ∪ C) = (A × B) ∪ (A × C) (ii) A × (B−C) = (A × B ) − (A × C)
2. Let A= {1,2,3,4} &? Let R be the relation of A defined by xRy iff “ x divides y”.
Written x | y.
(a) Write down R as a set of ordered pairs.
(b) Draw the digraph of R
(c) Determine the in-degree & out-degrees of the vertices in the digraph. (d)
Determine the relation R from a set A to a set B as described by the following
matrix:

1 0 1
1 1 0
MR = 0 0 1
1 0 0

3. Consider the relation R= { (a, a), (a, b), (b, c), (c, d), (c, e), (d, e)},
∞
defined on the set A = {a, b, c, d, e}. Find R & write down its digraph.
4. Let A = {1,2,3} & B = {1,2,3,4}. The relations R & S from A to B are represented
by the following matrices. Determine the relations R, R ∪ S & Sc & their matrix
representations.

1 0 1 0 1 1 1 1
MR = 0 0 0 1 MS = 0 0 0 1
1 1 1 0 0 1 0 1

5. Let R = {(1,1), (1,2), (2,3), (3,3), (3,4)} be a relation on A = {1,2,3,4}. Draw the
digraph of R. Obtain R2 & draw the digraph of R2.
6. Let R= {(1,2),(3,4),(2,2)} & S = {(4,2),(2,5),(3,1),(1,3)} be relations on the set
A = {1,2,3,4,5}. Find the following Ro (R o S), So (S o R).
7. Let A= {a, b, c, d, e} &
R = {(a, d),(d, a),(c, b),(b, c),(c, e),(e, c),(b, e),(e, b),(e, e)} be a symmetric
relation on A. Draw the graph of R. Is R connected?.
8. Let A = {1, 2, 3, 4} & R = {(1, 1), (1, 2), (2, 1), (2, 2), (3, 1), (2, 2), (1, 3), (4, 1),
(4,4)} be a relation on A, Is R an equivalence relation?
9. If R is a relation on the set A = {1, 2, 3, 4} defined by xRy if x | y. Prove that (A,R)
is a poset. Draw its Hass diagram.
10. If (A, R) is a finite poset, prove that A has both a maximal & minimal elements.
11. Prove or disprove the statement “ If (A, R) is a lattice , then R is a total order”.
12. Let A ⊆ U. Define the characteristic function of A over U. If fA(x) denote the
characteristic function of A over U, Show that fA∩B(x) = fA(x) fB(x).
13. Let A = {1, 2, 3, 4, 5, 6} &

P= 1 2 3 4 5 6
2 4 3 2 5 6

(i) Write P as a product of disjoint cycles.

−
(ii) Compute P 1
(iii) Compute p2
14. A function f : A → B is invertible iff it is one to one and onto. Prove the
statement.
15. Let A = {1, 2, 3, 4, 5, 6}. Show that (4, 1, 3, 5) o (5,6,3) ≠ (5, 6, 3) o (4, 1, 3, 5)
16. Let A = {1,2, 3, 4, 5, 6} & B = {6, 7, 8, 9, 10}. If a function f : A→ B is defined
− −
by f= {(1, 7), (2, 7), (3, 8), (4, 6), (5, 9), (6, 9)} determine f 1(6) & f 1(9). If B1=
− −
{7,8} & B2 = {8,9,10}, fine f 1(B1) & f 1(B2).
17. Problem on stirling Numbers of the second kind.

GROUPS AND CODING THEORY

• Problems related to group, subgroups and cyclic groups.

• Any problem on Operation Table
• Theorem or problem on Legrange’s Theorem
• Any problem on Abelian group.
• Any problem on Isomorphism or homomorphism
• Any problem on parity – check matrix? & Generator matrix.
• Any problem on Ring or group code.