0% found this document useful (0 votes)
26 views

Updated - Discrete Mathematics and Graph Theory Syllabus

Uploaded by

shashwat verma
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
26 views

Updated - Discrete Mathematics and Graph Theory Syllabus

Uploaded by

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

Discrete mathematics & graph theory

Lecture Tutorial Practical Self Study Credit Subject Type


3 1 0 0 4.0 T

Course Type Course Category Mode of Assessment Mode of Delivery

Program Core Graded (GR) Theory Examination (ET) Theory (TH)

Course Objectives

Introduce the concepts of mathematical logic and gain knowledge in sets, relations and functions and Solve problems using
counting techniques and combinatorics and to introduce generating functions and recurrence relations. Use Graph Theory
for solving real world problems.

Course Outcomes

After completion of the course, students will be able to

CO1 Apply mathematical logic to solve problems


CO2 Understand the concepts and perform the operations related to sets, relations and functions.
CO3 Gain the conceptual background needed and identify structures of algebraic nature.
Co4 Apply basic counting techniques to solve combinatorial problems.
Co5 Apply Graph Theory in solving computer science problems

Unit 1 20 Hours
Chapter 1.1 Mathematical Logic Introduction, Statements and Notation, Connectives, Basic logical
operation, truth tables, Tautologies, Contradictions, Algebra of Proposition, logical
implications, logical Equivalence, Normal Forms, Functionally complete set of connectives

Chapter 1.2 Inference Theory of Statement Calculus, Predicate Calculus. Pigeon hole principle and its
application

Unit 2 20 Hours

Chapter 2.1 Basic Structure: Introduction to set theory, Set operations, Algebra of sets,
Combination of sets, Classes of sets Finite and Infinite sets, Cardinality of
sets, Power sets, Cartesian product, Principles of inclusion & exclusion.

Chapter 2.2 Relations and functions: Binary relations, types of relations, equivalence
relations and partitions, partial order relations, functions and its types,
composition of function and relations, inverse of relations and functions
Chapter 2.3 Algebraic structures: Definition, elementary properties of algebraic structures, semi
group, monoid ,group, subgroups, normal subgroups, homomorphism, isomorphism ,
automorphism , cyclic groups.

Unit 3 20 Hours
Chapter 3.1 Graph Theory : Introduction to graphs, directed and undirected graphs,
homomorphism and isomorphic graphs, sub graphs multi graphs and weighted
graphs, paths and circuits, , Eulerian paths and circuits, Hamiltonian path and circuits,
planer graphs, Euler's formula,
Chromatic numbers (Coloring problems). graph traversal, Basics of Counting,
Combinations and Permutations
Chapter 3.2 Trees: Trees and Rooted Trees, Spanning Trees, Directed Trees, prefix codes, tree
traversal. shortest path in weighted graphs

Chapter 3.3 Boolean algebra: Boolean expression, representation & minimization of Boolean
function

CO1 Apply mathematical logic to solve problems

CO2 •Understand the concepts and perform the operations related to sets, relations and functions.
CO3 •Gain the conceptual background needed and identify structures of algebraic nature.

Co4 •Apply basic counting techniques to solve combinatorial problems.


Co5 •Apply Graph Theory in solving computer science problems

Text Books

1.Joe L. Mott, Abraham Kandel and Theodore P. Baker, Discrete Mathematics for Computer Scientists &
Mathematicians, 2nd Edition, Pearson Education.

2.J.P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications to Computer Science, Tata
McGraw Hill, 2002.

3.C.L. Liu “Elements of Discrete Mathematics". McGraw Hill, 3rd Edition

Reference Books

1.Kenneth H. Rosen, Discrete Mathematics and its Applications with Combinatorics and Graph Theory, 7th Edition,
McGraw Hill Education (India) Private Limited.

2.Graph Theory with Applications to Engineering and Computer SciencebyNarsinghDeo.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy