Annexure ‘CD – 01’

Course Name: Discrete Mathematics for IT

Course Level: UG
L T P/S SW/FW
Course Type: TOTAL CREDIT UNITS
3 - - 2 4
Course Code:
CSIT206

Credit Units: 04

Course Objective:
The Objective of this course is to
• provide the fundamentals and the concepts of Discrete Mathematical Structures with Applications to Computer Sciences and information technology
including Mathematical Logic, Relations and Functions, Graphs and Trees. Important theorems with constructive proofs, real life problems & graph theoretic
algorithms.
• help the students to understand the computational and algorithmic aspects of Relations, Mathematical Logic, Functions, Graphs, Trees and Algebraic Structure in
the field of Information technology and its applications.

Pre-requisites:
Basic knowledge of Mathematics

Course Curriculum Outcomes(CLO):

After completion of the course, the student will be able to:
• Demonstrate knowledge of how Relations and function are defined.
• Analyse Algebraic Structure.
• Describe Possets and their use.
• Apply Graph theory and trees in Computer Science.
Formulate concepts of propositional logic

• Course Contents/Syllabus:

Weightage (%)

Module I: Mathematical Logic

Proposition, Propositional Calculus- Propositional Variables and Compound Propositions, Basic
Logical Operations: Conjunction, Disjunction, Negation, Conditional, Bi conditional. Compound Statements,
Equivalence, Duality, Algebra of Statements, Valid and Invalid, Arguments, Tautologies, Contradiction, Contingency. 20

Module II: Relations and Functions

Properties of Binary Relations, Closure of relations, Warshall’s algorithm, Equivalence relations and partitions,

20
Partial ordering relations. Functions, Composition of functions, Invertible functions, Pigeonhole Principle, Discrete
nume functions and Generating functions. Recurrence relation, Linear Recurrence Relations with constant Coefficients.
ric

25
Module III: Graph Theory: Basic terminology, representation of a graph in computer memory, multi-graphs and
weighted graphs, Subgraphs, Isomorphic graphs, Complete, regular and bipartite graphs, operations on graph, paths and
c Hamiltonian and Euler paths and circuits, shortest path in weighted graphs (Dijkstra’s algorithm), factors of a graph,
plan ircuits, ar
graph and Traveling salesman problem, Graph Coloring. ,
Module IV: Trees:
Basic terminology and characterization of trees, Prefix codes and optimal prefix codes, binary search trees, Tree traversal 25
Spanning trees, Fundamental Trees and cut sets, Minimal Spanning trees, Kruskal’s and Prim’s algorithms for minimal
spanning trees, The Max flow Min Cut Theorem (Transport network).

Module V: Algebraic Structure

10
Algebraic structure with one binary operation, semi groups, monoid and groups, isomorphism, homomorphism, cyclic
group.
Pedagogy for Course Delivery:
The session will be taught in theory and self-work based, mode. The instructor will discuss numerical computation problems to the students for better
understanding of the concept through e content, will be given quizzes and assignments.

Assessment/ Examination Scheme:

Theory L/T/SW (%) Lab/Practical/Studio (%) TOTAL

100 - 100

Theory Assessment (L&T):

Continuous Assessment/Internal Assessment End Term
Examination
Components (Drop
down) Mid-Term Exam Assignment Presentation/Viva Attendance EE
 20

Weightage (%) 10 5 5 60

List of Self Work

1. i)The truth-table test is based on what elementary fact about validity?

ii) What is the short method of argument evaluation?

iii) What is the symbolization for the statement “It is not the case that either Alice walks home or Jan walks home”?

iv)How is a hypothetical syllogism expressed in symbolic form?

2. Determine whether each of the following relations are reflexive, symmetric and transitive: (i)Relation R in the set A = {1, 2, 3…13, 14} defined as R = {(x, y): 3x
− y = 0} (ii) Relation R in the set N of natural numbers defined as R = {(x, y): y = x + 5 and x < 4} (iii) Relation R in the set A = {1, 2, 3, 4, 5, 6} as R = {(x, y): y
is divisible by x} (iv) Relation R in the set Z of all integers defined as R = {(x, y): x − y is as integer} (v) Relation R in the set A of human beings in a town at a
particular time given by (a) R = {(x, y): x and y work at the same place} (b) R = {(x, y): x and y live in the same locality} (c) R = {(x, y): x is exactly 7 cm taller
than y} (d) R = {(x, y): x is wife of y} (e) R = {(x, y): x is father of y}

3. Can a simple graph have 5 vertices and 12 edges? If so, draw it; if not, explain why it is not possible to have such a graph.
4 Suppose that in a group of 5 people: A, B, C, D, and E, the following pairs of people are acquainted with each other. A and C A and D B and C C and D
C and E a) Draw a graph G to represent this situation. b) List the vertex set, and the edge set, using set notation. In other words, show sets V and E for the vertices
and edges, respectively, in G = {V, E}. c) Draw an adjacency matrix for G.
5. Given a graph for a tree (with no designated root), briefly describe how a root can be chosen so that the tree has maximum height. Similarly, describe how a root
can be chosen so that the tree has minimum height. (Note that path length is described as the number of edges that need to be traversed between two vertices.)
6. A binary structure (G, *) is a group when ?
Text Books:
C. L. Liu and D. P. Mohapatra, “Elements of Discrete Mathematics”, SiE Edition, TataMcGraw-Hill, 2008, ISBN 10:0-07-066913-9
R. Johnsonbaugh, “Discrete Mathematics”, 5th Edition, Pearson Education, 2001 ISBN 81 – 7808 – 279 - 9

Reference Books:
N. Biggs, “Discrete Mathematics”, 3rd Edition, Oxford University Press, ISBN 0 –19 –850717 – 8
Harikishan, Shivraj Pundir and Sandeep Kumar, Discrete Mathematics, Pragati Publication, 7th Edition, 2010.
Colmun, Busby and Ross, Discrete Mathematical Structure, PHI, 6th Edition, 2009.
Kenneth H. Rosen, “Discrete Mathematics and its Applications”, 6th edition, McGraw-Hill, 2007. ISBN 978-0-07-288008-3
E. Goodaire and M. Parmenter, “Discrete Mathematics with Graph Theory”, 2nd edition, Pearson Education, 2003 ISBN 81 – 7808 – 827 – 4
Semyour Lipschutz & Marc Lipson, “ Discrete Mathematics”, McGraw-Hill, 3rd Special Indian Edition, ISBN-13 : 978-0-07-060174-1
B. Kolman, R. Busby and S. Ross, “Discrete Mathematical Structures”, 4th Edition, Pearson Education, 2002, ISBN 81-7808-556-9
N. Deo, “Graph Theory with application to Engineering and Computer Science”, Prentice Hall of India, 1990, 0 – 87692 – 145 – 4