Scribd
Upload
31 views

03. Discrete Mathematics

Uploaded by

nidhi asthana
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
31 views

03. Discrete Mathematics

Uploaded by

nidhi asthana
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

SVKM’s NMIMS

Mukesh Patel School of Technology Management & Engineering

Program: MBA Tech. (Computer Engineering) Semester : III

Course/Module: Discrete Mathematics Module Code: MBCO03010


Teaching Scheme Evaluation Scheme
Internal Term End
Lecture Practical Tutorial
Continuous Examinations
(Hours (Hours (Hours
Credit Assessment (TEE)
per per per
(ICA) (Marks- 100
week) week) week)
(Marks - 50 ) in Question Paper)
3 4 Marks Scaled to Marks Scaled to 50
0 1
50
Pre-requisite: Basic proving techniques, concepts in number theory, Algebra, pre-
calculus.
Objectives:
1. Train the students in the construction and understanding of mathematical
proofs, exercise common mathematical arguments and proof strategies.
2. Prepare the students to use the basic methods of discrete mathematics in the
subsequent courses of computer science in the design and analysis of algorithms
and software engineering.
Outcomes:
After completion of the course, students would be able to:
1. Define and relate basic notions of Graph theory, set theory and relation.
2. Demonstrate the ability to express a logical sentence in terms of predicates,
quantifiers and logical connectives and solve problems using Pigeonhole
principle.
3. Solve Problems based on Graphs, groups, rings, relations and their properties.
4. Derive the solution using deductive logic, mathematical induction and basic
counting techniques for a given problem.
Detailed Syllabus:

Unit Description Duration

1 Sets , Relation and Function: 8


Operations and Laws of Sets, Size of a Set, Finite and infinite Sets,
Countable and uncountable Sets, Cartesian Products, Principle of
inclusion and exclusion, Binary Relation, Equivalence Relation,
Partial Ordering Relation, Image of a Set, Types of functions,
Inverse and Composite Function.
2 Principles of Mathematical Induction and Basic Counting 8
techniques:
Mathematical Induction, The Well-Ordering Principle, Recursive
definition, The Division algorithm: Prime Numbers, The Greatest
Common Divisor: Euclidean Algorithm, The Fundamental

1 MBA Tech /2nd Year /Sem III/ A.Y 2019-20


SVKM’s NMIMS
Mukesh Patel School of Technology Management & Engineering

Theorem of Arithmetic, pigeon-hole principle, permutation,


combination.
3 Propositional Logic: 8
Syntax, Semantics, Validity and Satisfiability, Basic Connectives
and Truth Tables, Logical Equivalence, Logical Implication, The
Laws of Logic, Rules of Inference.
The use of Quantifiers, Disjunctive and Conjunctive Normal Form.
Proof Techniques: Some Terminologies, Proof Methods, Forward
Proof, Proof by Contradiction and Strategies, Proof by
Contraposition,
Proof of Necessity and Sufficiency.
4 Algebraic Structures and Morphism: 11
Algebraic Structures with one Binary Operation: Semi Groups,
Monoids, Groups.
Congruence Relation, Permutation Groups, Free and Cyclic
Monoids and Groups, Substructures, Normal Subgroups,
Quotient Structures.
Algebraic Structures with two Binary Operation: Rings, Integral
Domain, Fields.
5 Graphs and Trees: 10
Graphs and their properties, Degree, Connectivity, Path, Cycle,
Sub Graph, Isomorphism, Eulerian and Hamiltonian Walks,
Graph Colouring, Colouring maps and Planar Graphs, Colouring
Vertices, Colouring Edges, List Colouring, Perfect Graph:
Definition, properties and Example, rooted trees, trees and sorting,
weighted trees and prefix codes, Bi-connected component and
Articulation Points, Shortest distances.
Total 45

Text Books:
1. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, Tata
McGraw Hill, 7th Edition, 2012.
2. Susanna S. Epp, “Discrete Mathematics with Applications”, Cengage
Learning, 4th Edition, 2010.
3. C L Liu and D P Mohapatra, Elements of Discrete Mathematics A Computer
Oriented Approach, Tata McGraw Hill, 3rd Edition, 2008.
Reference Books:
1. J. P. Tremblay and R. Manohar, “Discrete Mathematical Structure and its
Application to Computer Science”, Tata McGraw Hill, 35th Edition, 2008.
2. Schaum’s Outline Series, Seymour Lipschutz and Mark Lipson, “Discrete
Mathematics”, Tata McGraw Hill, Revised Third Edition, 2017.
3. Kolman, Busby and Ross, “Discrete Mathematical Structures”, Prentice
Hall India, 6th Edition, 2015.
Details of Internal Continuous Assessment (ICA)
Test Marks: 20

2 MBA Tech /2nd Year /Sem III/ A.Y 2019-20


SVKM’s NMIMS
Mukesh Patel School of Technology Management & Engineering

Term Work Marks: 30


Details of Term work: As per Institute norms.

__________________ __________________
Signature Signature
(Prepared by Concerned Faculty/HOD) (Approved by Dean)

3 MBA Tech /2nd Year /Sem III/ A.Y 2019-20

You might also like