Scribd
Upload
4 views5 pages

Discrete Mathematics Sylla BSC Mathematics

The document outlines the syllabus for the Discrete Mathematics course for B.Sc. Mathematics third year at Bharathiar University. It includes five units covering topics such as mathematical logic, relations and functions, formal languages and automata, lattices and Boolean algebra, and graph theory. Each unit consists of multiple lessons with specific focus areas and a model question paper at the end.

Uploaded by

Sebastian Varghese
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
4 views5 pages

Discrete Mathematics Sylla BSC Mathematics

The document outlines the syllabus for the Discrete Mathematics course for B.Sc. Mathematics third year at Bharathiar University. It includes five units covering topics such as mathematical logic, relations and functions, formal languages and automata, lattices and Boolean algebra, and graph theory. Each unit consists of multiple lessons with specific focus areas and a model question paper at the end.

Uploaded by

Sebastian Varghese
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/ 5

B.Sc.

MATHEMATICS

THIRD YEAR

APPLICATION ORIENTED SUBJECT

DISCRETE MATHEMATICS

BHARATHIAR UNIVERSITY
SCHOOL OF DISTANCE EDUCATION

COIMBATORE – 641 046


DISCRETE MATHEMATICS

CONTENTS

Lessons Page No.

UNIT - I
LESSON 1 MATRICES 1

LESSON 2 CONNECTIVES 2

LESSON 3 NORMAL FORMS 17

LESSON 4 PREDICATE CALCULUS 22

LESSON 5 THEORY OF INFERENCE FOR THE 26


PREDICATE CALCULUS

UNIT - II
LESSON 6 RELATIONS AND ORDERING 29

LESSON 7 ALGEBRAIC STRUCTURE 34

UNIT - III
LESSON 8 GRAMMAR AND LANGUAGES 39

LESSON 9 TYPES OF GRAMMAR 42

LESSON 10 FINITE – STATE ACCEPTORS AND 44


REGULAR GRAMMAR

UNIT - IV
LESSON 11 LATTICES 49

LESSON 12 BOOLEAN ALGEBRA 54

LESSON 13 BOOLEAN FUNCTIONS 57


CONTENTS

Lessons Page No.


UNIT - V

LESSON 14 GRAPH THEORY 63

LESSON 15 PATHS, REACHABILITY, CONNECTEDNESS 69

LESSON 16 TREES 73

MODEL QUESTION PAPER 81


SYLLABUS
DISCRETE MATHEMATICS
UNIT – I
Mathematical logic: Connectives, well formed formulas, Tautology, Equivalence
of formulas, Tautological implications, Duality law, Normal forms, Predicates, Variables,
Quantifiers, Free and bound Variables, Theory of inference for predicate calculus.
UNIT-II
Relations and functions: Composition of relations, Composition of functions –
Inverse functions, one-to-one, onto, one & onto, onto functions, Hashing functions
Permutation function, Growth of functions. Algebra structures Semi groups, Free semi
groups, Monoids, Groups, Cosets, Sets, Normal subgroups, Homomorphism.
(2-3.5, 2-3. 7, 2-4.2, 2-4.3, 2-4.6, 3-2, 3-5, 3-5.3. 3-5.4).
UNIT-III
Formal languages and Automata: Regular expressions, Types of grammar, Regular
grammar and finite state automata, Context free and sensitive grammars.
(3-3.1, 3-3.2, 4-6.2)
UNIT-IV
Lattices and Boolean algebra: Partial ordering, Poset, Lattices, Boolean algebra,
Boolean functions, Theorems, Minimisation of Boolean functions.
(4-1.1, 4-2, 4-3, 4-4.2)
UNIT-V
Graph Theory: Directed and undirected graphs, Paths, Reachability,
connectedness, Matrix representation, Euler paths, Hamiltonian paths, Trees, Binary trees
simple theorems and applications
(5-1.1, 5-1.2, 5-1.3, 5-1.4).
Text Book
1. P.Tremblay and R.P.Manohar “Discrete Mathematical Structures with applications to
computer science”, McGraw Hill, 1975.

You might also like