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

mca-1-sem-discrete-mathematics-rca103 (1)

The document contains examination papers for Discrete Mathematics across several semesters, detailing various topics such as Boolean algebra, recurrence relations, set theory, and mathematical induction. Each section includes a variety of questions requiring definitions, proofs, and problem-solving. The format includes multiple sections with specific instructions on how many questions to attempt and the marks allocated for each question.

Uploaded by

Komal Srivastava
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)
20 views

mca-1-sem-discrete-mathematics-rca103 (1)

The document contains examination papers for Discrete Mathematics across several semesters, detailing various topics such as Boolean algebra, recurrence relations, set theory, and mathematical induction. Each section includes a variety of questions requiring definitions, proofs, and problem-solving. The format includes multiple sections with specific instructions on how many questions to attempt and the marks allocated for each question.

Uploaded by

Komal Srivastava
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/ 10
www aktuonline.com Printed Page 1 of 2 Sub Code:RCA103 Paper Id: 214103 Roll No: MCA (SEM-1) THEORY EXAMINATION 2019-20 DISCRETE MATHEMATICS Time: 3 Hours Total Marks: 70 Note: 1. Attempt all Scotions. If require any missing data; then choose suitably. SECTION A 1. Attempt all questions in brief. Qx7=14 a. Define the Inverse function with example. b. Solve the recurrence relation: dy — Sdy—1 + 60 ©. Write down all Possible subsets of A = {2,3} and B = {a, b,c} 4. Find two incomparable elements in the poset({1 . 2, 4, 6, 8}) € State complement axiom of Boolean algebra. £ Write down the procedure for testing the validity of an Argument using Truth table. g. Define the Complete Lattice with example. SECTION B 2. Attempt any three of the following: 7x3=21 a. Ifa relation R is defined as: “R = {(a,b) € R2(a—b) <3} Then determine whether relation R is reflexive, symmetric, antisymmetric and transitive. b. Let L be the set of all factor of 30 and let ‘/* be the divisibility relation on L.Then show that (L, 7°) is a lattice. © State and Prove the De-Morgan’s Laws of Boolean Algebra, 4 Consider p+ He is intelligent , q: He is tall be two propositions. Write each of te following statement in symbolic form using p and q : i) Hei tall but not intelligent. ii) He is neither tall nor intelligent. iii) He is intelligent or he is tall. © Find the minimum number of students in a class to be sure that four out them are bor in the same month. SECTIONC 3. Attempt any one part of the following: Tx1=7 (a) Prove by mathematical induction 4n? is divisible by 3 for all 122 (b) Prove the Associative and Commutative laws for set theory. 4. Attempt any one part of the following: Tx1=7 (a) Define the “Distributive Lattice”. Prove that in a Distributive Lattice, if an clement has a complement then this complement is unique. (b) If A~£1,2,3.4.6,8.12,16.24.48} be ordered by the relation “a divides b”. Then draw the Hasse diagram. S—_ Attempt any one part of the following: 7x1 (a) Draw Karnaugh map (K-map) and simplify the following Boolean expression: F = ABC + ABC’ + ABC’ + ABC’. (b) Inthe Boolean algebra (B, +, .., 0, 1) express the Boolean function: fO.y )=(x+y)(a'+ y)(x' +y’) In its Disjunctive normal form. ap ge http://www.aktuonline.com www aktuonline.com Printed Page 2 of 2 Sub Code:RCA103 Paper Id: 214103 Roll No: 6 Attempt any one part of the following: Tx1=7 (a) Show that ~7 is a valid conclusion from the premises: p > ~q, 7 > Pp, q i) with truth table. ii) without truth table (b) State identity law and De-Morgan’s law of algebra of proposition and prove the Distributive law of algebra of proposition 7. Attempt any one part of the following: 7x1 (a) Solve the following recurrence relation: dy, — Ady + 4d,» = 0 with initial condition ay = 1 and a, = 6 (b) Find the number of possible ways in which the letters of the word COTTON can be atranged so that the two T’s do not come together. 2] Page http://www aktuontine.com AVIA A PAPER ID-311084 Printed Page: 1 of 2 Subject Code: RCA103 Roll No: Time: 3 Hours MCA (SEM. 1) THEORY EXAMINATION 2020-21 DISCRETE MATHEMATICS Total Marks: 70 Note: 1. Attempt all Sections. If require any missing data; then choose suitably. SECTION A brief. Attempt all question: 2x7=14 State the Commutative and Distributive Laws of Set theory. Define the Equivalence Relation. Define the following terms (any two) with example: i) DNF, ii) CNF, iii) Universal Gates State the Idempotent, Involution laws of Boolean Algebra. State the Modus Ponens and Hypothetical Syllogism Inference Rules. What do you mean by Bound and Free variable with example? State Generating Function. @ [>| SECTION B Attempt any three of the following: 7x3=21 a. | Show that relation “ xRy iff (x-y) is divisible by 3” is an equivalence relation on the set of integers. Let $= {x, y, 2} and P(S) be its power set. Show that (P(S), S) is a Lattice. State and Prove the Associative Laws of Boolean Algebra. IfA={1,2,3,4, 5, 6,7,8,PDetermine the truth value of each of the following statement ) (vx € +415 ii) (ax€A)x+4=10 iii) (Wx €A)x+4< 10 ‘An examination paper containing 12 questions consists of two parts, A and B, part A contains 7 questions and part B contains 5 questions. A candidate is required to attempt 8 questions, selecting at least 3 from each part. In how many ways the candidate selects the questions’ SECTION C Attempt any one part of the following: @) Txt For any set A und B, Prove that P(A MB) = P(A) n PCB). (b) | Define the function. And also explain the various types of functions. 1|Page Printed Page: 2 of 2 AVIA A Subject Code: RCAIO3 PAPER ID-311084 Rall'Nos 4 Attempt any one part of the following: Tx1=7 (@ | Define Dual Lattice. And Show that Dual of a lattice is a lattice. (b) | IfD= {1, 2, 4, 8, 16, 32, 64} be ordered by the relation “a divides b”. Then show that D is a Poset. Also draw the Hasse diagram, ‘Attempt any one part of the following: 7x1 (@)_| Draw Kamaugh map (K-map) and simplify the following Boolean expression: f(a,b, c,d) = ¥(0,2,6,8,10,12,14,15 ). (b) | Show that A@ B = ((A.B).(A.B)) and hence design a logic circuit of XOR gate using NAND onl 6. ‘Attempt any one part of the following: 7x1 (@)_| Show that: (p>) s@—>@=@ V—@ (©) | Construct the truth table: (p= q) V (q = p) = p Is the preposition: Tautology, Contradiction or Contingency? 7 ‘Attempt any one part of the following: Wx1=7 @_| Solve the following recurrence relation: 4d, ~7a,., + 10a, = 0 with initial conditions q = 0 and q =3 ©)_| Explain the difference between Permutation and Combination. And solve: Everybody in a room shakes hands with everybody else. The total number of handshakes is 66. Find how many people are there in the room? 2[Page Printed Page: 1 of 2 UAV AN A Subject Code: KCAIO4 PAPER ID-811868, Roll Ni MCA (SEM I) THEORY EXAMINATION 2021-22 DISCRETE MATHEMATICS. Time: 3 Hours Total Marks: 100 Note: 1. Attempt all Sections. All the symbols have their usual meaning. SECTION A 1. Attempt ail questions in brief. Qno. Question Marks | CO a. | What is the cardinality of the set? 2 [1 Find the cardinality of the set {1, (2.6. £4 }}. 1} b. | Let the two following functions be defined on set of real numbers be as: [2 | 1 f(x) = 2x43 and g(x) = x?+1. Find the (fog)(x). Define the well-ordered set? Give an example of well-ordered set, Draw the Hasse diagram of the lattice of (Ds, )- c. a. e Define Tautology and Contradiction. f Discuss the truth table of p oa. g. h i What is the generator of a cyclic group? Find the order of each clement in the group ({1,-1}, 0. Find the number of handshakes in party of 12 people, where each two of them shake hands with each other. n[afefels|efs) al sfae) ol ofn) {j.___ | Discuss the pigeonhole principle? 2, [5 s 2.___Attempt any three of the following: Qno. Q ‘Marks | CO a. _ | Prove that the relation (x, y) € R, if x> y defined on the set of positive | 10 | 1 integers is a partial order relation. b. [If B= {1, 3, 5, 15}, then show that (B,+, ) is @ Boolean Algebra, | 10 where a+b = lem (a, b), a.b = ged (a, b) and a’ =!5 ¢. | (@ Prove that conditional proposition and its contrapositive are|10 [3 equivalent, ie.(p > g) = ~g 4 ~p (ii) Prove the equivalence: (p> q)>q=pvq 4. | Show that set Z, = (0,1,2,3,4,5) forms a group with respect to addition [10 [4 modulo 6. & State all PEANO’s axioms. io [5 In how many ways, can 7 boys and 5 girls be seated in a row, so that no two girls may sit together? SECTION C 3.__ Attempt any one part of the following: Qno. Question: Marks | CO a. | Ina survey of 60 people, it was found that 25 eatApple, 26 eatOrange [10 | 1 and 26 eatBanana fruit. Also 9 eat both Apple and Banana, 11 eat both Orangeand Apple, and 8 cat both Orangeand Banana. Scat no fruit at all. Then determine i. the number of people who eat all three fruit. ii, _ the number of people who eat exactly two fruit. Printed Page: 2 of 2 UAV AN A Subject Code: KCALO4 PAPER ID-811868, Roll Ni MCA (SEM I) THEORY EXAMINATION 2021-22 DISCRETE MATHEMATICS. iii the number of people who eat exactly one fruit b.__| State and Prove De Morgan’s laws for set theory. i [i 4, Attempt any one part of the following: Qno. ‘Question Marks [CO a. | @Write the definition of the maximal, minimal, greatest and least |10 [2 element of a Poset. (lf S = (10, 11, 12}. Determine the power set of S. Draw the Hasse agram of Poset (P(S),C). i)Find the maximal, minimal, greatest and least element of the Poset in Part (i). b. i) Determine the DNF of Boolean expression f (x, y,z)=x+y'.z 10 2 ii) Simplify the following Boolean expression using K-Map method: A'B'C's A'B'C+ A'BC+ A'BC' AB'C+ ABC 5. Attempt any one part of the following: Qno. Question Marks | CO a. | (@) Given the value of p> q is false, determine the value of 10/3 (~pV~9) > 4 ) Prove the equivalence: (p—>q)>4= pvq b.__| State and Prove De Morgan’s laws for propositions using wuth ble. [10 [3 6. __Attempt any one part of the following: Qno. ‘Question Marks | CO a. | Show that set of all integers Zforms @ group with respect to binary | 10/4 operation * defined as a*b=a+b+l.whereabe Z B. | (Define Ring and Field. Give an example of a Ring and a Field 10 [4 GiProve that every eyelie group is abelian. 7.___Attempt any one part of the following: Qno. ‘Question Marks [CO a. | State Mathematical Induction. Using the Mathematical Induction, show | 10 [5 that? +2243? 4.4 meee D ya b. | Use generating fimetions to solve the recurrence relation, 10 [5 a, —9a,,;+204,-» =0 where a, =—3 and a =—10. Printed Pages:02 Sub Code: KCA104 Paper Id: | 233508 Roll No. { MCA (SEM. I) THEORY EXAMINATION 2022-23 DISCRETE MATHEMATICS Time: 3 Hours Total Marks: 100 Note: Attempt all Sections. If require any missing data; then choose suitably. (a) (b) (e) @ © (fp) (g) (hy a) 0 (b) ©) @ © (@) (b) SECTION A Attempt all questions in brief. 2x 10=20 State the Distributive and Associative laws of set theory. Write down the properties of Equivalence Relation. Define the Hasse diagram with example. ‘What do you mean by Normal Form in Boolean algebra? Define the term Proposition. Negate the statement “He is poor and laborious” Define Monoid with example. Define the Commutative Ring with unity. Solve the recurrence relation:ay ~ 3 ans #°2a-2 Write down the properties of Generating function. SECTION B Attempt any three of the following: 10x3=30 IX = (1,2,3},¥ = {p,q} and Z = (a,b) and the functions(Pand g are define as bf 2X be f= {(.p),2P). Ga}, 9 +¥ +2 be g= {(p,q),(q,b)} then find fogrand gof. Let L be the set ofall factor of 12 and let ‘/” be the divisibility relation on L. Then show that (L, ‘/’) is a lattice, Show that: (p> q) A (q 1) — (p © ry $8 Tautology. What do mean by Order of an element ina group? Find the order of each element of the multiplicative group g= {1,-L,i-i} Solve the recurrence ns2 — 4ans4>4/4@q = 2" SECTION C Attempt any one part of the following: 10x1=10 Define the function and explain the difference between function and relation with example For any set A and B, Prove that P(A 1B) = P(A) n P(B). (a) (b) @) (b) (a) (b) @) (b) Attempt any one part of the following: 10x1 Define Modular Lattice. Also Prove that: Every Distributive lattice is Modular. Solve using K-map:F (A,B, C,D) = ¥(0,1,2,3,4,5,6,7,8,9,11 ) Attempt any one part of the following: 10x1=10 Show that s is a valid conclusion from the premises: pq por, ~(@Ar) andsvp. If K(x) + xis student, M(x):x is clever, N(x) + x is successful Express the following using quantifiers: @ There exists a student ai Some students are clever ii) Some students are not successful. Attempt any one part of the following: 10x1 Define the permutation group. If A= {1, 2, 3, 4,5} then find: (1 3)0(245)0(23). Show that G= {0,1,2,3,4} is a eyclic group‘inder addition modulo 5, Attempt any one part of the followinig: 10x1=10 Determine the numeric function corresponding to the following Genersting function: A@) = Gana Prove by mathematical induction that n® + 2n_is divisible b)\3 for each positive integer m, Printed Page: 1 of 2 Subject Code: KCA104 PAPER ID-311200 Roll No: MCA (SEM I) THEORY EXAMINATION 2023-24 DISCRETE MATHEMATICS ‘TIME: 3HRS M.MARKS: 100 Note: 1 1. Attempt all Sections. Ifrequire any missing data; then choose suitably. SECTION A Attempt all questions in brief. Qno. Question. Marks Define the Cartesian Product of sets with example, If set Ahas n elements , how many relations are there fromA to A? Draw the Hasse diagram of (Da, /)- Boolean function in Sum of minterms: FQyz)=x+y'z Express the follo Prove the following Equivalences by using Truth table: @ > @>q=pvq Define Bound and Free variables with example. Define Order of an clement of a Group with example ‘What do you mean by Even and Odd Permutation? State the Mathematical Induction Law. Find the minimum number of students in a class So)\hat three of them are born in the same month, ‘SECTION Attempt any three of the following: Define the composition of -filietion. If f(z) =a? —1and 9) = (3x +1), find: i) gof, it) fog, iii) gog, iv)fof 0 IFA = (4, b,c), show that(P (A); ) isa Poset and draw iis Hasse diagram 10 Rewrite the following argument using quantifiers, variables and predicate symbols. Prove the validity of the argument: “If it rains then it willbe Cold. If it is cold then I shall stay at home. Since it rainstherefore, I shall stay-home”. 10 Define the Subgroup. Prove that the additive group of eyen-integers is a subgroup of the additive group of all integers. Prove that:8"- 3” is a multipleof Stor all n=Iby mathematial induction. SECTION C Attempt any one part of the following: In a group of 850 person, 600 can speaks Hinidi and 340 can speak Tamil. Find si) How many ean speak both Hindi and-Tamit? ii) How many can speak Hindi only? iii) How many can speak Tamil only? 10 If R be the relation “on set A=(a,b,c,d) andR= {(@, b), (b,c), (d.c), (d,a), (a, d); (d.d)}. Determine: i) Reflexive closure of R, ii) Symmetric closure of R, iii) Transitive closure of R 10 Attempt any one part of the following: Express the Boolean expression: (x,y,z) = @'y)'(@ + 2) in both disjunctive and conjunctive normal forms. Use Kamaugh map representation to find minimal sum of products expression for the following Boolean function: F(A,B,C,) = ¥(0.2,3.4,7) ‘Attempt any one part of the following: 1|Page Printed Page: 2 of 2 Subject Code: KCA104 PAPER ID-311200 Roll No: MCA (SEM I) THEORY EXAMINATION 2023-24 DISCRETE MATHEMATICS ‘TIME: 3HRS M.MARKS: 100 a.__| Prove the following Equivalencep > @ Vr) => @V@> 7) [10 b. | Obtain the disjunctive normal form(DNF) of the following logical | 10 expression:p > ((p > q) A~ (~q V~p). 6. Attempt any one part of the following: a. | Ifthe Inverse of an clement “a” ina group is“a~" , then the Inverse 10 ais aie@*)' =a. ’. | Show that the set of fourth roots of unity forms an abelian group with respect to | 10 multiplication. 7. Attempt any one part of the following: a. | Solve the following Recurrence Relation: 10 a, ~ 7,4 + 10d, = 0 with initial conditions ay = 0.and a, = 3 b. | What do mean by Generating function. Find the Generating function of the | 10 following series:1,1,1,1,1,1,1. 2[Page

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