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

MCS-013 (2022-23) Solved Assignment

Uploaded by

Tanishq Maher
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
116 views

MCS-013 (2022-23) Solved Assignment

Uploaded by

Tanishq Maher
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 26
MCS-013 Solved Assignment 2022-2023 [Course Code IMCS-013 [Course Title Discrete Mathematies [Assignment Number BCA (2)/013/Assignment/2022-23 Maximum Marks 1100 [sist October, 2022 (for July Session) Last Date of Submis SELNEE OSE OnE histh April, 2023 (for January Session) Note: There are eight questions in this assignment, which carries 80 marks. Rest 20 marks are for viva-voce. Answer all the questions. You may use illustrations and diagrams to enhance the explanations. Please go through the guidelines regarding assignments given in the Programme Guide for the format of presentation. Qt. (a) State and explain De Morgan's laws for Boolean algebra. Solution : De Morgan’s law: ‘The complement of the union of two sets is equal to the intersection of their complements and the complement of the intersection of two sets is equal to the union of their complements. These are called De Morgan’s laws. For any two finite sets A and B; () (AU B)' = A'NB' (which is a De Morgan's law of union). Gi) (A) B)' = A’ UB’ (which is a De Morgan's law of intersection). Where, 1 denotes ‘intersection’ U denotes ‘union’ * denotes ‘compliment’. Qt. (b) Make truth table for followings. i) po(-rvg) A(-par) ii)p>(-ra~q)v(pa~r) Solution )porvg ACpar) > q * op Gpan Sg EES ees tTi[r[tl[eF T T z tT{[rfr|r F F F tilel[r{[r T F F trilrei[rle F F F rF[rf[?l] T iP ? rF[rf[ri tr T T T a ee ee T F T rflri[r Tr tr T if +: p}a|r | -a| -r -ra-a}@a~n Behe ese T T T F F F F F F T T Fe F ate F T T rt T F T y F F F F FE T F F nN T T T T T F T T F F F F F Lf F T FE F t F F ? ¥: F T T F F F F T F B F T T T F T Q1. (e) Give geometrie representation for followings: i) {5,5} x {- 2-2} ii), 5} « {-2, - 3} Qi. (€) Give geometric representation for followings ii) (4, 5} x { Solution DL yx {= iia, 5) x 2), (1, - 3), (5, - 2), (5. - 3)} ii) {1, 5} x {- 2, - gh = (Gy, - 2), 0, - 3), 65, - 2), 3)} Q2. (a) Draw Venn di )(ANBNC)N (AUBNC) ii) (AU BN C)UCBNC) gram to represent followings: Solution (AN BNE) N(AUBNE) Q2. (a) Draw Venn diagram to represent followings i) (AN BNC) N(AUBNC) ii) (AU BNC) U (BNC) Solution : (AN BNC) N(AU BNC) ii) (AU BN C)u (BNC) Q2. (b) Write down suitable mathematical statement that can be represented by the following symbolic properties. )@xNGy(vaP ii) v(@) Gy) (@2Q Solution : (i) Mathematical statement of the above symbolic properties is “Some element of x, and y and all the elements of z belongs to the function P” (ii) ¥ (@) (By) G 2) Q: This is printing mistake on the question. The correct question might be like the following: (v2) Gy) @2Q So, the mathematical statement of the above symbolic properties is “All the elementf of x and some element of y and z belongs to the function Q” Q2. (¢) Show whether v5 is rational or irrational. Solution : Let us assume that V5 is a rational number. So it can be expressed in the form p/q where p,q are co-prime integers and q #0 p =v5=2 q On squaring both the sides we get, ro So, 5 divides p pis a multiple of 5 5m. (say) 2m? + (ii) From the equation (i) and (ii), we get 5q? = 25m? =P =5m? => y? is a mmutiple of 5 ive., q is a multiple of 5 Hence, p, q have a common factor 5, This contradicts our assumption that they are co-primes, Therefore, is not a rational number. Hence, Vs is an irrational number. Q3. (a) Explain inclusion-exclusion principle with example. Solution : Q3. (a) Explain inclusion-exclusion principle with example. Solution Let A, B be any two finite sets. Then n(A UB) = n(A) + n(B) ~ n(A.0 B) Here “include” n(A) and n(B) and we "exclude" n(A B) Example : Ina town of 10000 families it was found that 40% of families buy newspaper A, 20% family buy newspaper B, 10% family buy newspaper C, 5% family buy newspaper A and B, 3% family buy newspaper B and C and 4% family buy newspaper A and C. If 2% family buy all the newspaper. Find the number of families which buy (a) Number of families which buy all three newspapers. (b) Number of families which buy newspaper A only, Solution ; A B 40% 20% © 10% (a) Number of families which buy all three newspapers: n(AUBUC n(A) + n(B) + n(C) = nA NB) = R(AN C) = (BNC) + (AN BNC) n(AU BUC) =40+20+10~5-3-4+2= 60% (b) Number of families which buy newspaper A only = (40-7) = 39 Q3. (b) Make logic cireuit for the following Boolean expressions: i) (yz) + (yay + (z'y) t for the following Boolean expressior Q3. (b) Make logie ci i) (o’y'2’) + (aya)! + (x2'y) ii) (x°yz’) xyz’) (w’y'2) Solution i) @ty'2') + @'yz)' + Qxz'y) $ | Pox \ ixye) ceva N toyay \ \ } : (Ye) + Ory2)'+ yz) % z {ove fi) Cx'yz') Gryz') Gr \ exye) oxye) (xyz) Q3. (e) What is a tautology? If P and Q are statements, show whether the statement (P — Q) v(Q P)is a tautologyor not Q3. (e) What isa tautology? If P and Q are statements, show whether the statement (PQ) v(Q— P)is a tautologyor not Solution ‘Tautology: A tautology isa compound statement in Math whieh always resultsin Truth value, It doesn't matter what the individual part consists of, the result in tautology is always true. Cheek whether the statement isa tautology or not Now am going to find the result of the given statement ice Pp | @ |] -r | -e@ | Pe | Q-P @—OvVQ-P) 1 | T F F T T t 7 | F ¥ T F t FT T F r F T F F T T T T . Sinee all the outpu are True (1), Hence, it isa tautology, Q4. (a) How many words can be formed using letter of PEPSUDENT using each letter at most once? i) Teach letter must be used, ii) If some or all the letters may be omitted, Solution total number ofletter (i) In the word “PE among which appears 2 timesand other than ‘P' and 'E’ all letters appearing. 1 time each appears 2 tim So the number of distinct letters = (9 ~ 2) =7(P, E, §, U,D,N, 1) ‘The number of word: by= can be formed usingall the distinct letters of the word "PEPSUDENT is given 7*6x5x4x3x2x 5040 (Answer) (ii) 1f some or all the letters may be omitted then it can be denote as “Sum P(7, n)” where n = ere So, the required number of words, (7, 0) + P(7, 1) + PC7, 2) + P(7, 3) + P74) + PCZ, 5) + PI7, 6) + PC. 7) +7 +42-+ 210 + 840 +2520 + 5040 + 5040 = 13700 (Answer) Qa. (b) Show that: 4 Pand(~Qv P) are equivalent Q4. (b) Show that: Q => Pand (~Q v P) are equivalent. Solution : We can easily prove that Q— P= ~QvP using Truth table. Truth table of Q—>P: Q P Q-P T T T T e F F T T F F T Truth table of ~QvP: Q P ~Q ~QVE T T F ¥ T F F F F T = = F F T T It is clear from the above truth tables, the final outcomes are same. Hence, Q—> P= ~Qv P (Proved) Q4. (c) Prove that 2” > n3, yn210 Solution : Q4,. (€) Prove that 2” > n3, vn 210 Solution : Step 1: Let, P (n) : 2” > n3 For n=10, 210 =1024 > 103 ‘Therefore, P (10) is true. Step 2: We assume that P (k) is true for an arbitrary k = 10. Thus, 2* > k3 Step 3: Now, we want to prove that 2**! > (k + 1)3 Hl > (e+ 1) ‘Thus, P (k + 1) is true whenever P (k)is true for k 210. ‘Therefore by the principle of mathematical induction, P (n) is true Vn = 10, (Proved) Q4. (€) Explain principal of duality with the help of example. Solution : Qa. (d) Explain principal of duality with the help of example, Solution : Principal of Duality : ‘This principle states that the dual of the Boolean function is obtained by interchanging the logical AND operator with logical OR operator and zeros with ones. For every Boolean function, there will be a corresponding Dual function, Example: Boolean Expressions and Their Corresponding Duals Given Expression o-1 A(A+B) =A A+AB=A o1=0 1+0=1 | AB=A+B | AtB=AB Ao=o [(A+©) (A+B) = AB + ACTAC + AB = (A+B). (A+O)] AB = (A+B)(A+B), ‘AB Se (A+B).(A+B), (A+B) ((A+B)).ACASB) = 4 AAsO A(B.C)=(A.B).C | Ae(B+C)= (A+B) + € | Q5. (a) How many different professionals committees of 10 people can be formed, each containing at least 2 Professors, at least 3 Managers and 3 ICT Experts from list of 10 Professors, 6 Managers and 8 ICT Experts? Qs. (a) How many different professionals committees of 10 people can be formed, each containing | least 2 Professors, at least 3 Managers and 3 ICT Experts from list of 10 Professors, 6 Managers and ICT Experts? Solution : Given, Total number of Professors = 10 ‘Total number of Managers = 6 Total number of ICT expert = 8 ‘The number of professional in a committee = 10 So, the number of different committees of 10 professionals can be formed if each committee contain at least 2 Professor, at least 3 Managers and at least 3 ICT expert is given by - Different Possibilities Combination Result 2 Professors, 3 Managers, 5 ICT Experts 1060 9C x POS 50400 2 Professors, 4 Managers, 4 ICT Experts 0 250 200, 47250 2 Professors, 5 Managers, 3 [CT Experts EMEC NEC, 15120 3 Profe: Managers, 4 ICT Expei PORxEC,xPC, 168000 3 Professors, 4 Managers, 3 ICT Experts 20C,x®C,x8Cy 100800 4 Professors, 3 Managers, 3 ICT Experts PSC nC, xAG, 235200 Total 616770 Hence, the number of different committees can be formed is 616770. (Answer) Qs. (b) A and B are mutually exclusive events such that P(A) = 1/4 and P(B) = 2/5 and P (AU B) = 1/2. What is the probability of P (A B). Qs. (b) Aand B are mutually exchusive events such that P(A) = 1/4 and P(B) = 1/2. What is the probability of P(A B). 5 and P(AU B) = Solution : Since, A and B are mutually exclusive events. +P (ANB) = 0 (Answer) Note: ‘This question has some printing mistake. [Reason : As A and B are two mutually exclusive events, then it must be P(AUB) = P(A) +P(B) But, as per the data given in the que: jon, 1/2 #1/4 + 2/5. Qs. (e) Explain addition theorem in probability, Solution : Addi on theorem on probability: If A and B are any two events then the probability of happening of at least one of the events is definc as P(AUB) = P(A) + P(B)- P(AYB). Proof Since events are nothing but sets, From set theory, we have n(AU B)=n(A) +n(B)—n(ANB) Dividing the above equation by n (S), (where $ is the sample space) n(AUB) _ n(A) ni n(B)_ n(ANB) n(S) a(S) Q5. (c) Explain addition theorem in probability. Solution : Addition theorem on probability: If A and B are any two events then the probability of happening of at least one of the events is define as P(AUB) = P(A) + P(B)- P(ANB). Proof: Since events are nothing but sets, From set theory, we have n(AUB) =n(A) +n(B)—n(ANB). Dividing the above equation by n (S), (where $ is the sample space) ‘Then by the definition of probability, P(AUB) = P(A) + P(B)— P(ANB). Q6. (a) How many way i) At least two empty box. ii) No empty box. are there to distribute 15 district item into g distinct boxes with: Solution : Q6. (a) How many ways are there to distribute 15 district item into 5 distinct boxes with: §) At least two empty box. ii) No empty box. Solution : Given, no, of distinet objects (1) = 15 Number of distinet boxes = 5 Let, U be the possible distributions of 15 distinct objects into 5 distinct boxes, Also let, Aj denote the set of possible distributions with the i" box being empty. Gi) Thus the number of distributions with at least two empty boxes is | Ay U Ag UA, U As | We have, 5” where r= Also, | Aj| = (5 - 2)" remaining 4 boxes 5, the number of distributions in whieh the objects are put into one of the Similarly, |.Aj 9 Aj and so forth, |4,U4,UA,U45 | ~ 83 +84 - 85 x 315 5C, x 215 + 5C, x 115-50, x OF = 143161395 (Answer) Gi) The number of "no empty boxes" is given by — |Ain dan Asn Aa nds 15-50, x 45 +50, x 315 - 50, x 215 + 50, x 15-50, x 015 = 25202030400 (Answer) Q6. (b) Explain principle of multiplication with an example, Q6. (b) Explain principle of multiplication with an example, Solution If A and B aretwo independent events in a probability experiment, then the probability that both events occur simultaneously is P(A and B)=P(A)-P(B) In case of dependent events , the probability that both events occur simultaneously is: P(A and B)=P(A)-P(B | A) (The notation P(B | A} means “the probability of B, given that A has occur “ample : @. You have a cowboy hat, a top hat, and an Indonesian hat called a songkok, You also have four shirts: white, black, green, and pink. If you choose one hat and one shirt at random, what is the probability that you choose the songkok and the black shirt? Solution: The two events are independent events; the choice of hat has no effect on the choice of shirt. ‘There are three diferent hats, so the probability of choosing the songkokis +. There are four differen shirts, so the probability of choosing the black shirt is So, by the Multiplication Rule: P(songok and black shirt Q6. (e) Three Sets A, Band Care: A= (1 1g): Find AUBNC;A0 BUC; 2,8, 9,12, 15.17}, B= (1 BuCand (AN ~C), 4,10} and C= {7,9, Solution : AUBNC 8,9, 12 5,17} UL, 34,10 }947,9,10, = (1, 2,3, 4, 8, 9, 10, 12, 15, 17} 047, 9, 10, 11 3) {9,10} s AUBMC = {9, 10} (Answer) @ ingscience.co.in al enoeal (Q6. (e) Three Sets A, Band Care: A= (1,2, 8,9, 12,15,7h B 4,10) and C={7, 9,10, 13}. Find AUB C;AN ~BUC;ANBu Cand(An ~0), Solution AUBNe 41,2, 89,19, 15,17} U1, 2,34, 20 F747, 910,115 19} 1,2, $e 4-8-9, 10,2, 15,17} (7,9, 10,48, 19) {9,10} AU BN C=(0,10) (Answer) An~Buc A n(or@uo) = (1,2,8,0,12,15,19 10 £1,2,3,4 10) (7,9, 10,1113) 41, 2,8, 9,29, 15,173 10 10,11, 133) (8,12, 15,17) (Answer) Anguc 41,2, 8, 9,12, 15, 1711, 2.3,4,10 70 (7, 9,10, 18,13) 41,2) U47,9,10,14, 13) {1,2,7,9,10,1,13) (Answer) an-o (AN Goro) 1,2, 8, 0,12, 15,179 9 (Nor (7,9, 10,41, 19)) 41,2,8,12, 15,17} (Answer) Q7- (a) Find how many digit numbers are even? Q7. (a) Find how many g digit numbers are even? Solution : ‘The 3-digits even numbers are : 100, 102, 104, «4 998 ‘The above sequence of numbers isan A.P. whose 1st term (a) difference (d) = (102 - 100) = 2. 100, last term (1) = 998 and common Now, we need to find the number of terms (n), By the formula of number of terms (n) in an A.P. is given by - PAs ri 998 = 100 1=450 n = 450 The number of 3 digit even numbers is 450. (Answer) Q7.b) A coin is tossed times. What is the probability of getting exactly p tails? Solution : ‘The repeated tossing of the eoin is an example of a Bernoulli trial. According to the problem: ‘Number of trials =n Probability of tail: a = 1/2 and hence the probability of head, b =1/2 For exactly p tails: P ‘Therefore, probability of getting exactly p tails, hye? Pl =p)= “(0 -c qy" Los (3) (Answer) Q7. (©) What is a function? Explain following types of functions with example. Q7. (e) What isa function? Explain following types of functions with example i) Surgective ii) Injective i) Bijective Solution Function: A function is a rdation between a set of inputs and a set of permissible outputs with the Property that each input is related to exactly o output, Let A & B beany two non-empty sets mapping from A to B will be: in set B, fanetion only wt 1 every element in set A hasone end, ‘Surjective Function : Ifthe function f': A-+B is such that each clement in B (codomain) isthe SF image of at least one element in A, then we say that fisa function of A ‘onto’ BThus ft AB is ‘surjective if, forall b€ B, there are some a € A such that fla) =. Example: The function flx) = 2x from the set of natural numbers N tothe set of non negative & numbers isa surjective fanctio Gi) Injeetive Funetion : A function mapping if different elements of A have differ whenever fix) = fly). u. to be a one - one function or injective t Fimages in B. A function fis injective if and only if Example: fx) = x +9 from the set of real number R to R is an injective function, When x= 3,then_ (x) = 12,when fy) = 8,the value of y can only be 3, so x= y. Gii) Bijective Function ; A function f (from set A to B) is bijective if, for every yin B, thereis ‘exactly one xin A such that fix) = y. Aternatively, fis bijective if itis a one - to- one correspondence between those set ds, both injective and surjective. Example: If f(x) = from the set of positive real numbers to positive real numbers is both injective and surjective. Thus, it isa bijective function Qr-(@) Write th (a) Shyam is rich but unhappy (b) Either do physical exercise or be ready for poor health Solution (a) Shyam is rich but unhappy: Uf paShyamisrieh, ‘q:Shyamis unhappy Then, the symbolically we can epresnt ‘Shyam is rick but unhappy’ as pq (b) Either do physical exercise or be ready for poor health Hf ps physical exercise (qzpoor health, Then, the symbolically we health as py 4. Q7. (@) Write the following statements in symbolie form: (a) Shyam is rich but unhappy (b) Either do physical exercise or be ready for poor health Solution: (a) Shyam h but unhappy: Ie p hyam is rieth. q: Shyam is unhappy. Then, the symbolically we can represnt ‘Shyam is rich but unhappy’ as p A 4 (b) Either do physical exercise or be ready for poor health If p + physical exercise q+ poor health ‘Then, the symbolically we can represnt ‘Hither do physical exercise or be ready for poor health as pv q. QB. (a) Find inverse of the following function: f (2) = "9 p45 What is a relation? Explain equivalence relation with the help of an example. Solution: Finding inverse : +9 f(a)= =a? +95 ay—5y by —9 (=! y? = 20y — 36 4 dig Q8. (a) Find inverse of the following function: f(x) =~", a £5 2-5 Whats a relation? Explain equivalence relation with the help of an example, Solution; Finding inverse 20y — 36 Wy — 36 Now, on replacing y into x, wehave xt Vi J a > 20x — 36 ct Ve — Wr — 3 Hence, the required inverse of the given function is 5 (Answer) Relation ; Relation : Relations in maths is a subset of the cartesian product of two sets. Suppose there are two sets given by X and Y. Let x € X (xis an element of set X) and y € Y. Then the cartesian product of X and Y, represented as X x Y, is given by the collection of all possible ordered pairs (x, y). In other words, ¢ relation says that every input will produce one or more outputs. Equivalence Relation: Arelation R on a set A is called an equivalence relation ifit satisfies following three properties: 1. Relation R is Reflexive, i.e. aRa V ae 2. Relation R is Symmetric, ie., aRb = bRa , aRb and bRe > 3. Relation R is transitive, i. Example: Let A = {1, 2, 3, 4} and R = {(1,1), (4, 3), (2, 2), (2, 4), (3, D, (3, 3), (4, 2), 4, 4)}- Show that R is an Equivalence Relation. Check the equivalency of the given relation: Reflexive: Relation R is reflexive as (1, 1), (2, 2), (3, 3) and (4, 4) € R. Symmetric: Relation R is symmetric because whenever (a, b) € R, (b, a) also belongs to R. Example: (2, 4) € R= (4,2) €R. Transitive: Relation R is transitive because whenever (a, b) and (b, ¢) belongs to R, (a, ¢) also belongs to R. Example: (3, 1) € Rand (1,3) €R= (3,3) €R. So, as R is reflexive, symmetric and transitive, hence, R is an Equivalence Relation. Q8. (b) Find dual of Boolean Expression for the output of the following logic circuit. Q8. (b) Find dual of Boolean Expression for the output of the following logic eiveuit 5 y —o Solution A ) (aay . Y= (AByBC’ —o = From the above logic circuit, we have ‘The final output = (A BY' BC! Using duality principal of Boolean algebra, we have the dual of the above boolean logic expression (AB)' BC! = B(A'+B) CC! [Since, (AB)'= A’ + B'] (Answer) QB. (€) Explain Logical Connectives and Logical Quantifiers with the help of examples, Solution; ‘The main logical connectives are eonjunetion, disjunction, negation, conditional and biconditional. Quantifiers are another type of phrase or a special word used in mathematical statements. The quantifier phrases used in this case are for all, for every, fore Symbolically this quantifier is expressed as ¥ rach, for any ete, Example of logical connective ‘negation’ : If p: Itis raini \g outside, ‘Then, Negation of p is given by - ~p:ltis not raining outside Example of ‘quantifier’: Solution: a —— (apy -— ey From the above logic circuit, we have Y = (AByBC’ The final output = (A B)' BC Using duality principal of Boolean algebra, we have the dual of the above boolean logic expression (AB)'BC'=B(A'+B')C' [Since, (AB)' = A' + B'] (Answer) Q8. (c) Explain Logical Connectives and Logical Quantifiers with the help of examples. Solution: The main logical connectives are conjunction, disjunction, negation, conditional and biconditional. Quantifiers are another type of phrase or a special word used in mathematical statements. The quantifier phrases used in this case are for all, for every, for each, for any ete. Symbolically this quantifier is expressed as ¥ Example of logical connective 'negation' : If p: It is raining outside. Then, Negation of p is given by - ~ p :Itis notraining outside. Example of ‘quantifier’ The statement “there exists an even prime other than 2” is a false statement that uses an existential quantifier. This can be written as 3x € N, x isa prime and x is even.

You might also like