Mat1014 Discrete-mathematics-And-graph-Theory TH 1.1 47 Mat1014

MAT1014 Course title L T P J C
Discrete Mathematics and Graph Theory 3 2 0 0 4

Pre-requisite None Syllabus Version
1.1
Course Objectives (CoB): 1,2,3
• To address the challenge of the relevance of lattice theory, coding theory and
algebraic structures to computer science and engineering problems.
• To use number theory, in particular congruence theory to cryptography and
computer science problems.
• To understand the concepts of graph theory and related algorithm concepts.
Expected Course Outcome (CO): 1,2,3,4,5

At the end of this course, students are expected to
1. form truth tables, proving results by truth tables, finding normal forms,
2. learn proof techniques and concepts of inference theory
3. understand the concepts of groups and application of group codes, use Boolean
algebra for minimizing Boolean expressions.
4. learn basic concepts of graph theory, shortest path algorithms, concepts of trees and
minimum spanning tree and graph colouring, chromatic number of a graph.
5. Solve Science and Engineering problems using Graph theory.
Student Learning Outcomes (SLO): 1, 2, 7
Module:1 Mathematical Logic and Statement Calculus 6 hours

Introduction-Statements and Notation-Connectives–Tautologies–Two State Devices and
Statement logic -Equivalence - Implications–Normal forms - The Theory of Inference for the
Statement Calculus.
Module:2 Predicate Calculus 4 hours

The Predicate Calculus - Inference Theory of the Predicate Calculus.
Module:3 Algebraic Structures 5 hours

Semigroups and Monoids - Groups – Subgroups – Lagrange’s Theorem Homomorphism –
Properties-Group Codes.
Module:4 Lattices 5 hours

Partially Ordered Relations -Lattices as Posets – Hasse Digram – Properties of Lattices.
Module:5 Boolean algebra 5 hours

Boolean algebra - Boolean Functions-Representation and Minimization of Boolean
Functions –Karnaugh map – McCluskey algorithm.
Module:6 Fundamentals of Graphs 6 hours

Basic Concepts of Graph Theory – Planar and Complete graph - Matrix representation of
Graphs – Graph Isomorphism – Connectivity–Cut sets-Euler and Hamilton Paths–Shortest
Path algorithms.
Module:7 Trees, Fundamental circuits , Cut sets, 12 hours

Graph colouring, covering, Partitioning
Trees – properties of trees – distance and centres in tree –Spanning trees – Spanning tree
algorithms- Tree traversals- Fundamental circuits and cut-sets. Bipartite graphs - Chromatic
number – Chromatic partitioning – Chromatic polynomial - matching – Covering– Four
Colour problem.
Module:8 Contemporary Issues 2 hours

Industry Expert Lecture
Total Lecture hours: 45 hours

Tutorial • A minimum of 10 problems to be 30 hours
worked out by students in every
Tutorial class.
• Another 5 problems per Tutorial Class
to be given as home work.
Mode: Individual Exercises, Team Exercises,
Online Quizzes, Online, Discussion Forums
Text Book(s)
1. Discrete Mathematical Structures with Applications to Computer Science, J .P.
Trembley and R. Manohar, Tata McGraw Hill-35th reprint, 2017.
2. Graph theory with application to Engineering and Computer Science, Narasing
Deo, Prentice Hall India 2016.
Reference Books
1. Discrete Mathematics and its applications, Kenneth H. Rosen, 8 th Edition, Tata McGraw
Hill, 2019.
2. Discrete Mathematical Structures, Kolman, R.C.Busby and S.C.Ross, 6 th Edition, PHI, 2018.
3. Discrete Mathematics, Richard Johnsonbaugh, 8 th Edition, Prentice Hall, 2017.
4. Discrete Mathematics, S. Lipschutz and M. Lipson, McGraw Hill Education (India) 2017.
5. Elements of Discrete Mathematics–A Computer Oriented Approach, C.L.Liu, Tata McGraw
Hill, Special Indian Edition, 2017.
6.Introduction to Graph Theory, D. B. West, 3 rd Edition, Prentice-Hall, Englewood Cliffs, NJ,
2015.
Mode of Evaluation
Digital Assignments, Quiz, Continuous Assessments, Final Assessment Test
Recommended by Board of Studies
Approved by Academic Council No. 47 Date 05-10-2017

Mat1014 Discrete-mathematics-And-graph-Theory TH 1.1 47 Mat1014

Uploaded by

Copyright:

Available Formats

Mat1014 Discrete-mathematics-And-graph-Theory TH 1.1 47 Mat1014

Uploaded by

Document Information

Original Title

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

Mat1014 Discrete-mathematics-And-graph-Theory TH 1.1 47 Mat1014

Uploaded by

Copyright:

Available Formats

MAT1014 Course title L T P J C

Discrete Mathematics and Graph Theory 3 2 0 0 4

Expected Course Outcome (CO): 1,2,3,4,5

Student Learning Outcomes (SLO): 1, 2, 7

Module:1 Mathematical Logic and Statement Calculus 6 hours

Module:2 Predicate Calculus 4 hours

Module:3 Algebraic Structures 5 hours

Module:4 Lattices 5 hours

Module:5 Boolean algebra 5 hours

Module:6 Fundamentals of Graphs 6 hours

Module:7 Trees, Fundamental circuits , Cut sets, 12 hours

Module:8 Contemporary Issues 2 hours

Total Lecture hours: 45 hours

You might also like