63% found this document useful (8 votes)

6K views

MCS-013 Discrete Mathematics Solved Assingment by

Download free assignment of IGNOU MCA ASSIGNMENT FIRST SEMESTER Solved assignment of MCS-013 Discrete Mathematics Session download more assignment at ignousolvedassignments.com MCS-013,Discrete Mathematics,ignou solved assignment, ignousolvedassignment.com, ignou discrete mathematics assignment

Uploaded by

Sumit Ranjan

Available Formats

Download as PDF, TXT or read online on Scribd

63% found this document useful (8 votes)

6K views

MCS-013 Discrete Mathematics Solved Assingment by

Uploaded by

Sumit Ranjan

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 52

IGNOU Solved Assignments By http://ignousolvedassignments.

com

Course Code : MCS-013

Course Title : Discrete Mathematics
Assignment Number : MCA(1)/013/Assignment/16-17
Last Dates for Submission : 15th October, 2017 (For July 2017 Session)

15th April, 2018 (For January 2018 Session)

This assignment has twenty questions in all and carries 80 marks. The rest of the 20 marks are
for viva-voice. Answer all the questions. All questions carry equal marks (i.e. 4 marks each).
Please go through the guidelines regarding assignments given in the Programme Guide for the
format of presentation.

Disclaimer: This Assignment is prepared by our students. The Institution and publisher are not
responsible for any omission and errors.

1. (a) What is proposition? Explain whether, x-y >5 is a proposition or not.

A proposition is that part of the meaning of a clause or sentence that is constant,
despite changes in such things as the voice or illocutionary force of the clause.

A proposition may be related to other units of its kind through interpropositional

relations, such as temporal relations and logical relations.

A proposition is a predicate or an expression which has only two values : True or

false.

x-y > 5

We need to substitute the values of x and y in the preposition.

If the value of arithmetic expression (x - y) is more than 5 then the preposition is

True.

Otherwise, if the value of (x - y) is less than or equal to 5 then the preposition is

false.

Hence, x - y > 5 is a predicate or a preposition.

Another way,

Yes, x-y >5 is a proposition

Because x-y > 5
Always true for x={6,7,8,9,10,} or y ={0,1,2,3,4,.. }
And
Always false for { x < y , x = y or y+5=x }

Course Code : MCS-013 Course Title : Discrete Mathematics

Assignment Number : MCA(1)/013/Assignment/16-17 http://ignousolvedassignments.com
IGNOU Solved Assignments By http://ignousolvedassignments.com

(b) Make truth table for followings.

(i) p (~q ~ r) (~p r)

(ii) p (r q) (~p ~q)

A.1.(b)
(i) p (~q ~ r) (~p r)

p q r ~p or ~q p -> (~p or ~q) ~p or r p (~q ~ r) (~p r)

FALSE FALSE FALSE TRUE FALSE TRUE FALSE
FALSE FALSE TRUE TRUE FALSE TRUE FALSE
FALSE TRUE FALSE TRUE FALSE TRUE FALSE
FALSE TRUE TRUE TRUE FALSE TRUE FALSE
TRUE FALSE FALSE TRUE TRUE FALSE FALSE
TRUE FALSE TRUE TRUE TRUE TRUE TRUE
TRUE TRUE FALSE FALSE TRUE FALSE FALSE
TRUE TRUE TRUE FALSE TRUE TRUE TRUE

(ii) p (r q) (~p ~q)

p q r r or q p -> (r or q) (~p and ~q) p (r q) (~p ~q)

FALSE FALSE FALSE FALSE TRUE TRUE TRUE
FALSE FALSE TRUE TRUE FALSE TRUE FALSE
FALSE TRUE FALSE TRUE FALSE FALSE FALSE
FALSE TRUE TRUE TRUE FALSE FALSE FALSE
TRUE FALSE FALSE FALSE TRUE FALSE FALSE
TRUE FALSE TRUE TRUE TRUE FALSE FALSE
TRUE TRUE FALSE TRUE TRUE FALSE FALSE
TRUE TRUE TRUE TRUE TRUE FALSE FALSE

Course Code : MCS-013 Course Title : Discrete Mathematics

(i) (A U B) U ( B C )

(ii) (A U B) ( C ~ A )

(i) R x { 4}; where R is a natural number

Course Code : MCS-013 Course Title : Discrete Mathematics

(ii) {2, 2) x ( 2, -4)

Course Code : MCS-013 Course Title : Discrete Mathematics

(i) Some birds can not fly

B : are birds
F : are fly

B->F all birds are flying

And at least one bird are flying

So
Neglect of above sentence

(~B) - >F

(ii) Nothing is correct

A : all things
B : correct

A->B

All things is correct

And neglected of sentence

(A) - > (~B) all things are not correct

So nothing is correct.

In propositional logic, modus tollens (or modus tollendo tollensand also denying the
consequent) (Latin for "the way that denies by denying") is a valid argument form and a rule of
inference. It is an application of the general truth that if a statement is true, then so is its
contra-positive.

Consider the following argument...

"If you have a current password, then you can log on to the network"

"You have a current password"

Therefore:

"You can log on to the network"

This has the form:

Course Code : MCS-013 Course Title : Discrete Mathematics

This form of argument is calls Modus Ponens (latin for "mode that affirms")

Note that an argument can be valid, even if one of the premises is false. For example, the
argument above doesn't say whether you do or don't have a current password. Maybe you do,
and maybe you don't . But either way, the argument is still valid.

Consider this argument:

You can't log into the network

If you have a current password, then you can log into the network

Therefore

You don't have a current password.

Now, in real life, we might say: that's not a valid argument. For example, maybe you can't log
into the network because your Ethernet cable is bad, or because the network is down for
maintenance, or any one of a zillion other reasons.

But in fact, this is a valid argument in logic. If we accept the two premises, then the conclusion
follows. One of the premises is "If you have a current password, you can log into the network".
There are no ifs, ands, or buts.

So, this illustrates an important point: when working with logic problems it is important to take
the statements literally and at face value. Don't read things into the problems that aren't there.

We sometimes use problems that seemto be about the real worldwe do this to make the
problems more interesting and relevant, and to give us some insight into what the symbols
mean. But the problems, ultimately are not in the real worldthey are about amathematical
model of the real world, where we make a lot of simplifying assumptions. For example, the
hard and fast absolute statement:

If you have a current password, then you can log into the network

Course Code : MCS-013 Course Title : Discrete Mathematics

According to this statement, a current password is sufficient for you to be able to log in.

So, if we assume this to be true, as we do in the argument below, and we assume that you
can't log into the network, then we can definitely conclude: you don't have a current password.
So here it is again:

You can't log into the network

If you have a current password, then you can log into the network

Therefore

You don't have a current password.

This is an argument of the form:

This form of argument is called modus tollens (the mode that denies).

Both modus ponens and modus tollens have "universal forms":

Universal modus ponens:

x((P(x)Q(x))

P(a), where a {domain of the predicate P}

Q(a)

E.g. All fish have scales. This salmon is a fish. Therefore, this salmon has scales.

Universal modus tollens:

x((P(x)Q(x))

Q(a), where a {domain of the predicate P}

P(a)

Course Code : MCS-013 Course Title : Discrete Mathematics

E.g. All surfers are hot. Conrad is not hot. Therefore Conrad is not a surfer.

A relation between two sets is a collection of ordered pairs containing one object from each
set. If the object x is from the first set and the object y is from the second set, then the objects
are said to be related if the ordered pair (x,y) is in the relation.

A function is a type of relation. But, a relation is allowed to have the object x in the first set to
be related to more than one object in the second set. So a relation may not be represented by
a function machine, because, given the object x to the input of the machine, the machine
couldn't spit out a unique output object that is paired to x.

Equivalence Relation

An equivalence relation on a set is a subset of , i.e., a collection of ordered pairs of elements

of , satisfying certain properties. Write "" to mean is an element of , and we say " is related to
," then the properties are

1. Reflexive: for all ,

2. Symmetric: implies for alla,b in X

3. Transitive: and imply for all a,b,c in X,

where these three properties are completely independent. Other notations are often used to
indicate a relation, e.g., o

Course Code : MCS-013 Course Title : Discrete Mathematics

A.4.(c)

Set theory is an important branch of mathematics. It is the study of mathematical logic and its
applications. Set theory defines a term "set". A set is defined as the collection of elements,
such as numbers or other objects, which are arranged in a group. The set contains the
elements of similar type or category. The set with any numbers can be denoted in the symbol
braces { }.
For example, the set of numbers may be represented as {2, 3, 4, 5, 6}. We can also write this
set as {x : 1 < x < 7}. A totally bounded set is defined as a set which is having a definite or
finite size. The bounded set consists of the numbers which are the set of real numbers. A
bounded set has both the upper and lower bounds that exists within a particular interval. The
bounded numbers in a set are having a definite or fixed size and it always lies between the
given intervals. The bounded set contains a bounded sequence form.
Set theory basically deals with set and set operations. Though, it includes a quite vast study of
logic and reasoning. In this page, we are going to focus on introduction of set theory, basic
formulas used in set theory, some basic properties and introduction to the Venn diagram. So
students, go ahead with us and gain knowledge about set theory in this chapter.

The two basic properties to represent a set are explained below using various examples.

1. The change in order of writing the elements does not make any changes in the set.

In other words the order in which the elements of a set are written is not important. Thus, the
set {a, b, c} can also be written as {a, c, b} or {b, c, a} or {b, a, c} or {c, a, b} or {c, b, a}.

For Example:

Set A = {4, 6, 7, 8, 9} is same as set A = {8, 4, 9, 7, 6}

i.e., {4, 6, 7, 8, 9} = {8, 4, 9, 7, 6}

Similarly, {w, x, y, z} = {x, z, w, y} = {z, w, x, y} and so on.

2. If one or many elements of a set are repeated, the set remains the same.

In other words the elements of a set should be distinct. So, if any element of a set is repeated
number of times in the set, we consider it as a single element. Thus, {1, 1, 2, 2, 3, 3, 4, 4, 4} =
{1, 2, 3, 4}

The set of letters in the word GOOGLE = {G, O, L, E}

For Example:

The set A = {5, 6, 7, 6, 8, 5, 9} is same as set A= {5, 6, 7, 8, 9}

Course Code : MCS-013 Course Title : Discrete Mathematics
Assignment Number : MCA(1)/013/Assignment/16-17 http://ignousolvedassignments.com
IGNOU Solved Assignments By http://ignousolvedassignments.com

i.e., {5, 6, 7, 6, 8, 5, 9} = {5, 6, 7, 8, 9}

In general, the elements of a set are not repeated. Thus,

(i) if T is a set of letters of the word moon: then T = {m, o, n},

There are two os in the word moon but it is written in the set only once.

(ii) if U = {letters of the word COMMITTEE}; then U = {C, O, M, T, E}

Solved examples using the properties of sets:

1. Write the set of vowels used in the word UNIVERSITY.

Solution:

Set V = {U, I, E}

2. For each statement, given below, state whether it is true or false along with the
explanations.

(i) {9, 9, 9, 9, 9, ..} = {9}

(ii) {p, q, r, s, t} = {t, s, r, q, p}

Solution:

(i) {9, 9, 9, 9, 9, ..} = {9}

True, since repetition of elements does not change the set.

(ii) {p, q, r, s, t} = {t, s, r, q, p}

True, since the change in order of writing the elements does not change the set.

Course Code : MCS-013 Course Title : Discrete Mathematics

A.5.(d)

Proof:

STEP 1: For n=1 (1.1) is true, since

1 =1(1 + 1)/2

STEP 2: Suppose (1.1) is true for some n = k 1, that is

1 + 2 + 3 + . . . + k = k(k + 1)/2
Course Code : MCS-013 Course Title : Discrete Mathematics
Assignment Number : MCA(1)/013/Assignment/16-17 http://ignousolvedassignments.com
IGNOU Solved Assignments By http://ignousolvedassignments.com

STEP 3: Prove that (1.1) is true for n = k + 1, that is

1 + 2 + 3 + . . . + k + (k + 1) ?= (k + 1)(k + 2)/2

We have

1 + 2 + 3 + . . . + k + (k + 1) ST.2 =

k(k + 1)/2

+ (k + 1) = (k + 1) k/2+ 1= (k + 1)(k + 2)

Course Code : MCS-013 Course Title : Discrete Mathematics

A.7.(a)(b)(c)(d)

Course Code : MCS-013 Course Title : Discrete Mathematics

A.8.(a)(b)(c)

Course Code : MCS-013 Course Title : Discrete Mathematics

Course Code : MCS-013

Course Title : Discrete Mathematics
Assignment Number : MCA(1)/013/Assignment/16-17
Last Dates for Submission : 15th October, 2017 (For July 2017 Session)

15th April, 2018 (For January 2018 Session)

Course Code : MCS-013 Course Title : Discrete Mathematics

Assignment Number : MCA(1)/013/Assignment/16-17 http://ignousolvedassignments.com

PEAC-Curriculum-Map G7
91% (22)
PEAC-Curriculum-Map G7
9 pages
Discrete Mathematics Cheat Sheet
20% (5)
Discrete Mathematics Cheat Sheet
3 pages
Probability and Computing 2nd Edition
100% (2)
Probability and Computing 2nd Edition
490 pages
Discrete Math Notes
0% (1)
Discrete Math Notes
454 pages
Back Tracking
No ratings yet
Back Tracking
36 pages
Maths D Formula
100% (1)
Maths D Formula
21 pages
MCS-013: Discrete Mathematics
From Everand
MCS-013: Discrete Mathematics
Dr. DK Sukhani
No ratings yet
MCS 012 Solved Assignments 2016-9
No ratings yet
MCS 012 Solved Assignments 2016-9
1 page
DBMS Notes
No ratings yet
DBMS Notes
44 pages
Partially Ordered Set Unit 5
No ratings yet
Partially Ordered Set Unit 5
22 pages
MCSL 025 Lab Course (MCS-021,022,023,024)
No ratings yet
MCSL 025 Lab Course (MCS-021,022,023,024)
21 pages
2629acomputer Architecture
No ratings yet
2629acomputer Architecture
15 pages
Operators and Expressions in C++
No ratings yet
Operators and Expressions in C++
32 pages
JAVA Lab Practices
No ratings yet
JAVA Lab Practices
7 pages
Mca N293 Java Lab Assignment
No ratings yet
Mca N293 Java Lab Assignment
2 pages
C Exercises
No ratings yet
C Exercises
9 pages
Bca Solved Assignment BCSL 021 C Language Programming Lab
No ratings yet
Bca Solved Assignment BCSL 021 C Language Programming Lab
7 pages
Mcs-012 Solved Assignment Ignou 2012
50% (2)
Mcs-012 Solved Assignment Ignou 2012
28 pages
C Programming
No ratings yet
C Programming
28 pages
8086 Assembly Language Programs
100% (2)
8086 Assembly Language Programs
13 pages
College of Computing & Information Sciences Discrete Mathematics (Assignment-1)
No ratings yet
College of Computing & Information Sciences Discrete Mathematics (Assignment-1)
3 pages
Java Lab Assignment, 2020
50% (2)
Java Lab Assignment, 2020
4 pages
Sma2100 Discrete Mathematics
100% (1)
Sma2100 Discrete Mathematics
78 pages
Bcsl-021 s1, s2, s3, s4 2012 December
No ratings yet
Bcsl-021 s1, s2, s3, s4 2012 December
4 pages
Cs2100 2 Number Systems and Codes
No ratings yet
Cs2100 2 Number Systems and Codes
73 pages
Lab Report 1 PDF
No ratings yet
Lab Report 1 PDF
6 pages
MAT1348 - AdditionalExercises - Discrete Mathematics
No ratings yet
MAT1348 - AdditionalExercises - Discrete Mathematics
22 pages
MCS 023 Solved Assignment
No ratings yet
MCS 023 Solved Assignment
55 pages
Java Assignment 2018 - 3rd Year-1
No ratings yet
Java Assignment 2018 - 3rd Year-1
1 page
Easy C Programming Problems & Solution For Beginners
No ratings yet
Easy C Programming Problems & Solution For Beginners
10 pages
C Programming-Structures & Union
No ratings yet
C Programming-Structures & Union
31 pages
BCS-053 Solved Assignment 2015-16 PDF
No ratings yet
BCS-053 Solved Assignment 2015-16 PDF
18 pages
Fundamental Programming Structures in Java
No ratings yet
Fundamental Programming Structures in Java
23 pages
DE Unit 3 Combinational Circuits - 13112017 - 024114AM PDF
No ratings yet
DE Unit 3 Combinational Circuits - 13112017 - 024114AM PDF
16 pages
An Introduction To Q-Difference Equations
No ratings yet
An Introduction To Q-Difference Equations
141 pages
C# Program Main
No ratings yet
C# Program Main
33 pages
Theory of Computation Lecture Notes
No ratings yet
Theory of Computation Lecture Notes
38 pages
OOC Notes
No ratings yet
OOC Notes
61 pages
Programming Paradigm
No ratings yet
Programming Paradigm
14 pages
Project List
No ratings yet
Project List
40 pages
Lecture Notes 5 - Problem Solving
100% (1)
Lecture Notes 5 - Problem Solving
10 pages
MCS 013
No ratings yet
MCS 013
16 pages
Problem Solving & Programming Notes - Unit - IV
100% (1)
Problem Solving & Programming Notes - Unit - IV
82 pages
MCS-012 - Computer Organisation and Assembly
No ratings yet
MCS-012 - Computer Organisation and Assembly
4 pages
Lab-9 Abstract Data Types
No ratings yet
Lab-9 Abstract Data Types
10 pages
Discrete Structure Notes by Samujjwal Bhandari
100% (2)
Discrete Structure Notes by Samujjwal Bhandari
151 pages
Ignou Bcs-011 Solved Assignment: Education Is The Key To Get Success
No ratings yet
Ignou Bcs-011 Solved Assignment: Education Is The Key To Get Success
47 pages
Oop Lab Manual
No ratings yet
Oop Lab Manual
57 pages
Important RGPV Question, CS-502, Database Management System ,V Sem (DBMS), CSE, B.tech. ? CS.com
No ratings yet
Important RGPV Question, CS-502, Database Management System ,V Sem (DBMS), CSE, B.tech. ? CS.com
17 pages
Computer Architecture
No ratings yet
Computer Architecture
10 pages
Introduction To Programming Using Java
No ratings yet
Introduction To Programming Using Java
510 pages
Functions in C
No ratings yet
Functions in C
6 pages
APP - Unit 1
No ratings yet
APP - Unit 1
91 pages
Intro To Automata Theory
No ratings yet
Intro To Automata Theory
23 pages
UNIT-1 Introduction To Operating System: Computer Science and Engineering
No ratings yet
UNIT-1 Introduction To Operating System: Computer Science and Engineering
13 pages
104 - Programming and Problem Solving Through 'C Language
No ratings yet
104 - Programming and Problem Solving Through 'C Language
3 pages
Oop Assignment 1
No ratings yet
Oop Assignment 1
8 pages
BCA Syllabus
No ratings yet
BCA Syllabus
66 pages
1 - Introduction To Number Theory
No ratings yet
1 - Introduction To Number Theory
45 pages
Complex analysis A Complete Guide
From Everand
Complex analysis A Complete Guide
Gerardus Blokdyk
No ratings yet
Solutions Manual to accompany An Introduction to Numerical Methods and Analysis
From Everand
Solutions Manual to accompany An Introduction to Numerical Methods and Analysis
James F. Epperson
5/5 (1)
Simplifying Circle Geometry
From Everand
Simplifying Circle Geometry
Jacob Ncongwane
No ratings yet
Introduction to Numerical Analysis
From Everand
Introduction to Numerical Analysis
Simone Malacrida
No ratings yet
MCS-024 Object Oriented Technologies and Java
No ratings yet
MCS-024 Object Oriented Technologies and Java
47 pages
MCS 021 Data and File Structures
No ratings yet
MCS 021 Data and File Structures
22 pages
MCS-014 Systems Analysis and Design
No ratings yet
MCS-014 Systems Analysis and Design
30 pages
MCS-022 Operating System Concepts and
No ratings yet
MCS-022 Operating System Concepts and
29 pages
MCSL-017 C and Assembly Language Programming Lab
No ratings yet
MCSL-017 C and Assembly Language Programming Lab
16 pages
MCS-015 Communication Skills
No ratings yet
MCS-015 Communication Skills
17 pages
BCS-012 Basic Mathematics Solved Assignments 2016-17
100% (2)
BCS-012 Basic Mathematics Solved Assignments 2016-17
12 pages
MCS-011 Problem Solving and Programming Assignment
No ratings yet
MCS-011 Problem Solving and Programming Assignment
8 pages
BCS-011 Computer Basics and PC Software Solved Assignment 2017
No ratings yet
BCS-011 Computer Basics and PC Software Solved Assignment 2017
17 pages
Enumerative Combinatorics
No ratings yet
Enumerative Combinatorics
565 pages
JEE Main Revision Notes On Statistics and Probability Free PDF
No ratings yet
JEE Main Revision Notes On Statistics and Probability Free PDF
7 pages
Mathematics7 Q1 Mod1 V1
No ratings yet
Mathematics7 Q1 Mod1 V1
43 pages
Study Material: Free Master Class Series
No ratings yet
Study Material: Free Master Class Series
47 pages
MET CS248 Summer 2022 Syllabus
No ratings yet
MET CS248 Summer 2022 Syllabus
4 pages
MATH 7 First Quarter Exam
No ratings yet
MATH 7 First Quarter Exam
3 pages
Introduction To Sets
No ratings yet
Introduction To Sets
2 pages
MTC8 0601 Q2 FPF
No ratings yet
MTC8 0601 Q2 FPF
24 pages
RA (Sets, Functions, Countability) 29.4.2018
No ratings yet
RA (Sets, Functions, Countability) 29.4.2018
1 page
Chapter 1
No ratings yet
Chapter 1
8 pages
Submodular Functions and Optimization 2nd ed Edition Satoru Fujishige (Eds.) - The full ebook version is ready for instant download
100% (1)
Submodular Functions and Optimization 2nd ed Edition Satoru Fujishige (Eds.) - The full ebook version is ready for instant download
48 pages
Intro To Set Theory
No ratings yet
Intro To Set Theory
11 pages
Automata and Complexity Theory Module
No ratings yet
Automata and Complexity Theory Module
104 pages
Discrete Mathamatics PDF
No ratings yet
Discrete Mathamatics PDF
3 pages
Grade 9 Annual Plan Last
No ratings yet
Grade 9 Annual Plan Last
4 pages
Uncertainty Modeling and Analysis in Engineering and the Sciences 1st Edition Bilal M. Ayyub - The ebook in PDF/DOCX format is available for instant download
100% (1)
Uncertainty Modeling and Analysis in Engineering and the Sciences 1st Edition Bilal M. Ayyub - The ebook in PDF/DOCX format is available for instant download
59 pages
M1102 Algebra II: Lebanese University Faculty of Sciences
No ratings yet
M1102 Algebra II: Lebanese University Faculty of Sciences
50 pages
Reflexive Property
No ratings yet
Reflexive Property
3 pages
MMW prefinals
No ratings yet
MMW prefinals
7 pages
Slides For Fuzzy Sets, Ch. 2 of Neuro-Fuzzy and Soft Computing
100% (2)
Slides For Fuzzy Sets, Ch. 2 of Neuro-Fuzzy and Soft Computing
42 pages
STAT301 Notes
No ratings yet
STAT301 Notes
168 pages
Mth-202 Mid Term Mcq's by Vu Topper RM
No ratings yet
Mth-202 Mid Term Mcq's by Vu Topper RM
29 pages
Theory of Set
No ratings yet
Theory of Set
15 pages
Finite Sets and Counting: Chris Preston
No ratings yet
Finite Sets and Counting: Chris Preston
56 pages
Matoshri College of Engineering and Research Center Nasik Department of Computer Engineering
No ratings yet
Matoshri College of Engineering and Research Center Nasik Department of Computer Engineering
18 pages
Etufc
No ratings yet
Etufc
9 pages
Module 3 Lesson 3
No ratings yet
Module 3 Lesson 3
4 pages