- Function Tutorial
- Binder Chapter 2
- Mcq ppl
- Countabiliy of Infinite Countables and Applications to Quantitative Finance
- Math Sym n Names
- Classes Do Not Have AP - Basim Samir - Egypt
- MFCS
- HISTORYOFMATHTable-1.docx
- Mfcs
- AGKZ_Corr
- An Overview on Intuitionistic Fuzzy Sets
- Symbolic Logic - VENN.pdf
- Mfcs Notes
- BetweennessRCC8 Supplement
- Speculations VI Fernando Zalamea
- Salesman
- Advanced Inequations Exercise
- Intervensi Mathematics SPM Keynotes
- Arrangement Set Dynamics Could Design People Politics
- 0606_s16_qp_22
- Advanced Inequations Exercise - 2(a)
- Http://Www.complore.com/Test4PDF.php?Id=362
- Power Aggregation Operators of Simplified Neutrosophic Sets and Their Use in Multi-attribute Group Decision Making
- Factorising Solutions 2
- Chapter_4_L2.pdf
- MODULE 2_Laplace Transform
- Santambrogio. Meinongian Theories of Generality (Article)
- int13 alc proposal
- PCR5 and Neutrosophic Probability in Target Identification
- 0606_m16_ms_12
- MFCS_imp
- sql
- Readme
- Mfcs
- So a Syllabus
- Tutorial
- OR_WORD
- Introduction to the Advanced Encryption Standard
- oaf_import_cript
- IT Work Shop Manual
- dependentpicklist
- Dependent LOV in OAF
- Dependent LOV in OAF
- XMLP Concurrent Program with bursting
- AIM
- gl concepts
- Decode and Case

:

FACULTY: S. JAGADESH BABU

1) (a) Determine the truth value of each of the following statements i. 6 + 2 = 7 and 4 + 4 = 8. ii. four is even. iii. 4 + 3 = 7 and 6 + 2 = 8. (b) Write each of the following statements in symbolic form i. Anil & Sunil are rich. ii. Neither Ramu nor Raju is poor. iii. It is not true that Ravi & Raju are both rich. (c) Write a short note on normal forms 2) (a) Prove that (P ΛQ)V R ↔ ((¬P V ¬Q)Λ¬R) is a contradiction. (b) Obtain PDNF and PCNF of the following formula (¬PV¬Q) → (P ↔ ¬Q) 3) (a) S h o w the following implication without constructing t h e truth table. i. (P → Q) → Q ⇒ (PVQ) ii. P → Q ⇒ P → (PΛQ) (b) Show that the proposition PΛ¬Q and (PVQ) Λ (¬P) Λ (¬Q) are contradiction 4) (a) If P is true, Q is false and R is true, then find the truth value of ((P ΛQ) →R)V (P V R) without constructing t h e truth table. (b) Find the disjunctive normal form of P V (¬P → (QV (Q → ¬R))). ( c) Show that the following statements is a tautology. ((PVQ) Λ (P → R) Λ (Q → R)) → R UNIT 2: 1)(a) Show that RΛ (PVQ) is a valid conclusion from premises PVQ,Q → R, P→M and ¬M (b) Explain the use of predicates with suitable examples 2). (a) S h o w that (∀x) (P (x) → Q (x)) Λ (∀x) (Q (x) → R (x)) (∃x) (P (x) → R (x)) Using rules of inference. (b) Show that (∃x) M(x) follows logically from the premises ∀x (H (x) → M (x)) &(∃x)H (x) 3) (a) Prove or disprove the validity of the following arguments. No mathematicians are ignorant. All ignorant people are haughty. Hence, some haughty people are not mathematicians. (b) Prove the following logical ∀x [p (x) ΛQ (x)] ⇔ ∀x, (p (x) Λ ∧ x, Q (x) 4) (a) Show that ∀x(P (x)ΛQ(x)) ⇔ ∀x(P (x)Λ∃xQ(x)) (b) Negate each of the following expressions i. ¬ (x) (y) R (x, y) ii. ¬ (x) ∃ (y) R (x, y) iii. ¬ (∃x∃y¬R (x, y) Λ∀x∀yP (x, y (c) Explain the term quantifier.

f(x+3) (b) Prove that A − (B ∩ C) = (A − B) ∪ (A − C) (c) Define equivalence relation 3. Then prove that the relation a ≤ b defined by either aΛb= a (or) aVb = b is a partial ordering relation on L.(a) Let L be a Lattice. 2. f 3 . Find f 2 . B. f(x2) ii. State whether these functions are injective.(a) Suppose R is an anti-Symmetric relation of a set A.2. Such that f = Ix and is One-to-one. surjective or bijective. where f(x) = x2 -2. A×B ii.4}. 3}. Define a function f: x → x. f −1 . f of −1 4. (b) Let f: R → R & g: R → R. Prove that f is not One-to-one. but onto (b) If A.y) = 4x = 5y. (a) A function f(Z×Z) → Z is defined by f(x. B×A 2. Find i. Show that (A × C) ⊆ (B × C) (c) If A = {1. g(x) = x+4. (b) Let X = {1. (a) Let f(x): x2-3x+2. Where R is a set of real numbers find fog and gof. R−1 is anti-symmetric. for any relation on A. Find i. C are three sets such that A ⊆ B. Show that R ∩ S.3. . 5}. B = {4.UNIT 3 1.

ii. Abelian Group iii. ii. then prove that the kernel of ‘f’ is a normal subgroup 3. Give the properties that e x i s t s on the binary operation * from the composite table. * a b c d e a a b c b d b b c a e b c c a b b a d e b d e c b a e d d e (b) Let A be a non empty set and * be a binary operation on P(A). Group ii. (b) Define the following terms: i. such that (a) a2 = e (b) a3 = e (c) (a+b)2 ≠ a2 *b2 4. Semi Group iv.c. Compute (a*b)*c and (((a*c)*e) * a). (a) Let the binary operation * defined on S = {a. Sub Group 2.b. Find the identity element with respect to * in P(A). In a symmetric group S3 find those elements of a and b.d} by means of the following composite table i. +> and K = <Z2 . *) and (H. UNIT 5 . (a) I f G = <Z6 . Show that A is the only invertible element of P(A). Prove that G and HxK is isomorphic. +).UNIT 4: 1. H = <Z3 . . where P(A) be the power set of A defined by A*B = A ∩ B for A. If (G. B ∈ ρ (A) i. +>. ∆) are two groups and f: G→H is homorphism.

two of whom are married to each other are to be assigned six desks that a r e lined up in a row. and 3 rooms for 3 students each. what is the probability t h a t t h e married couple will have non-adjacent desks? 3. (a) Find the generating function of (n-1)2.3. u1 =1. Six new employees. Suppose that Florida State University has a residence hall that has 5 single rooms. (b) Find the coefficient of x4y7 in the expansion of (x-y)11. Solve the recurrence relation an − 9an−1 + 26an−2 − 24an−3 = 0 for n ≥ 3. how many distinguishable ways can the flags be displayed? UNIT 6: 1. (a) Solve the recurrence relation un+2 -2un+1 +un =3n+5 if u0 =0.(2) n using generating function. Solve the recurrence relation an − an−1 + 10an−2 = 0 for n ≥ 2.1. If the assignment of employees to desks is made randomly.4+. (a) Use the binomial identities to evaluate the sum 1. 4 . (a) Find the number of positive integers less than are equal to 2076 and divisible by 3 or 4.2.+(n-2)(n-1)n (b) A store has 25 flags to hang along the front of the store to celebrate a special occasion. and 6 blue flags. 5 double rooms.3+2. (b) Solve the recurrence relation using generating function an − 6an−1 = 0 for n ≥ 1 and a0 = 1 2. a0 =0 4. 4 yellow flags. a0 =1 3. In how many ways can 24 students be assigned to the 13 rooms? 2. If there are 10 red flags. (b) Solve the difference equation un-2un−1=5. . 5 white flags.

- Function TutorialUploaded bymkris07
- Binder Chapter 2Uploaded bybelleelle
- Mcq pplUploaded byTapas Badal
- Countabiliy of Infinite Countables and Applications to Quantitative FinanceUploaded byIJSRP ORG
- Math Sym n NamesUploaded byarunaradhi
- Classes Do Not Have AP - Basim Samir - EgyptUploaded byglobal-marketin8184
- MFCSUploaded byY David Abhishek Raj
- HISTORYOFMATHTable-1.docxUploaded byMariel Pastolero
- MfcsUploaded byJagadeesh Babu
- AGKZ_CorrUploaded bykonzda
- An Overview on Intuitionistic Fuzzy SetsUploaded byIJSTR Research Publication
- Symbolic Logic - VENN.pdfUploaded byjr1234
- Mfcs NotesUploaded bySeravana Kumar
- BetweennessRCC8 SupplementUploaded bybetweennessIJCAI2017
- Speculations VI Fernando ZalameaUploaded byziggy00zaggy
- SalesmanUploaded byBhuvan As
- Advanced Inequations ExerciseUploaded byAtul Kumar
- Intervensi Mathematics SPM KeynotesUploaded byLim Wai Wai Smktp
- Arrangement Set Dynamics Could Design People PoliticsUploaded bysfofoby
- 0606_s16_qp_22Uploaded byStanley
- Advanced Inequations Exercise - 2(a)Uploaded byAtul Kumar
- Http://Www.complore.com/Test4PDF.php?Id=362Uploaded bymebrucys
- Power Aggregation Operators of Simplified Neutrosophic Sets and Their Use in Multi-attribute Group Decision MakingUploaded byMia Amalia
- Factorising Solutions 2Uploaded byboostoberoi
- Chapter_4_L2.pdfUploaded byAnurup Sinha
- MODULE 2_Laplace TransformUploaded byJohn Raymart Rafer
- Santambrogio. Meinongian Theories of Generality (Article)Uploaded byBlaise09
- int13 alc proposalUploaded byapi-245590476
- PCR5 and Neutrosophic Probability in Target IdentificationUploaded byscience2010
- 0606_m16_ms_12Uploaded byStanley

- MFCS_impUploaded byJagadeesh Babu
- sqlUploaded byJagadeesh Babu
- ReadmeUploaded byJagadeesh Babu
- MfcsUploaded byJagadeesh Babu
- So a SyllabusUploaded byJagadeesh Babu
- TutorialUploaded byJagadeesh Babu
- OR_WORDUploaded byJagadeesh Babu
- Introduction to the Advanced Encryption StandardUploaded byJagadeesh Babu
- oaf_import_criptUploaded byJagadeesh Babu
- IT Work Shop ManualUploaded byJagadeesh Babu
- dependentpicklistUploaded byJagadeesh Babu
- Dependent LOV in OAFUploaded byJagadeesh Babu
- Dependent LOV in OAFUploaded byJagadeesh Babu
- XMLP Concurrent Program with burstingUploaded byJagadeesh Babu
- AIMUploaded byJagadeesh Babu
- gl conceptsUploaded byJagadeesh Babu
- Decode and CaseUploaded byJagadeesh Babu