L T P J C

MAT1016 Applied Discrete Mathematical Structures

3 1 0 0 4
Prerequisites: Nil

Module Topic Lecture

Hours SLO
1 Sets, Sequences, and Counting
Operations on Sets and Cardinality -The Pigeonhole
Principle- Sequences -The Characteristic Sequence of a 7 1,2,7,9
Subset - Counting- Number of k-Sequences on an n-Set-
Number of k-Permutations on an n-Set -Number of k-
Subsets of an n-Set.

2 Boolean Expressions, Logic, and Proof

Boolean Expressions and Truth Tables - Predicates and 7 1, 2,7,9
Quantifiers- Valid Arguments - Direct and Indirect Proofs -
Mathematical Induction.
3 Graphs:
Basic Terminology of Graphs- Special Graphs- The Concept 1, 2,7,9
of Degree- Paths – Circuits-Connectedness - Euler and
Hamiltonian Circuits -Matrix Representations of Graphs - 7
Graph Isomorphism - Isomorphic Invariants- Shortest path
problem
4 Trees
Definition of Trees- Characterizing Trees - Rooted and 6 1, 2,7,9
Binary Trees and Their Properties - Spanning Tree -
Minimum Spanning Trees
5 Relations
Relations - Matrix and Digraph of a relation - Properties of 1, 2,7,9
Relations - Order Relations - Matrix and Digraph of a Partial 6
Order- Minimal and Maximal Elements - Relations on Finite
and Infinite Sequences.
6 Recurrence Equations and Series
Recurrence Equations - Solving First-Order Linear 5 1, 2,7,9
Recurrence Equations-Solving Second-Order Linear
Recurrence Equations - Infinite Series -Zeno’s Paradoxes
7 Defining New Structured Types
Simple Enumerated Types, More Elaborate Types , Self-
Referential Types, Parameterized Types -Reasoning About 5 1,2,7,9
New Types – Three -Valued Logic -Processing Data –Lists-
Binary Trees

8 Guest Lecture
Applications of Discrete Mathematical Structure in 2
Software Engineering

Total Lecture Hours 45

Tutorial A minimum of 5 problems to be worked out by students in 15 5,6,8
every Tutorial Class 13,15
Another 5 problems per Tutorial Class to be given as home 20
work.
TextBook
1. Mathematics of Discrete Structures for Computer Science by Gordan J.Pace, Springer-
Verlag, 2012.
2. Fundamentals of Discrete Math for Computer Science- A Problem-Solving Primer by Tom
Jenkyns and Ben Stephenson, Springer-Verlag, 2013.

Reference Books
1. Discrete Mathematics with Applications by Susanna S. Epp, Fourth Edition,
BROOKS/COLET, 2010.
2. Discrete Mathematical Structures with Applications to Computer Science by J .P. Trembley
and R. Manohar, Tata McGraw Hill – 35t h reprint, 2008.
3. Discrete Mathematics and its applications by Kenneth H. Rosen, 7th Edition, Tata McGraw
Hill, 2012.
4. Discrete Mathematical Structures by Kolman, R.C.Busby and S.C.Ross, 6th Edition, PHI,
2009.
5. Discrete Mathematics by Richard Johnsonbaugh, 7th Edition, Prentice Hall, 2009.
6. Discrete Mathematics by S. Lipschutz and M. Lipson, McGraw Hill Education (India) 2013.

Mode of Teaching:
Class room teaching
Introducing Units through applications
Min of 1 lecture by experts
Mode of Evaluation:
Digital Assignments (Solutions by using softskill), Continuous Assessment Test
Final Assessment Test
Compiled by: Dr. P.Pandian
Recommended by the Board of Studies: 9.3.2016