0% found this document useful (0 votes)
18 views

DM Assignments

Uploaded by

kowiwe1847
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)
18 views

DM Assignments

Uploaded by

kowiwe1847
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
You are on page 1/ 9

KALINGA UNIVERSITY

Department of Computer Science


Assignment-2
Course:MCA Semester:I
Subject:Discrete Mathematics Subject Code:MCA104
Note:Attempt all questions
Short Questions-1,2 & 3.
Long Questions-4 & 5
Instructions:
*For short answer type questions,answer limit is 50 to 100 words.
* For long answer type questions,answer limit is 250 to 300 words.

1. Consider the set A = {4, 5, 6, 7}. Let R be the relation ≤ on A.

Draw the Hasse diagram of R.

2.Prove that (i) a+ 1=1 (ii) a .0=0 using Boolean algebra.

3.State and prove absorption law using Boolean algebra.


4.Prove that ( a+ b ) +c=a+(b+c ) using Boolean algebra.

5.Prove that ( a+ b )' =a ' b' using Boolean algebra.


KALINGA UNIVERSITY
Department of Computer Science
Assignment-3
Course:MCA Semester:I
Subject:Discrete Mathematics Subject Code:MCA104
Note:Attempt all questions
Short Questions-1,2 & 3.
Long Questions-4 & 5
Instructions:
*For short answer type questions,answer limit is 50 to 100 words.
* For long answer type questions,answer limit is 250 to 300 words.

1. Prove that the following propositions are tautology.

(a)( p →q ) ↔ ( q→ p) (b) p ∧ ( p ∧ r ) ↔ ( p ∧ q ) ∧ r

2. Identify the bound variable,free variable,and scope.

(a)∀ xP ( x , y ) (b)∀ x [ P ( x ) → ( ∃ y ) Q ( x , y ) ]

3. Verify that the proposition p ˄(q ˄ p ) is a contradiction.

4. Show that t is valid conclusion from the premises p→ q , q → r ,r → s , s∧p ˅ t . 5. Show


that R ˄ ( P ˅Q ) is a valid conclusion from the premises P ˅Q ,Q → R , P → M ,∧ M using rule of
inference.
KALINGA UNIVERSITY
Department of Computer Science
Assignment-4
Course:MCA Semester:I
Subject:Discrete Mathematics Subject Code:MCA104
Note:Attempt all questions
Short Questions-1,2 & 3.
Long Questions-4 & 5
Instructions:
*For short answer type questions,answer limit is 50 to 100 words.
* For long answer type questions,answer limit is 250 to 300 words.
1.Prove that for each element a in a group G, there is a unique element b in G such that ab= ba=e.

2. If R is a ring then prove that for all a , b ∈ R, a . (−b )=(−a ) . b=−( a . b)

3.Prove that a group of prime order (the order has only two divisors) is a cyclic group.
4.Prove that a non empty set H of a group G is a subgroup of G if and only if

(i)a ∈ H ,b ∈ H ⇒ a∗b ∈ H

(ii)a ∈ H ⇒ a−1 ∈ H where a−1 is the inverse of a in G


5.Prove that a subgroup H of a group G is normal if and only if g−1 hg ∈ H for every h ∈ H , g ∈G .
KALINGA UNIVERSITY
Department of Computer Science
Assignment-5
Course:MCA Semester:I
Subject:Discrete Mathematics Subject Code:MCA104
Note:Attempt all questions
Short Questions-1,2 & 3.
Long Questions-4 & 5
Instructions:
*For short answer type questions,answer limit is 50 to 100 words.
* For long answer type questions,answer limit is 250 to 300 words.

1. Find the first four terms of the following recurrence relation

a k =2 ak−1 +k , for all integers k ≥ 2 , a1=1

2. Show that the sequence { 2,3,4,5 , ⋯⋯ 2+n , ⋯⋯ } for n ≥ 0 satisfies the recurrence relation a k =2 ak−1−ak−2 , k ≥ 2
3. In how many ways can a party of 4 boys and 4 girls be seated at a circular table so that no two boys are adjacent?

4. Prove by mathematical induction that

2 n ( n+1 ) ( 2 n+1 )
12+22+32+∙ ∙∙ ∙∙ ∙ ∙∙ ∙∙ ∙ ∙∙ ∙∙ ∙+n = , n ≥1 .
6

5. Find the minimum number of students in a class to be sure that four out of them are born in the same month.
KALINGA UNIVERSITY
Department of Computer Science
OBJECTIVE QUESTION PAPER
PROGRAMME:MCA SEMESTER:I
COURSE NAME: DISCRETE MATHEMATICS COURSE CODE: MCA104
Sr.No Unit Question Option-A Option-B Option-C Option-D
. No.

Let A∧B be sets and let A' ∧B ' A∪B A' ∪B' A∩B A'∩B'
I denote the complements of the set
A∧B .The set
1 ( A−B ) ∪ ( B− A ) ∪ ( A ∩ B ) is equal
to
I Let A={ 1,2,3,4 } and B= { 4,8,9,10 } Many- one function Identity function One-to-one function Into function
.A function f : A → B given by
f = {( 1,4 ) , ( 2,8 ) , ( 3,9 ) , ( 4,10 ) } is a
2
3 2 1 3 2 2 1
If f ( x )=2 x ∧g ( x )= ,then fog is
I 3x 2x
2
3x
2
9x
2
6x
2

4 f ( x )= ( x +1 )3− ( x −1 )3 represents a Cubic Linear Reciprocal Quadratic


function which is
I
I If the ordered pairs ( 2 ,−2 ) ( 5,1 ) ( 2,3 ) ( 3 ,−2 )
5 ( a+ 2,4 )∧ (5,2 a+ b ) are equal,then
( a , b ) is
6 I If R be relation ‘<‘ from A = {1, 2, {(1, 3), (1, 5), (2, 3), {(3, 1), (5, 1), (3, 2), {(3, 3), (3, 5), (5, 3), { (3, 3), (3, 4), (4, 5)}
3, 4} to B = {1, 3, 5} ie, (a, b) ∈R (2, 5), (3, 5), (4, 5)} (5, 2), (5, 3), (5, 4)} (5, 5)}
iff a < b, then Ro R– 1 is
7 I R is a relation over the set of Reflexive and Reflexive and Symmetric and An equivalence
integers and it is given by (x, y) ∈ transitive symmetric transitive relation
R ⟺ | x – y| ≤ 1. Then, R is
I The range of the function f (x) = | x | (0, ∞ ) (– ∞ , 0) [0, ∞ ) None of these
8 is

I A relation from P to Q is A universal set of P × P×Q An equivalent set of A subset of P ×Q


9 Q P×Q

I If g= { ( 1,1 ) , ( 2,3 ) , ( 3,5 ) , ( 4,7 ) } is a (−1,2 ) ( 2 ,−1 ) (−1 ,−2 ) ( 1,2 )


10 function given by
g ( x )=αx+ β ,then the value of α ∧β
are
11 The greatest and least element of the S∧ϕ { a }∧ { a , b , c } { a }and ϕ None of these
poset ( P ( S ) ,⊆ ) where S= { a , b , c }
II are
II In the lattice { 1,5,25,125 } w.r.to the 1 5 25 125
12 order relation divisibility,the
complement of 1 is
II ______ and _______ are the two Join,Meet Addition, subtraction Union, intersection Multiplication,
13 binary operations defined for modulo division
lattices.
14 II The expression for Absorption law A + AB = A A + AB = B AB + AA’ = A A+B=B+A
is given by _________
II DeMorgan’s theorem states that ( AB )' =A ' + B ' ( A+ B )' = A' ∗B '
A +B = A B
' ' '
( AB )' =A ' + B
15 _________

16 II Complement of the expression ( A' + B ) ( C ' + D ) ( A+ B' ) ( C ' + D ) ( A' + B ) ( C+ D ' ) ( A+ B' ) ( C+ D ' )
' '
A B+C D is _________
II The expression for boundedness law a+ a=a a . a=a '
( a ' ) =a a+ 1=1
is given by _________
17

II Complement of the expression ( a+ b ) . ( a+c ) . ( b+c ' ) ( a ' + b ) . ( a+c ) . ( b+c ' ) ( a+ b ) . ( a+c ' ) . ( b+c ' ) ( a+ b' ) . ( a+c ) . ( b+c ' )
18 ' '
a b + ac+b c is

II Let X = {2, 3, 6, 12, 24}, and ≤ be 3 4 5 None of these


the partial order defined by X ≤ Y if
19 X divides Y. Number of edges in
the Hasse diagram of (X, ≤ ) is
II In the boolean algebra, a variable 1 2 3 4
has ________ different
20 state(s)/value(s).
III Denying the Disjunctive syllogism Modus Tollens Denying the
The name of the following consequent antecedent
argument form is... p → q, ~ p ∴ ~ q
21
III p⋁ q p →q p∗q p∧q
A conditional is symbolized like
this…
22
III (p v q)→q p v (q→p) p v (p→q) Both (b) & (c)
Which of the following propositions
is tautology?
23
III ∀ x ∀ y P(x , y ) ∀ x ∃ y P( x , y) ∃ x ∃ y P(x , y ) None of these
Negation of ∃ x ∀ yP ( x , y ) is
24
III Some students dislike Every student likes None of these
The negation of “Some students like football Every student dislikes football
football” is football

25
III ∀ x ( T ( x ) → M (x) ) ∀ x ( T ( x ) ∨ M ( x) ) ∀ x ( T ( x ) ∧ M (x) ) ∃ x ( T ( x ) → M ( x) )
If T(x):x is teacher , M(x):x is
male,then the symbolic
representation of the statement

“All teachers are male” is


26
III A variable that is not bound by Predicate Free Variables Individual Variables Bound Variables
27 quantifier
III Which of the following two are I and III I and IV II and III II and IV
equivalent?
(I)¬ ∀ x ( P ( x ) ) (II)¬∃ x ( P ( x ) )
28 (III)¬∃ x ( ¬ P ( x ) ) (IV)∃ x ( ¬ P ( x ) )
29 III p ⋁ ( ∼ p ∧q ¿ ) is equivalent to p ∨q p ∧q p q
III Identify the valid conclusion from P∧ ( R ∨ R ) P∧ ¿) R∧ ( P ∨ Q ) Q∧ ( P ∨ R )
the premises Pv Q, Q → R, P → M,
30 ˥M
IV If a binary operation ¿ is defined by 223 33 55 −55
2 2
31 a∗b=a −b +ab+ 4 ,then ( 2∗3 )∗4 is
32 IV The set of all even integers under Associative law Closure Existence of identity commutative law
multiplication is not a group,since
the following is not true.
IV A groupoid ¿ is a semi-group if for a∗b=b × a a∗a=a ( a∗b )∗c= ( b∗c )∗a ( a∗b )∗c=a∗( b∗c )
33 all a , b , c ∈G
IV If S∧T are two subgroups of a S ∪T S ∩T S−T G−S
group G,then which of the following
34 is a subgroup?
35 IV Every group of prime order is Cyclic Abelian Sub group Normal group
IV The order of the permutation 2 3 1 None of these
1 2 3
(3 1 2 ) is
36
IV If G is a group , for a ∈ G,N(a) is xa=ax xa=e ax=e xa ≠ ax
the normalizer of a , then
37 ∀ x ∈ N (a)
IV A ring R is an integral domain if R is commutative ring R is commutative R is commutative R is a ring with zero
ring with zero divisor ring with non zero divisor
38 divisor
IV E is the set of even integers under Commutative ring Integral domain Field None of these
ordinary addition and
multiplication,then E is a ring.E is
also a
39
IV In the group { 1 ,−1 , i,−i } under 0 2 4 −4
40 multiplication,order of −i is
V In the principle of mathematical induction hypothesis inductive reference induction set minimal set
induction, which of the following assumption representation
41 steps is mandatory?
V For any positive integer 5m2 + 2 3m + 1 m2 + 3 m3 + 3m
42 m -----_is divisible by 4.
V If P ( n , 4 ) : P ( n , 3 )=9 :1,the value of 9 8 24 None of these
43 n is
V What is the generating function for 2 1 1 1
generating series 1, 2, 3, 4, 5,… ? 1−3 x 1+ x ( 1−x )2 1−x 2
44
V Find the number of ways of 36 48 144 96
arranging the letters of the words
DANGER, so that no vowel
45 occupies odd place.
46 V Find the sum of all four digit 666700 666600 678860 665500
numbers that can be formed by the
digits 1, 3, 5, 7, 9 without repetition.

V Total number of words formed by 2 60 120 7200 None of these


vowels and 3 consonants taken from
4 vowels and 5 consonants is equal
to
47
V In a room there are 2 green chairs, 3 3 30 64 84
yellow chairs and 4 blue chairs. In
how many ways can Raj choose 3
chairs so that at least one yellow
48 chair is included?
V If 16Pr-1 : 15Pr-1 = 16 : 7 then find r. 10 12 7 8
49
V What will be the sequence 12, 16, 20, 24,… 1, 3, 5, 7, 9,… 0, 4, 8, 12, 16, 20,… 0, 1, 1, 3, 5, 8, 13,…
generated by the generating function
4x/(1-x)2?
50

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy