Course Code: MAT1003 Course Title: Discrete Mathematical Structures TPC 3 0 3

Version No. 1.0

Course Pre-requisites/
Co-requisites/ anti-
requisites (if any).
Objectives:
At the end of this course the students will be able to
Expected Outcome:
Review of Basic Structures: sets, functions
Module No. 1 Foundations: Logic and Proofs
1. to understand the notion of mathematical thinking and mathematical proofs, and to
apply them in problem solving
2. to prove and disprove mathematical statements using a variety of techniques
3. to learn number theory, modular arithmetic in particular and appreciate its role in
cryptography and computer science in general
4. to address the challenges of the relevance of lattice theory, coding theory and other
algebraic structures in computer science and engineering
5. to understand the concepts of graph theory and related concepts of algorithms
6. to perform scientific communication in the language of mathematics precisely
without any ambiguity.
1. produce convincing arguments, conceive and/or analyze basic mathematical
proofs and discriminate between valid and unreliable arguments
2. apply the knowledge and skills obtained to investigate and solve a variety of
discrete mathematical problems
3. understand the basics of number theory, and be able to compute with modular
arithmetic and understand its use in cryptography
4. effectively use algebraic techniques to analyze basic discrete structures
5. calculate numbers of possible outcomes of elementary combinatorial processes
6. demonstrate an understanding of relations and functions and determine their
properties
7. understand some basic properties of graphs and related discrete structures, and be
able to relate these to practical examples
8. demonstrate different traversal methods for trees and graphs for solving model
problems in Computer Science.
9

Introduction to (Propositional) Logic, Propositional Logic and Equivalences, Predicates and Quantifiers, Nested
Quantifiers, Rules of Inference, Introduction to Proofs, Normal Proofs, Proof Methods and Strategies

Number Theory
Module No. 2 6

Divisibility and modular arithmetic, Integer representations, Primes and the greatest common divisor, Congruences
Introductory Counting
Module No. 3 5
Elementary combinatorics, counting techniques - Introduction to recurrence relations and generating functions

Algebraic Structures 5
Module No. 4

Groups and Subgroups, Cosets and Lagrange’s Theorem, Homomorphism, Rings and Fields –Properties
Module No. 5 Relations and Boolean algebra 8

Relations: Relations, Partially Ordered Relations -Lattices as Posets – Hasse Diagram – Properties of Lattices.
Boolean algebra: Boolean Functions-Representation and Minimization of Boolean Functions –Karnaugh map –
McCluskey algorithm.

Graphs:
Module No. 6 7
Graphs and Graph Models, Graph Terminology and Special Types of Graphs, Representing Graphs and Graph
Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest-Path Problems, Planar Graphs, Graph Colouring.

Module No. 7 Trees: 5

Introduction to Trees, Applications of Trees, Tree Traversal, Spanning Trees, Minimum Spanning Trees.
Text Book
1. Kenneth H. Rosen (2012), Discrete Mathematics and its applications, McGraw Hill Education (India),7 th
edition.

References
1. J. P. Trembley and R. Manohar (2017), Discrete Mathematical Structures with Applications to Computer
Science, Tata McGraw Hill.
2. Kolman, R.C. Busby and S. C. Ross (2018), Discrete Mathematical Structures, 6 th Edition, Prentice Hall India.
3. Richard Johnsonbaugh (2017), Discrete Mathematics, 7th Edition, Prentice Hall.
4. S. Lipschutz and M. Lipson, Varsha H. Patil (2013), Discrete Mathematics, McGraw Hill Education (India) 3 rd
edition.
5. C. L. Liu, D. P. Mahapatra (2012), Elements of Discrete Mathematics–A Computer Oriented Approach,
McGraw Hill Education (India), 4th edition.
6. Douglas (2018), Introduction to Graph Theory. B. West, 2 nd Edition, Pearson.
7. Narasing Deo (2010), Graph theory with application to Engineering and Computer Science, Prentice Hall India.
Related Applications
1. Verification of computer programs, Consistency of system specifications, Computer architecture design, Artificial
Intelligence, Automated Proofs, Control theory
2. Hashing Functions, Pseudorandom Numbers, Check Digits, Classical Cryptography, Introduction to Public-key
Cryptography: RSA Cryptosystem, Diffie-Hellman Key Exchange
3. Algorithms design and analysis, Complexity theory, Fibonacci Numbers, The Tower of Hanoi, Reve’s puzzle,
Codeword Enumeration
4. Error-correcting codes, Digital Communications and Storage, Formal languages
5. Relational databases
6. Distributed computing (vector clocks, global predicate detection), concurrency theory, programming language
semantics, and data mining, integer programming problems, diophantine approximation, cryptanalysis, the design
of error correcting codes for multi antenna systems, post-quantum cryptography
7. Digital Circuits
8. Social Networks, Delivery Route Problems, Job Scheduling, Railway Planning, Google Maps, Locating Terrorist
gangs and Insurgencies

Mode of Evaluation Continuous Assessment (Quizzes, CATs, Assignments etc.).

CAT-1 Weightage (in %) 20
CAT-2 Weightage (in %) 20
CAT-3 Weightage (in %) 20
Assignment Weightage (in %) 10
Quiz-1 Weightage (in %) 10
 Quiz-2 Weightage (in %) 10
Quiz-3 Weightage (in %) 10
Total 100

Recommended by the
th
Board of Studies on 6 January 2018

Date of Approval by
the Academic
Council