Module Code and Title : MAT110 Discrete Mathematics

Programme : B.E. (Information Technology)

Credit : 12
Module Tutor : S.T.Venkatesan
Module Coordinator :

General objectives or aims of the module:

Introduce the mathematical concepts that form the basis of computer science,
including Boolean logic, sets and relations, proofs, number theory, permutations and
combinations, and graph theory.
Demonstrate how these concepts are applied to areas of computer science,
including program specification and validation, encryption, generating functions,
databases, and networking.
To extend students mathematical maturity and ability to deal with abstraction and
to introduce most of the basic terminologies used in information technology courses and
application of ideas to solve practical problems.
Learning outcomes:
On completion of the module, learners will be able to:

1. Recognize precision in logical argument and perform operations on sets, functions,

relations, prepositional and predicate logic, and matrices using the appropriate
terminology.
2. Develop and apply mathematical reasoning in constructing valid arguments.
3. Use the language, notation, and methods of set theory and symbolic logic.
4. Demonstrate the utilization of combinations, permutations, and other principles of
counting in the field.
5. Effectively use formal logic proofs and logical reasoning to solve problems.
6. Model problems in computer science using graphs and trees.
7. Relate and apply these concepts to practical applications of computer science.
Learning and teaching approach used:
Approach Hours per week Total credit hours

Lecture 4 60

Tutorial 1 15

Written assignment 1 15

Independent study /
2 30
self-directed learning
Total 120

Assessment approach:
 Marks
Mode of Assessment Nos. Marks (%)
Allocated
Continuous Assessment (Theory)

Term Test1: Closed Book, One hour duration in 5th week

1 10
Topic: Logics

Term Test 2: Closed Book, One hour duration in 10th week 30

1 10
Topic: Counting and Proofs

Assignment: One in 7th week from Sets and Induction; and

2 10
one in 13th week from Graphs
Semester End Examination: Closed book, 3 hrs duration 1 70 70

Note: Students must obtain 40% each in the Continuous assessment of theory, and the
semester end examination. The overall pass mark for the module is 50%.

Pre-requisite: None

Subject Matter:

Unit I: Propositional logic:

1.1 Syntax
1.2 Semantics
1.3 Valid, Satisfiable and Unsatisfiable formulas
1.4 Encoding and Examining the validity of some logical arguments.

Unit II: Proof techniques:

2.1 Forward proof
2.2 Proof by contradiction
2.3 Contra-positive proofs
2.4 Proof of necessity and sufficiency.

Unit III: Sets, relations and functions:

3.1 Operations on sets
3.2 Relations
3.3 Functions
3.4 Binary relations
3.5 Partial ordering relations
3.6 Equivalence relations
3.7 Principles of mathematical induction.
3.8 Size of a set
3.9 Finite and infinite sets
3.10 Countable and uncountable sets
3.11 Cantor's diagonal argument and the power set theorem
3.12 Schroeder-Bernstein theorem.

Unit IV: Introduction to counting:

4.1 Basic counting techniques inclusion and exclusion
4.2 Pigeon-hole principle
4.3 Permutation
4.4 Combination
4.5 Summations.
4.6 Recurrence relation
4.7 Generating function.

Unit V: Algebraic structures and morphisms:

5.1 Algebraic structures with one binary operation
5.1.1 Semigroups
5.1.2 Monoids and
5.1.3 Groups
5.2 Congruence relation
5.3 Quotient structures.
5.4 Free and cyclic monoids and groups
5.5 Permutation groups and substructures
5.6 Normal subgroups.
5.7 Algebraic structures with two binary operations
5.7.1 Rings
5.7.2 Integral domains and
5.7.3 Fields.
5.8 Boolean algebra and Boolean ring.

Unit VI: Introduction to graphs:

6.1 Graphs and their basic properties
6.1.1 Degree
6.1.2 Path
6.1.3 Cycle
6.2 Subgraphs
6.3 Isomorphism
6.4 Eulerian and Hamiltonian walks
6.5 Graph coloring
6.6 Planar graphs
6.7 Trees.

Reading list:

Essential Reading List:

1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata
McGraw-Hill.
2. C. L. Liu, Elements of Discrete Mathematics, Tata McGraw-Hill.
3. Norman L. Biggs, Discrete Mathematics, Oxford University Press.

Additional Reading List:

1. Kenneth Bogart, Clifford Stein and Robert L. Drysdale, Discrete Mathematics for
Computer Science, Key College Publishing.
2. Thomas Koshy, Discrete Mathematics with Applications, Elsevier.
3. Ralph P. Grimaldi, Discrete and Combinatorial Mathematics, Pearson
Education, Asia.
Date: 2nd March 2017.