Scribd
Upload
70 views

Discrete Mathematics Syllabus

Uploaded by

Velama Anusha
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
70 views

Discrete Mathematics Syllabus

Uploaded by

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

PCC 101 DISCRETE MATHEMATICS

Instruction 4 Periods per week


Duration of University Examination 3 Hours
University Examination 70 Marks
Sessional 30 Marks
Credits 4

Course Objectives:
1. Use mathematically correct terminology and notation.
2. Construct correct direct and indirect proofs.
3. Use division into cases in a proof.
4. Use counterexamples.
5. Apply logical reasoning to solve a variety of problems

Course Outcomes:
1. For a given logic sentence express it in terms of predicates, quantifiers, and logicalconnectives
2. For a given a problem, derive the solution using deductive logic and prove the solutionbased on
logical inference
3. For a given a mathematical problem, classify its algebraic structure

4. Evaluate Boolean functions and simplify expressions using the properties of Booleanalgebra
5. Develop the given problem as graph networks and solve with techniques of graphtheory.

UNIT -I

Sets, Relation and Function: Operations and Laws of Sets, Cartesian Products, Binary Relation,
Partial Ordering Relation, Equivalence Relation, Image of a Set, Sum and Product of Functions,
Bijective functions, Inverse and Composite Function, Size of a Set, Finite and infinite Sets,
Countable and uncountable Sets, Cantor's diagonal argument and The Power Set theorem,
Schroeder-Bernstein theorem.
Principles of Mathematical Induction: The Well-Ordering Principle, Recursive definition, The
Division algorithm: Prime Numbers, The Greatest Common Divisor: Euclidean Algorithm, The
Fundamental Theorem of Arithmetic.

8
UNIT-II
Basic counting techniques-inclusion and exclusion, pigeon-hole principle,
permutationand combination.

UNIT-III
Propositional Logic: Syntax, Semantics, Validity and Satisfiability, Basic
Connectives and Truth Tables, Logical Equivalence: The Laws of Logic, Logical
Implication, Rules of Inference, The use of Quantifiers. Proof Techniques: Some
Terminology, Proof Methods and Strategies, Forward Proof, Proof by Contradiction,
Proof by Contraposition,Proof of Necessity and Sufficiency.

UNIT-IV
Algebraic Structures and Morphism: Algebraic Structures with one Binary
Operation, Semi Groups, Monoids, Groups, Congruence Relation and Quotient
Structures, Free and Cyclic Monoids and Groups, Permutation Groups,
Substructures, Normal Subgroups, Algebraic Structures with two Binary
Operation, Rings, Integral Domain and Fields. Boolean Algebra and Boolean
Ring, Identities of Boolean Algebra, Duality, Representation of Boolean
Function, Disjunctive and Conjunctive Normal Form
UNIT–V
Graphs and Trees: Graphs and their properties, Degree, Connectivity, Path, Cycle,
Sub Graph, Isomorphism, Eulerian and Hamiltonian Walks, Graph Colouring,
Colouring maps and Planar Graphs, Colouring Vertices, Colouring Edges, List
Colouring, Perfect Graph, definition properties and Example, rooted trees, trees
and sorting, weighted trees and prefix codes, Bi-connected component and
Articulation Points, Shortest distances.

Suggested readings :
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, TataMcGraw –
Hill
2. Susanna S. Epp, Discrete Mathematics with Applications,4th edition, Wadsworth
Publishing Co. Inc
3. C L Liu and D P Mohapatra, Elements of Discrete Mathematics A Computer
OrientedApproach, 3rd Edition by, Tata McGraw – Hill.
4. J.P. Tremblay and R. Manohar, “Discrete Mathematical Structure and It’s
Application to Computer Science”, TMG Edition, Tata Mcgraw-Hill
5. Norman L. Biggs, Discrete Mathematics, 2nd Edition, Oxford University
Press.Schaum’s Outlines Series, Seymour Lipschutz, Marc Lipson.

You might also like