SlideShare a Scribd company logo
Dear students get fully solved assignments 
Send your semester & Specialization name to our mail id : 
“ help.mbaassignments@gmail.com ” 
or 
Call us at : 08263069601 
ASSIGNMENT 
PROGRAM MCA(REVISED FALL 2012) 
SEMESTER FIRST 
SUBJECT CODE & NAME MCA1030- FOUNDATION OF MATHEMATICS 
CREDIT 4 
BK ID B1646 
MAX.MARKS 60 
Note: Answer all questions. Kindly note that answers for 10 marks questions should be approximately 
of 400 words. Each question is followed by evaluation scheme. 
1 (i)State Cauchy’s Theorem. 
Answer: Cauchy's theorem is a theorem in the mathematics of group theory, named after Augustin 
Louis Cauchy. It states that if G is a finite group and p is a prime number dividing theorder of G (the 
number of elements in G), then G contains an element of order p. That is, there is x in G so that p is the 
lowest non-zero number with xp = e, where e is the identity element. 
The theorem is related to Lagrange's theorem, which states that the order of any subgroup of a finite 
group G divides the order of G. Cauchy's theorem implies that for any prime divisor p of the order of G, 
there is a subgroup of G whose order is p—the 
(ii)Verify Cauchy’s Theorem for the following function 
푆푖푛푥,표푠푥 푖푛 [0,휋2]
Answer: Answer: - A basic concept in the general Cauchy theory is that of winding number or index of a 
point with respect to a closed curve not containing the point. In order to make this precise, we need 
several preliminary results on logarithm and argument 
Q.2 Define Tautology and contradiction. Show that 
a) (p q)  (~ p) is a tautology. 
b) (p q) (~ p) is a contradiction 
Answer: - Tautology: - In logic, a tautology (from the Greek word ταυτολογία) is a formula which is true 
in every possible interpretation. Philosopher Ludwig Wittgenstein first applied the term to redundancies 
of propositional logic in 1921; (it had been used earlier to refer to rhetorical tautologies, and continues 
to be used in that alternate sense). A formula is satisfiable if it is true under at least one interpretation, 
and thus a tautology is a formula whose negation is unsati sfiable. Unsatisfiable statements, both 
through negation and affirmation, are known 
Q.3 State Lagrange’s Theorem. Verify Lagrange’s mean value theorem for the function 
f(x) = 3 x2 – 5x + 1 defined in interval [2, 5] 
Answer: - Suppose f is a function defined on a closed interval [a,b] (with a<b ) such that the following 
two conditions hold: 
1. f is a continuous function on the closed interval [a,b](i.e., it is right continuous at a , left continuous at 
b , and two-sided continuous at all points in the open interval(a,b) ). 
2. f is a differentiable function on the open 
Q.4 Define Negation. Write the negation of each of the following conjunctions: 
A) Paris is in France and London is in England. 
B) 2 + 3 = 5 and 8 < 10. 
Answer: - Negation: - In logic, negation, also called logical complement, is an operation that takes a 
proposition p to another proposition "not p", written ¬p, which is interpreted intuitively as being true 
when p is false and false when p is true. Negation is thus a unary (single-argument) logical connective. It 
may be applied as an operation on propositions, truth values, or semantic values more generally. The 
action or logical operation of negating or making negative b : a negative statement, judgment, or 
doctrine; especially : a logical proposition formed
(b )푥2푦2−푎2(푥2+푦2)=0 
Q.5 Find the asymptote parallel to the coordinate axis of the following curves 
(i) (푥2+푦2)푥−푎푦2=0 
(ii) 푥2푦2−푎2(푥2+푦2)=0 
Answer: - (I) (푥2+푦2)푥−푎푦2=0 
F(x) = (푥2+푦2)푥−푎푦2
(b )푥2푦2−푎2(푥2+푦2)=0 
Q.6 Define (I) Set (ii) Null Set (iii) Subset (iv) Power set (v)Union set 
Answer: - Set: - In mathematics, a set is a collection of distinct objects, considered as an object in its 
own right. For example, the numbers 2, 4, and 6 are distinct objects when considered separately, but 
when they are considered collectively they form a single set of size three, written {2,4,6}. Sets are one 
of the most fundamental concepts in mathematics. In everyday life, we have to deal with the 
collections of objects of one kind or the other. 
 The collection of even natural numbers less than 12 i.e., of the numbers 2,4,6,8, and 10. 
 The collection of vowels in the English alphabet, i.e., of the letters a ,e ,i ,o , u. 
 The collection of all students of class

More Related Content

What's hot

Group abstract algebra
Group  abstract algebraGroup  abstract algebra
Group abstract algebra
NaliniSPatil
 
Isomorphism
IsomorphismIsomorphism
Isomorphism
sheisirenebkm
 
Two very short proofs of combinatorial identity - Integers 5 A18 (2005)
Two very short proofs of combinatorial identity - Integers 5 A18 (2005)Two very short proofs of combinatorial identity - Integers 5 A18 (2005)
Two very short proofs of combinatorial identity - Integers 5 A18 (2005)
Roberto Anglani
 
Artificial Intelligence (AI) | Prepositional logic (PL)and first order predic...
Artificial Intelligence (AI) | Prepositional logic (PL)and first order predic...Artificial Intelligence (AI) | Prepositional logic (PL)and first order predic...
Artificial Intelligence (AI) | Prepositional logic (PL)and first order predic...
Ashish Duggal
 
Group Theory
Group TheoryGroup Theory
Group Theory
shinojmadhu
 
Group homomorphism
Group homomorphismGroup homomorphism
Group homomorphism
NaliniSPatil
 
AI Lesson 12
AI Lesson 12AI Lesson 12
AI Lesson 12
Assistant Professor
 
Top school in noida
Top school in noidaTop school in noida
Top school in noida
Edhole.com
 
Functions And Relations
Functions And RelationsFunctions And Relations
Functions And Relations
andrewhickson
 
4
44
Logic agent
Logic agentLogic agent
Logic agent
Slideshare
 
Discrete Mathematics with Applications 4th Edition Susanna Solutions Manual
Discrete Mathematics with Applications 4th Edition Susanna Solutions ManualDiscrete Mathematics with Applications 4th Edition Susanna Solutions Manual
Discrete Mathematics with Applications 4th Edition Susanna Solutions Manual
HayfaVaughan
 
Logic (PROPOSITIONS)
Logic (PROPOSITIONS)Logic (PROPOSITIONS)
Logic (PROPOSITIONS)
D Nayanathara
 
Prpositional2
Prpositional2Prpositional2
Prpositional2
gueste5006ef
 
Abstract Algebra Cheat Sheet
Abstract Algebra Cheat SheetAbstract Algebra Cheat Sheet
Abstract Algebra Cheat Sheet
Moe Han
 
BCA_Semester-II-Discrete Mathematics_unit-i Group theory
BCA_Semester-II-Discrete Mathematics_unit-i Group theoryBCA_Semester-II-Discrete Mathematics_unit-i Group theory
BCA_Semester-II-Discrete Mathematics_unit-i Group theory
Rai University
 
AI Lesson 11
AI Lesson 11AI Lesson 11
AI Lesson 11
Assistant Professor
 
Discrete-Chapter 08 Relations
Discrete-Chapter 08 RelationsDiscrete-Chapter 08 Relations
Discrete-Chapter 08 Relations
Wongyos Keardsri
 
Relations in Discrete Math
Relations in Discrete MathRelations in Discrete Math
Relations in Discrete Math
Pearl Rose Cajenta
 
Logic (slides)
Logic (slides)Logic (slides)
Logic (slides)
IIUM
 

What's hot (20)

Group abstract algebra
Group  abstract algebraGroup  abstract algebra
Group abstract algebra
 
Isomorphism
IsomorphismIsomorphism
Isomorphism
 
Two very short proofs of combinatorial identity - Integers 5 A18 (2005)
Two very short proofs of combinatorial identity - Integers 5 A18 (2005)Two very short proofs of combinatorial identity - Integers 5 A18 (2005)
Two very short proofs of combinatorial identity - Integers 5 A18 (2005)
 
Artificial Intelligence (AI) | Prepositional logic (PL)and first order predic...
Artificial Intelligence (AI) | Prepositional logic (PL)and first order predic...Artificial Intelligence (AI) | Prepositional logic (PL)and first order predic...
Artificial Intelligence (AI) | Prepositional logic (PL)and first order predic...
 
Group Theory
Group TheoryGroup Theory
Group Theory
 
Group homomorphism
Group homomorphismGroup homomorphism
Group homomorphism
 
AI Lesson 12
AI Lesson 12AI Lesson 12
AI Lesson 12
 
Top school in noida
Top school in noidaTop school in noida
Top school in noida
 
Functions And Relations
Functions And RelationsFunctions And Relations
Functions And Relations
 
4
44
4
 
Logic agent
Logic agentLogic agent
Logic agent
 
Discrete Mathematics with Applications 4th Edition Susanna Solutions Manual
Discrete Mathematics with Applications 4th Edition Susanna Solutions ManualDiscrete Mathematics with Applications 4th Edition Susanna Solutions Manual
Discrete Mathematics with Applications 4th Edition Susanna Solutions Manual
 
Logic (PROPOSITIONS)
Logic (PROPOSITIONS)Logic (PROPOSITIONS)
Logic (PROPOSITIONS)
 
Prpositional2
Prpositional2Prpositional2
Prpositional2
 
Abstract Algebra Cheat Sheet
Abstract Algebra Cheat SheetAbstract Algebra Cheat Sheet
Abstract Algebra Cheat Sheet
 
BCA_Semester-II-Discrete Mathematics_unit-i Group theory
BCA_Semester-II-Discrete Mathematics_unit-i Group theoryBCA_Semester-II-Discrete Mathematics_unit-i Group theory
BCA_Semester-II-Discrete Mathematics_unit-i Group theory
 
AI Lesson 11
AI Lesson 11AI Lesson 11
AI Lesson 11
 
Discrete-Chapter 08 Relations
Discrete-Chapter 08 RelationsDiscrete-Chapter 08 Relations
Discrete-Chapter 08 Relations
 
Relations in Discrete Math
Relations in Discrete MathRelations in Discrete Math
Relations in Discrete Math
 
Logic (slides)
Logic (slides)Logic (slides)
Logic (slides)
 

Similar to Mca1030 foundation of mathematics

Math Assignment Help
Math Assignment HelpMath Assignment Help
Math Assignment Help
Math Homework Solver
 
Stochastic Processes Homework Help
Stochastic Processes Homework Help Stochastic Processes Homework Help
Stochastic Processes Homework Help
Statistics Homework Helper
 
Boolean Programs and Quantified Propositional Proof System -
Boolean Programs and Quantified Propositional Proof System - Boolean Programs and Quantified Propositional Proof System -
Boolean Programs and Quantified Propositional Proof System -
Michael Soltys
 
Stochastic Processes Homework Help
Stochastic Processes Homework HelpStochastic Processes Homework Help
Stochastic Processes Homework Help
Excel Homework Help
 
01bkb04p.ppt
01bkb04p.ppt01bkb04p.ppt
01bkb04p.ppt
DrBasemMohamedElomda
 
a logical approach to abstract algebra (apuntes).pdf
a logical approach to abstract algebra (apuntes).pdfa logical approach to abstract algebra (apuntes).pdf
a logical approach to abstract algebra (apuntes).pdf
cibeyo cibeyo
 
Fuzzy logic andits Applications
Fuzzy logic andits ApplicationsFuzzy logic andits Applications
Fuzzy logic andits Applications
DrATAMILARASIMCA
 
SESSION-12 PPT.pptx
SESSION-12 PPT.pptxSESSION-12 PPT.pptx
SESSION-12 PPT.pptx
NaniSarath
 
dma_ppt.pdf
dma_ppt.pdfdma_ppt.pdf
dma_ppt.pdf
BatoolKhan15
 
Discrete mathematics notes
Discrete mathematics notesDiscrete mathematics notes
Discrete mathematics notes
josephndengeyingoma
 
Discrete Structure Lecture #5 & 6.pdf
Discrete Structure Lecture #5 & 6.pdfDiscrete Structure Lecture #5 & 6.pdf
Discrete Structure Lecture #5 & 6.pdf
MuhammadUmerIhtisham
 
Fuzzy logic and application in AI
Fuzzy logic and application in AIFuzzy logic and application in AI
Fuzzy logic and application in AI
Ildar Nurgaliev
 
Lecture 2 predicates quantifiers and rules of inference
Lecture 2 predicates quantifiers and rules of inferenceLecture 2 predicates quantifiers and rules of inference
Lecture 2 predicates quantifiers and rules of inference
asimnawaz54
 
P, NP and NP-Complete, Theory of NP-Completeness V2
P, NP and NP-Complete, Theory of NP-Completeness V2P, NP and NP-Complete, Theory of NP-Completeness V2
P, NP and NP-Complete, Theory of NP-Completeness V2
S.Shayan Daneshvar
 
Design and analysis of algorithms unit 6 non deterministic polynomial
Design and analysis of algorithms unit 6 non deterministic polynomialDesign and analysis of algorithms unit 6 non deterministic polynomial
Design and analysis of algorithms unit 6 non deterministic polynomial
nowicam882
 
DISMATH_Part1
DISMATH_Part1DISMATH_Part1
DISMATH_Part1
Melvin Cabatuan
 
ML_Unit_1_Part_B
ML_Unit_1_Part_BML_Unit_1_Part_B
ML_Unit_1_Part_B
Srimatre K
 
DM(1).pptx
DM(1).pptxDM(1).pptx
DM(1).pptx
PradeeshSAI
 
Lemh1a1
Lemh1a1Lemh1a1
Lemh1a1
Lemh1a1Lemh1a1

Similar to Mca1030 foundation of mathematics (20)

Math Assignment Help
Math Assignment HelpMath Assignment Help
Math Assignment Help
 
Stochastic Processes Homework Help
Stochastic Processes Homework Help Stochastic Processes Homework Help
Stochastic Processes Homework Help
 
Boolean Programs and Quantified Propositional Proof System -
Boolean Programs and Quantified Propositional Proof System - Boolean Programs and Quantified Propositional Proof System -
Boolean Programs and Quantified Propositional Proof System -
 
Stochastic Processes Homework Help
Stochastic Processes Homework HelpStochastic Processes Homework Help
Stochastic Processes Homework Help
 
01bkb04p.ppt
01bkb04p.ppt01bkb04p.ppt
01bkb04p.ppt
 
a logical approach to abstract algebra (apuntes).pdf
a logical approach to abstract algebra (apuntes).pdfa logical approach to abstract algebra (apuntes).pdf
a logical approach to abstract algebra (apuntes).pdf
 
Fuzzy logic andits Applications
Fuzzy logic andits ApplicationsFuzzy logic andits Applications
Fuzzy logic andits Applications
 
SESSION-12 PPT.pptx
SESSION-12 PPT.pptxSESSION-12 PPT.pptx
SESSION-12 PPT.pptx
 
dma_ppt.pdf
dma_ppt.pdfdma_ppt.pdf
dma_ppt.pdf
 
Discrete mathematics notes
Discrete mathematics notesDiscrete mathematics notes
Discrete mathematics notes
 
Discrete Structure Lecture #5 & 6.pdf
Discrete Structure Lecture #5 & 6.pdfDiscrete Structure Lecture #5 & 6.pdf
Discrete Structure Lecture #5 & 6.pdf
 
Fuzzy logic and application in AI
Fuzzy logic and application in AIFuzzy logic and application in AI
Fuzzy logic and application in AI
 
Lecture 2 predicates quantifiers and rules of inference
Lecture 2 predicates quantifiers and rules of inferenceLecture 2 predicates quantifiers and rules of inference
Lecture 2 predicates quantifiers and rules of inference
 
P, NP and NP-Complete, Theory of NP-Completeness V2
P, NP and NP-Complete, Theory of NP-Completeness V2P, NP and NP-Complete, Theory of NP-Completeness V2
P, NP and NP-Complete, Theory of NP-Completeness V2
 
Design and analysis of algorithms unit 6 non deterministic polynomial
Design and analysis of algorithms unit 6 non deterministic polynomialDesign and analysis of algorithms unit 6 non deterministic polynomial
Design and analysis of algorithms unit 6 non deterministic polynomial
 
DISMATH_Part1
DISMATH_Part1DISMATH_Part1
DISMATH_Part1
 
ML_Unit_1_Part_B
ML_Unit_1_Part_BML_Unit_1_Part_B
ML_Unit_1_Part_B
 
DM(1).pptx
DM(1).pptxDM(1).pptx
DM(1).pptx
 
Lemh1a1
Lemh1a1Lemh1a1
Lemh1a1
 
Lemh1a1
Lemh1a1Lemh1a1
Lemh1a1
 

Mca1030 foundation of mathematics

  • 1. Dear students get fully solved assignments Send your semester & Specialization name to our mail id : “ help.mbaassignments@gmail.com ” or Call us at : 08263069601 ASSIGNMENT PROGRAM MCA(REVISED FALL 2012) SEMESTER FIRST SUBJECT CODE & NAME MCA1030- FOUNDATION OF MATHEMATICS CREDIT 4 BK ID B1646 MAX.MARKS 60 Note: Answer all questions. Kindly note that answers for 10 marks questions should be approximately of 400 words. Each question is followed by evaluation scheme. 1 (i)State Cauchy’s Theorem. Answer: Cauchy's theorem is a theorem in the mathematics of group theory, named after Augustin Louis Cauchy. It states that if G is a finite group and p is a prime number dividing theorder of G (the number of elements in G), then G contains an element of order p. That is, there is x in G so that p is the lowest non-zero number with xp = e, where e is the identity element. The theorem is related to Lagrange's theorem, which states that the order of any subgroup of a finite group G divides the order of G. Cauchy's theorem implies that for any prime divisor p of the order of G, there is a subgroup of G whose order is p—the (ii)Verify Cauchy’s Theorem for the following function 푆푖푛푥,표푠푥 푖푛 [0,휋2]
  • 2. Answer: Answer: - A basic concept in the general Cauchy theory is that of winding number or index of a point with respect to a closed curve not containing the point. In order to make this precise, we need several preliminary results on logarithm and argument Q.2 Define Tautology and contradiction. Show that a) (p q)  (~ p) is a tautology. b) (p q) (~ p) is a contradiction Answer: - Tautology: - In logic, a tautology (from the Greek word ταυτολογία) is a formula which is true in every possible interpretation. Philosopher Ludwig Wittgenstein first applied the term to redundancies of propositional logic in 1921; (it had been used earlier to refer to rhetorical tautologies, and continues to be used in that alternate sense). A formula is satisfiable if it is true under at least one interpretation, and thus a tautology is a formula whose negation is unsati sfiable. Unsatisfiable statements, both through negation and affirmation, are known Q.3 State Lagrange’s Theorem. Verify Lagrange’s mean value theorem for the function f(x) = 3 x2 – 5x + 1 defined in interval [2, 5] Answer: - Suppose f is a function defined on a closed interval [a,b] (with a<b ) such that the following two conditions hold: 1. f is a continuous function on the closed interval [a,b](i.e., it is right continuous at a , left continuous at b , and two-sided continuous at all points in the open interval(a,b) ). 2. f is a differentiable function on the open Q.4 Define Negation. Write the negation of each of the following conjunctions: A) Paris is in France and London is in England. B) 2 + 3 = 5 and 8 < 10. Answer: - Negation: - In logic, negation, also called logical complement, is an operation that takes a proposition p to another proposition "not p", written ¬p, which is interpreted intuitively as being true when p is false and false when p is true. Negation is thus a unary (single-argument) logical connective. It may be applied as an operation on propositions, truth values, or semantic values more generally. The action or logical operation of negating or making negative b : a negative statement, judgment, or doctrine; especially : a logical proposition formed
  • 3. (b )푥2푦2−푎2(푥2+푦2)=0 Q.5 Find the asymptote parallel to the coordinate axis of the following curves (i) (푥2+푦2)푥−푎푦2=0 (ii) 푥2푦2−푎2(푥2+푦2)=0 Answer: - (I) (푥2+푦2)푥−푎푦2=0 F(x) = (푥2+푦2)푥−푎푦2
  • 4. (b )푥2푦2−푎2(푥2+푦2)=0 Q.6 Define (I) Set (ii) Null Set (iii) Subset (iv) Power set (v)Union set Answer: - Set: - In mathematics, a set is a collection of distinct objects, considered as an object in its own right. For example, the numbers 2, 4, and 6 are distinct objects when considered separately, but when they are considered collectively they form a single set of size three, written {2,4,6}. Sets are one of the most fundamental concepts in mathematics. In everyday life, we have to deal with the collections of objects of one kind or the other.  The collection of even natural numbers less than 12 i.e., of the numbers 2,4,6,8, and 10.  The collection of vowels in the English alphabet, i.e., of the letters a ,e ,i ,o , u.  The collection of all students of class