Scribd
Upload
185 views1 page

BTCS402 Discrete Structures

This course provides background on discrete structures and their relationships to data structures and algorithm development. It covers sets, relations, functions, rings, Boolean algebra, combinatorics, monoids, groups, and graph theory. Specific topics include proofs of set identities, equivalence relations, Boolean logic, counting principles, permutations, groups, semigroups, graph coloring, and graph isomorphism. The objective is to understand discrete structures and their application to computer science problems.

Uploaded by

Kumar Anoop
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
185 views1 page

BTCS402 Discrete Structures

This course provides background on discrete structures and their relationships to data structures and algorithm development. It covers sets, relations, functions, rings, Boolean algebra, combinatorics, monoids, groups, and graph theory. Specific topics include proofs of set identities, equivalence relations, Boolean logic, counting principles, permutations, groups, semigroups, graph coloring, and graph isomorphism. The objective is to understand discrete structures and their application to computer science problems.

Uploaded by

Kumar Anoop
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

BTCS402 Discrete Structures

Objective/s:
The objective of this course is to provide the necessary back ground of discrete structures with
particular
reference to the relationships between discrete structures and their data structure counterparts
including
algorithm development.

1. Sets, relations and functions: Introduction, Combination of Sets, ordered pairs, proofs of
general
identities of sets, relations, operations on relations, properties of relations and functions, Hashing
Functions, equivalence relations, compatibility relations, partial order relations. [7]
2. Rings and Boolean algebra: Rings, Subrings, morphism of rings ideals and quotient rings.
Euclidean domains Integral domains and fields Boolean Algebra direct product morphisms
Boolean
sub-algebra Boolean Rings Application of Boolean algebra (Logic Implications, Logic Gates,
Karnaughmap)
[8]
3. Combinatorial Mathematics: Basic counting principles Permutations and combinations
Inclusion and Exclusion Principle Recurrence relations, Generating Function, Application. [7]
4. Monoids and Groups: Groups Semigroups and monoids Cyclic semigraphs and submonoids,
Subgroups and Cosets. Congruence relations on semigroups. Morphisms. Normal subgroups.
Dihedral
groups. [7]
5. Graph Theory: Graph- Directed and undirected, Eulerian chains and cycles, Hamiltonian
chains and
cycles Trees, Chromatic number Connectivity, Graph coloring, Plane and connected graphs,
Isomorphism
and Homomorphism. Applications. [7]

Suggested Readings/ Books:


1. Discrete Mathematics (Schaum series) by Lipschutz (McGraw Hill).
2. Applied Discrete Structures for Computer Science by Alan Doerr and Kenneth Levarseur.
3. Discrete Mathematics by N Ch SN Iyengar, VM Chandrasekaran.
4. Discrete Mathematics and Graph Theory(Cengage Learning) by Sartha
5. Discrete Mathematics and its Applications. Kenneth H Rosen.(McGraw Hill)
6. Elements of discrete mathematics. C L Liu (McGraw Hill)

You might also like