MAT1016

Course Code: MAT1016 Course Title: Discrete Mathematics TPC 3 0 3
Version No. 1.0

Course Pre-requisites/ None
Co-requisites
MAT1003, MAT1007
Anti-requisites (if any).
1. To understand the notion of mathematical thinking and mathematical proofs, and
to apply them in problem solving used in Computer algorithm and systems.
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.
Objectives:
4. To address the challenges of the relevance of lattice theory, coding theory 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.
CO's Mapping with PO's

Course Program
Course Outcome Statement
Outcomes Outcomes
Produce convincing arguments, conceive and/or analyze basic mathematical
CO1 PO1, PO2
proofs and discriminate between valid and unreliable arguments.
Apply the knowledge and skills obtained to investigate and solve a variety of
CO2 PO1, PO2
discrete mathematical problems.
CO3 Understand the basics of sets, relations, algebraic structures PO1, PO2
CO4 Calculate numbers of possible outcomes of elementary combinatorial processes. PO1, PO4
Understand some basic properties of graphs and related discrete structures and be
CO5 PO1, PO3, PO4
able to relate these to practical examples.
Demonstrate different traversal methods for trees and graphs for solving model PO1, PO2, PO3,
CO6
problems in Computer Science PO4, PO5
Total hours of
Instruction: 45
Hours
Module No. 1 Logic 11 Hours
Propositional calculus - propositions and connectives, syntax; Semantics - truth assignments and truth tables,
validity and satisfiability, tautology; Adequate set of connectives; Equivalence and normal forms;
Compactness and resolution; Formal reducibility - natural deduction system and axiom system; Soundness and
completeness.
Boolean algebra
Module No. 2 8 Hours
Introduction of Boolean algebra, truth table, basic logic gate, basic postulates of Boolean algebra, principle of
duality, canonical form, Karnaugh map.
Module No. 3 Abstract algebra 8 Hours
Page 1 of 3
Set, Relations, Groups, Rings, Fields.
Module No. 4 Combinatorics 6 Hours
Basic counting, balls and bins problems, generating functions, recurrence relations. Proof techniques, principle
of mathematical induction, pigeonhole principle.
Graph Theory
Module No. 5 12 Hours
Graphs and digraphs, complement, isomorphism, connectedness and reachability, adjacency matrix, Eulerian
paths and circuits in graphs and digraphs, Hamiltonian paths and circuits in graphs and tournaments, trees;
Planar graphs, Euler’s formula, dual of a planer graph, independence number and clique number, Chromatic
number, statement of Four-color theorem.
Text Book
1. C. L. Liu, D. P. Mahapatra (2012), Elements of Discrete Mathematics–A Computer Oriented
Approach, McGraw Hill Education (India), 4th edition.
2. M. Morris Mano (2016), Digital Logic & Computer Design, Pearson.
References
1. Introduction to Mathematical Logic, (Second Edition), E. Mendelsohn, Van-Nostrand, London.
2. J. A. Bondy and U. S. R. Murty 1976), Graph Theory with Applications, Macmillan Press, London.
3. L. Zhongwan (1998), Mathematical Logic for Computer Science, World Scientific, Singapore.
4. I. N. Herstein (2006), Topics in Algebra, John Wiley and Sons.
5. Kenneth H. Rosen (2012), Discrete Mathematics and its applications, McGraw Hill Education (India),
7th edition.
6. R. A. Brualdi (2010), Introductory Combinatorics, North-Holland, New York.
7. J. P. Trembley and R. Manohar (2017), Discrete Mathematical Structures with Applications to Computer
Science, Tata McGraw Hill.
8. Kolman, R.C. Busby and S. C. Ross (2018), Discrete Mathematical Structures, 6th Edition, Prentice Hall India.
9. 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 (Module 1)
2. Algorithms design and analysis, Complexity theory, Fibonacci Numbers, The Tower of Hanoi, Reve’s puzzle,
Codeword Enumeration. (Module 2)
3. Relational databases. (Module 2)
4. 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. (Module 3, Module 4)
5. Digital Circuits. (Module 4, Module 5)
6. Social Networks, Delivery Route Problems, Job Scheduling, Railway Planning, Google Maps, Locating
Terrorist gangs and Insurgencies, DNA sequencing. (Module 3, Module 4, Module 5)
Mode of Evaluation Continuous Assessment (Quizzes, CATs, Assignments etc.).
CAT-1 Weightage (in %) 20

CAT-2 Weightage (in %) 20
FAT Weightage (in %) 20
Assignment/Mini Weightage (in %) 40
Project
Total 100
Page 2 of 3
Prepared by Dr Venkat Rajam marka, Dr Santanu Mandal
Recommended by the
Board of Studies on 20th June 2021
Date of Approval by 6th AC (22.06.2021)

the Academic Council
Page 3 of 3

MAT1016

Uploaded by

Copyright:

Available Formats

MAT1016

Uploaded by

Document Information

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

MAT1016

Uploaded by

Copyright:

Available Formats

Course Code: MAT1016 Course Title: Discrete Mathematics TPC 3 0 3

Version No. 1.0

CO's Mapping with PO's

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

CAT-1 Weightage (in %) 20

Date of Approval by 6th AC (22.06.2021)

You might also like