UNIT-

1.1 Fundamentals of Logic

1.1.1 Basic Connectives and Truth Tables

1.1.2 Logical Equivalence

1.1.3 Logical Implication

1.1.4 Use of Quantifiers

1.1.5 Definitions and the Proof of Theorems.

1.2 Set Theory

1.2.1 Set and Subsets

1.2.2. Set Operations, and the Laws of Set theory

1.2.3 Counting and Venn Diagrams.

1.3 Properties of the Integers:

1.3.1 The well – ordering principle

1.3.2 Recursive Definitions

1.3.3 Division Algorithms

1.3.4 Fundamental theorem of Arithmetic

UNIT-II

2.1 Relations and Functions:

2.1.1 Cartesian Product,

2.1.2 Functions onto Functions

2.1.3 Special Functions

2.1. 4 Pigeonhole Principle,

2..1 5 Composition and Inverse Functions,

2.1.6 Computational Complexity.

2.2 Relations

2.2.1 Partial Orders

2.2.2 Equivalence Relations and Partitions.

2.3 Principle of Inclusion and Exclusion

2.3.1 Principles of Inclusion and Exclusion

2.3.2 Generalization of Principle,

2.3.3 Derangements

2.3.4 Rock Polynomials

2.3.5 Arrangements with Forbidden Positions.

UNIT–III

3.1 Generating Functions:

3.1.1 Introductory Examples

3.1.2 Definition And Examples

3.1 .3 Partitions Of Integers

3..1 4. Exponential Generating Function

3.1.5 Summation Operator.

3.2 Recurrence Relations:

3.2.1 First – order linear recurrence relation,

3.2.2 second – order linear homogenous recurrence relation with constant coefficients,

3.2.3 Non homogenous recurrence relation,

3.2.4 divide and conquer algorithms.

UNIT-IV

4.1 Algebraic Structures:

4.2 Algebraic System –

4.4 General Properties,

4.5 Semi Groups,

4.6 Monoids,

4.7 Homomorphism,

4.8 Groups, Residue Arithmetic,

4.9 Group Codes and their Applications.

UNIT –V

Graph Theory:

Definitions and examples,

sub graphs,

complements and graph Isomorphism,

Vertex degree,

Planar graphs,

Hamiltonian paths and Cycles,

Graph Colouring,

Euler & Hamiltonian graphs, and Chromatic number.

Trees:

Definitions

properties and Examples

Rooted Trees

Spanning Trees and Minimum Spanning Trees.