Scribd
Upload
18 views1 page

R2024 - UBA04 - Discrete Mathematics Syllabus

The document outlines a course in Discrete Mathematics, detailing its objectives and outcomes, which include foundational knowledge in propositional and predicate calculus, set theory, graph theory, and Boolean algebra. It specifies the topics covered in each unit, such as logical connectives, relations, graphs, and lattices. Additionally, it provides a list of textbooks and references for further study.

Uploaded by

karthikmondigantla
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
18 views1 page

R2024 - UBA04 - Discrete Mathematics Syllabus

The document outlines a course in Discrete Mathematics, detailing its objectives and outcomes, which include foundational knowledge in propositional and predicate calculus, set theory, graph theory, and Boolean algebra. It specifies the topics covered in each unit, such as logical connectives, relations, graphs, and lattices. Additionally, it provides a list of textbooks and references for further study.

Uploaded by

karthikmondigantla
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/ 1

UBA04 Discrete Mathematics 3 1 0 4

Prerequisite Nil
On successful completion of the course, the student will be able to
 build strong foundation on propositional calculus.
Course  learn the rules in predicate calculus.
Objectives  develop basic knowledge in relation and set theory.
 know the core ideas in graph theory..
 impart knowledge on lattices and Boolean algebra.
On successful completion of the course, the student will be able to:
 construct mathematical arguments using logical connectives.
 verify the correctness of an argument using predicate logic.
Course
 demonstrate the ability to solve problems using sets and relations.
Outcomes
 use graphs and trees as tools to visualize and simplify situations.
 perform operations on discrete structures in Boolean expressions.
 identify and solve applied engineering problems pertaining to discrete structures.
UNIT I Propositional Calculus 9
Propositions – Logical Connectives – Compound Propositions – Conditional and Biconditional Propositions
– Truth Tables – Tautologies and Contradictions – Contrapositive – Logical Equivalences and Implications
– Demorgan’s Laws - Normal Forms – Principal Conjunctive and Disjunctive Normal Forms – Rules of
Inference – Arguments - Validity of Arguments.
UNIT II Predicate Calculus 9
Predicates – Statement Function – Variables – Free and Bound Variables – Quantifiers Universe of Discourse
– Logical Equivalences and Implications for Quantified Statements – Theory of Inference – The Rules of
Universal Specification and Generalization – Validity of Arguments
UNIT III Set Theory 9
Basic Concepts – Notations – Subset – Algebra of Sets – Power Set – Ordered Pairs and Cartesian Product –
Relations on Sets –Types of Relations and Properties – Relational Matrix and Graph of a Relation – Partitions
– Equivalence Relations.
UNIT IV Graph Theory 9
Graphs and Graph Models: Graph Terminology and Special Types of Graphs - Representing Graphs and
Graph Isomorphism – Connectivity - Euler and Hamilton Path.
UNIT V Lattices and Boolean Algebra 9
Partial Ordering – Poset – Hasse Diagram – Lattices and its Properties – Lattices as Algebraic Systems –Sub
Lattices –Direct Product and Homomorphism - Some Special Lattices - Boolean Algebra.
Text Books
1. Trembly J.P and Manohar R, Discrete Mathematical Structures with Applications to Computer Science,
Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 2003.
2. Ralph. P. Grimaldi, Discrete and Combinatorial Mathematics: An Applied Introduction, Fourth Edition,
Pearson Education Asia, Delhi, 2002.
3. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, Discrete Mathematical Structures, Fourth Indian
reprint, Pearson Education Pvt Ltd., New Delhi, 2003.
References
1. Narsingh Deo, Graph Theory: With Application to Engineering and Computer Science, Prentice Hall of
India, 2003.
2. Thomas Koshy, Discrete Mathematics with Applications, Elsevier publications, 2006.
3. Seymour Lipschutz and Mark Lipson, Discrete Mathematics, Schaum’s Outlines, Tata McGraw-Hill Pub.
Co. Ltd., New Delhi, Second edition, 2007.

You might also like