Scribd
Upload
62 views1 page

Syllabus of Discrete Math

The document outlines a curriculum for a course in Discrete Mathematics, covering topics such as sets, logic, relations, counting principles, and graph theory. It includes detailed units on operations with sets, logical operations, properties of partial order sets, counting techniques, and various types of graphs. Each unit presents foundational concepts and applications relevant to the field of discrete mathematics.

Uploaded by

noobsyrus
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
62 views1 page

Syllabus of Discrete Math

The document outlines a curriculum for a course in Discrete Mathematics, covering topics such as sets, logic, relations, counting principles, and graph theory. It includes detailed units on operations with sets, logical operations, properties of partial order sets, counting techniques, and various types of graphs. Each unit presents foundational concepts and applications relevant to the field of discrete mathematics.

Uploaded by

noobsyrus
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

Discrete Mathematics

Unit - 1
Introduction to Sets, Algebra of sets and operations on Sets
Cartesian product, Applications based on sets, Properties of relations, equivalence relation
Partial order relation, composition of relations, Representation of relations using diagraphs,
Function, domain and range, Types of functions, one to one function, onto function,
Composite and inverse function, Hashing function, recursive function
Unit - 2
Introduction to logic, proposition, First degree logic, basic logic operations, Truth tables, ,
Tautologies, contradictions, Algebra of proposition, logic implications, Logical equivalence,
predicates, universal and existence quantifiers,.
Unit - 3
Problems based on logic. Partial order sets (concept) with an example, Totally ordered set,
Representation of POSETS using Hesse diagram, Chains, Maximal and Minimal elements,
Greatest lower bound, least upper bound, Lattices and Algebraic Structure, Principle of
Duality, Elementary Properties of Lattices, Atoms. Sub lattices, Bounded lattice, Distributed
and Complemented Lattices, Isomorphic lattices Boolean lattice.
Unit - 4
Introduction, Basic Counting Principles. Permutations, Permutations of things not all
different, Circular Permutations, Problems related to permutations, Combinations, Restricted
Permutations and Combinations, Derangement, Pascal’s Triangle, Binomial Theorem (only
for natural Numbers),
Order of Recurrence Relations, Degree of Recurrence Relations, Linear Homogeneous
Recurrence Relations, Non homogenous Recurrence Relations, Solution of linear
homogeneous and non-non homogeneous recurrence relations
Unit - 5
Introduction. Degree of a vertex of a graph, Handshaking Theorem,
Types of Graphs, sub graph Matrix representation of a graph adjacent and incidence matrices,
Isomorphic graphs, path and circuit (Floyd’s,Warshall) algorithms
Connected graph, Hamiltonian graph, Euler graph, Graph coloring (Vertex, Edges and Map)

You might also like