Scribd
Upload
125 views2 pages

Hi

This document provides information about the Discrete Mathematics and Graph Theory course offered at the university. The course code is MAT1014 and it is a 3 credit course offered in the third semester. The course objectives are to address the relevance of lattice theory, coding theory, and algebraic structures to computer science problems. It also aims to use number theory and congruence theory for cryptography. The main topics covered are mathematical logic, predicate calculus, algebraic structures, lattices, Boolean algebra, fundamentals of graphs, trees, graph coloring, and contemporary issues. The course outcomes are for students to understand normal forms, proof techniques, group codes, graph algorithms, and solve engineering problems using graph theory.

Uploaded by

PRANAV KUMAR 17BEC0473
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
125 views2 pages

Hi

This document provides information about the Discrete Mathematics and Graph Theory course offered at the university. The course code is MAT1014 and it is a 3 credit course offered in the third semester. The course objectives are to address the relevance of lattice theory, coding theory, and algebraic structures to computer science problems. It also aims to use number theory and congruence theory for cryptography. The main topics covered are mathematical logic, predicate calculus, algebraic structures, lattices, Boolean algebra, fundamentals of graphs, trees, graph coloring, and contemporary issues. The course outcomes are for students to understand normal forms, proof techniques, group codes, graph algorithms, and solve engineering problems using graph theory.

Uploaded by

PRANAV KUMAR 17BEC0473
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Course Code Course Title L T P J C

MAT1014 Discrete Mathematics and Graph Theory 3 2 0 0 4


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

Course Outcome (CO):


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]. Having an ability to apply mathematics and science in engineering applications.
[2]. Having a clear understanding of the subject related concepts and of contemporary
issues.
[7]. Having computational thinking (Ability to translate vast data in to abstract concepts
and to understand database reasoning).

Module:1 Mathematical Logic and Statement 6 hours CO: 1


Calculus
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 CO: 2


The Predicate Calculus - Inference Theory of the Predicate Calculus.

Module:3 Algebraic Structures 5 hours CO: 3


Semigroups and Monoids - Groups – Subgroups – Lagrange’s Theorem Homomorphism –
Properties-Group Codes.

Module:4 Lattices 5 hours CO: 3


Partially Ordered Relations -Lattices as Posets – Hasse Digram – Properties of Lattices.

Module:5 Boolean algebra 5 hours CO: 3


Boolean algebra - Boolean Functions-Representation and Minimization of Boolean
Functions –Karnaugh map – McCluskey algorithm.
Module:6 Fundamentals of Graphs 6 hours CO: 4
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 CO: 5


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 CO: 5


Industry Expert Lecture

Total Lecture hours: 45 hours


Tutorial • A minimum of 10 problems to be worked 30 hours CO: 3,4,5
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, 8th Edition, Tata McGraw
Hill, 2019.
2. Discrete Mathematical Structures, Kolman, R.C.Busby and S.C.Ross, 6th Edition, PHI,
2018.
3. Discrete Mathematics, Richard Johnsonbaugh, 8th 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, 3rd Edition, Prentice-Hall, Englewood Cliffs,
NJ, 2015.
Mode of Evaluation
Digital Assignments, Quizzes, Continuous Assessment Tests (CATs) and Final Assessment
Test (FAT).
Recommended by Board of Studies 03-06-2019
Approved by Academic Council No.55 Date 13-06-2019

You might also like