Scribd
Upload
149 views

CC301B - Discrete Mathematics

This document provides information about the Mathematics III: Discrete Mathematics course for Semester III. It includes details about the teaching scheme with 3 hours per week of lectures and 2 hours per week of tutorials for a total of 5 credits and 75 contact hours. The course is divided into 6 units covering topics like sets, relations, lattices, Boolean algebra, group theory, graph theory, and finite automata. Evaluation includes a theory exam worth 70 marks, mid-semester exam worth 30 marks, and continuous internal assessment worth 20 marks for a total of 120 marks. Textbooks and reference books are also listed.

Uploaded by

praveen
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
149 views

CC301B - Discrete Mathematics

This document provides information about the Mathematics III: Discrete Mathematics course for Semester III. It includes details about the teaching scheme with 3 hours per week of lectures and 2 hours per week of tutorials for a total of 5 credits and 75 contact hours. The course is divided into 6 units covering topics like sets, relations, lattices, Boolean algebra, group theory, graph theory, and finite automata. Evaluation includes a theory exam worth 70 marks, mid-semester exam worth 30 marks, and continuous internal assessment worth 20 marks for a total of 120 marks. Textbooks and reference books are also listed.

Uploaded by

praveen
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

MATHEMATICS III :

DISCRETE MATHEMATICS
Semester III
SUBJECT CODE: CC 301 B

Teaching Scheme (Credits and Hours)

Teaching scheme Total Evaluation Scheme


L T P Total Credit Theory Mid Sem CIA Pract. Total
Exam
Hrs Hrs Hrs Hrs Hrs Marks Marks Marks Marks Marks
03 02 00 05 05 03 70 30 20 00 120

Total hours (Theory): 45


Total hours (Tutorial): 30
Total hours: 75
Detailed Syllabus
Unit Topics Lectures Weight
No (Hours) age
1 Introduction and Pre-requisites:Set, Relation & Function : 4 5%
Set-representation of a set, Operation on sets, Cartesian product,
De’ morgan ‘s law. Relation-Type of relation, composition and
inverse of relation, Partial order relation Equivalence relation,
Matrix and graph representation of a relation. Function-
Classification of functions, Composition and inverse functions,
Binary and n-ary function
2 Lattice theory :Partially ordered sets,Hasse Diagrams, Lattices 8 15%
as poset, properties of lattices, Lattices as algebraic systems,
sublattices, direct product and homomorphism, complete
lattices, bounds of lattices, distributivelattice, complemented
lattices.
3 Boolean Algebra and its Applications:Introduction, definition 9 25%
and important properties of Boolean Algebra, Sub
Booleanalgebra, direct product and homomorphism, join-
irreducible, meet-irreducible, atoms, anti atoms, Stone’s
representation theorem. (Without Proof), Boolean expressions
and their equivalence, Minterms and Maxterms, Sum of
minterms (SoP), Product of Maxterms (PoS), Values of
Boolean expression, canonical forms, Boolean functions,
representation of Boolean function, Karnaugh maps,
minimization of Boolean function, Quine Mccluskey
algorithm
4 Group Theory : Definition and examples of groups, 8 15%
abelian group, cyclic groups,permutation groups, subgroups
& Homomorphism, Cosets and Lagrange’s Theorem (without
proof), Normal subgroups, Quotient Groups.
5 Graph Theory: Basic concepts of Graph theory, definition of 9 25%
diagraph and undirected graph, sub graph, converse of diagraph,
isomorphism of graphs, walk, paths and circuits, reachability and
connectedness in diagraph, matrix representation of graph, trees.
Graph algorithms- Dijkstra shortest path algorithm, Breadth-first
search spanning tree algorithm, prim’s algorithm for minimal
spanning tree Networks and flow, maximal flow algorithm.
6 Finite Automata and formal languages: Finite Automata and 7 15%
regular languages, Finite state machines with input and output,
Grammars and languages.
Total 45 100%
Text Books:

1. “Discrete Mathematical Structures with Applications to Computer Science”, J. P.

Tremblay and R.Manohar ,Tata McGraw-Hill.

2. “Discrete Mathematical Structure”, D. S. Malik, M. K. Sen, Cengage Learning.

3.“Elements of Discrete Mathematics ”, C L Liu, D P Mohapatra, Tata McGraw-Hill.

Reference Books:

1. “Discrete Mathematics and its applications”, 6th edition, K. H. Rosen. Tata


McGraw-Hill

2. “Discrete Mathematical Structure”, Bernard Kolmann& others,

Sixth Edition ,Pearson Education.

3. “ Discrete Mathematics with Graph Theory”, Edgar G. Goodaire, Michael M.

Parmenter. PHI,

4. “Logic and Discrete Mathematics”, , J. P. Tremblay and W. K.

Grassman, Pearson Education.


List of Tutorials
Sr. Tutorial Content
No.
1 Problem solving on “Introduction and Pre-requisites:Set, Relation &
Function”.
2 Problem solving on “Lattice theory”

3 Assignment on “Boolean Algebraand its Applications”.


4 Assignment on “Group Theory”.

5 Problem solving on “Graph Theory”

6 Assignment on “Finite Automata and formal languages”.

You might also like