a.k.a.

Discrete Mathematics Discrete mathematical Structures

WHY STUDY DISCRETE MATHEMATICS?

Excellent tool for improving reasoning and problem solving skills. Modern mathematics deals with sets and not simple numbers. Information is stored and manipulated by computing machines in

discrete fashion. Even real numbers are covered in DM as they are represented as floating point numbers. Knowledge of DM is integral for efficiently understanding and using concepts like

Data Structures Database Theory Automata Theory Compiler Design Operating Systems .. And many more!

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

GRAPH THEORY

ABSTRACT AND LINEAR ALGEBRA PROBABILITY

LANGUAGE, GRAMMAR AND AUTOMATA

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

GRAPH THEORY

ABSTRACT AND LINEAR ALGEBRA PROBABILITY

LANGUAGE, GRAMMAR AND AUTOMATA

The science dealing with the methods of reasoning. All methods of verification of algorithms use notations and methods of logic. Mathematical logic is the foundation on which Artificial Intelligence is built. Crucial for studying behavior of gates and circuits in hardware design.

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

GRAPH THEORY

ABSTRACT AND LINEAR ALGEBRA PROBABILITY

LANGUAGE, GRAMMAR AND AUTOMATA

A set is a collection of well defined objects. The language of set theory is used in every mathematical subject. Programmers use sets of different objects & ways of manipulating them The foundation behind the field of Fuzzy Logic.

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

GRAPH THEORY

ABSTRACT AND LINEAR ALGEBRA PROBABILITY

LANGUAGE, GRAMMAR AND AUTOMATA

Binary logic deals with variables that take on two variables 0 and 1 and with operations that assume logical meaning. The foundation behind design of digital circuits. Crucial for understanding and efficiently designing computer systems.

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

GRAPH THEORY

ABSTRACT AND LINEAR ALGEBRA PROBABILITY

LANGUAGE, GRAMMAR AND AUTOMATA

Data is arranged in sets whose elements are indexed by one or more subscripts. Matrices provide a means of storing large amounts of data such that the data can be handled element wise and as a whole. Extensively used in AI fields like robotics.

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

GRAPH THEORY

ABSTRACT AND LINEAR ALGEBRA PROBABILITY

LANGUAGE, GRAMMAR AND AUTOMATA

The part of Mathematics that seeks to investigate the properties of integers. Has applications in transmission, coding and manipulation of data. Extensively used in Cryptography.

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

GRAPH THEORY

ABSTRACT AND LINEAR ALGEBRA PROBABILITY

LANGUAGE, GRAMMAR AND AUTOMATA

The part of mathematics that deals with objects and their comparisons. While executing programs, comparisons are made and different tasks are performed based on results. Relational databases stores information in the form of relations between objects and their attributes.

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

GRAPH THEORY

ABSTRACT AND LINEAR ALGEBRA PROBABILITY

LANGUAGE, GRAMMAR AND AUTOMATA

Functions describe connections between two different sets. Foundation for the field of mathematical modeling. Extensively used in domain of recursive function theory.

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

GRAPH THEORY

ABSTRACT AND LINEAR ALGEBRA PROBABILITY

LANGUAGE, GRAMMAR AND AUTOMATA

A POSET is a special type of a set and a Lattice is a special type of an Ordered set. Used in PERT and CPM techniques crucial for Software Project Management.

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

GRAPH THEORY

ABSTRACT AND LINEAR ALGEBRA PROBABILITY

LANGUAGE, GRAMMAR AND AUTOMATA

The mathematics of Counting, Selecting and Arranging objects. It includes the theory of Permutations and Combinations. Application of combinatronics play important role in Algorithmic Analysis.

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

GRAPH THEORY

ABSTRACT AND LINEAR ALGEBRA PROBABILITY

LANGUAGE, GRAMMAR AND AUTOMATA

Algebra uses different mathematical structures and their manipulations. Important structures are Groups, Rings and Fields. Groups are used in Automata theory and Formal languages. Very important in developing techniques that help in transmission of data that help in detecting and correcting errors.

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

ABSTRACT AND LINEAR ALGEBRA GRAPH THEORY PROBABILITY LANGUAGE, GRAMMAR AND AUTOMATA

A Graph is a set of points that are interconnected by a set of lines. Applications include syntactic analysis, fault detection and diagnosis in computers and minimal path problems. A very useful practical problem-solving tool in a variety of fields.

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

ABSTRACT AND LINEAR ALGEBRA GRAPH THEORY PROBABILITY LANGUAGE, GRAMMAR AND AUTOMATA

A tree represents hierarchical relations between data items. A binary search tree is a very important search structure in many applications. Trees are used to organize information in database systems and to represent the syntactic structure of source programs in compilers. Used to analyze electrical circuits and represent structure of mathematical formulas.

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

ABSTRACT AND LINEAR ALGEBRA GRAPH THEORY PROBABILITY LANGUAGE, GRAMMAR AND AUTOMATA

Branch of mathematics which deals with phenomena whose outcomes involve uncertainity. Probability is measured on a scale from 0 to 1. Has applications in coding theory and data transmission and error detection / correction.

COMPONENTS
MATHEMATICAL LOGIC SET THEORY BOOLEAN ALGEBRA MATRICES

NUMBER THEORY
COMBINATRONICS TREES

RELATIONS

FUNCTIONS

POSETS AND LATTICES

ABSTRACT AND LINEAR ALGEBRA GRAPH THEORY PROBABILITY LANGUAGE, GRAMMAR AND AUTOMATA

Defines structure to a language over a specified set of symbols. Used for developing and analyzing programming languages. Has applications in robotics, AI, Compiler construction and knowledge engineering.

Syllabus in Brief
UNIT 1 SET THEORY

COMBINATIONS OPERATIONS

RELATIONS TYPES AND PRPERTIES REPRESENTATION LATTICES FUNCTIONS CLASSIFICATION OPERATIONS

Syllabus in Brief
UNIT 2 RECURRENCE RELATIONS AND ALGORITHMS

METHODS OF SOLVING PIGEONHOLE PRINCIPLE PERMUTATION AND COMBINATION VARIANTS

COUNTING TECHNIQUES

MATHEMATICAL INDUCTION

Syllabus in Brief
UNIT 3 ALGEBRIC STRUCTURES

GROUPS TYPES AND PROPERTIES ORDERS OPERAIONS RINGS PROPERTIES FIELDS PROPERTIES

Syllabus in Brief
UNIT 4 LOGIC

BOOLEAN ALGEBRA AXIOMS AND THEOREMS BOOLEAN EXPRESSION SIMPLIFICATION ALGEBRIC KARNAUGH MAP DIGITAL CIRCITS PROPOSITIONAL LOGIC PREDICATE LOGIC

Syllabus in Brief
UNIT 5 GRAPHS

REPRESENTATION TYPES PATHS BINARY TREE TRAVERSAL SPANNING TREES

TREES

Basics
Definition Elements Membership Representation Tabular or Roster (Listing) Method Set Builder or Rule Method Bit String Method Special Sets R , Z , Z+ , N , C , Q

Types of Sets
Finite Sets

Infinite Sets
Null Set

Singleton Set
Subset
Superset Proper Subset

Equal Sets Universal Set Comparable Set Disjoint Set Power Set

Operations on Sets
Union
Intersection Complement

Difference
Symmetric Difference Cardinality Venn Diagrams

Multisets
Representation
Cardinality Operations

Set Identities
(1) A A (2) A B A B A B A B (3) A B B A A B B A (4) A ( B C ) ( A B ) C A ( B C ) ( A B) C Associativ e Laws Commutative Laws Law of Double Complement Demorgan' s Laws

(5) A ( B C ) ( A B ) ( A C ) Distributi ve Laws A ( B C ) ( A B) ( A C )

Set Identities

(6) A A A, A A A Idempotent Laws (7) A A, A U A Identity Laws (8) A A U , A A (9) A U U , A = (10) A ( A B ) A A( A B ) A Inverse Laws DominationLaws Absorption Laws