Scribd
Upload
2 views

Syllabus - Discrete Structures and Graph Theory

The document outlines a course on Discrete Structures and Graph Theory, divided into five modules covering topics such as sets, permutations, relations, mathematical logic, and graph theory. Key concepts include mathematical induction, equivalence relations, normal forms, and various types of graphs and trees. The course emphasizes foundational principles and applications in data structures and algorithms.

Uploaded by

vishakstud24
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views

Syllabus - Discrete Structures and Graph Theory

The document outlines a course on Discrete Structures and Graph Theory, divided into five modules covering topics such as sets, permutations, relations, mathematical logic, and graph theory. Key concepts include mathematical induction, equivalence relations, normal forms, and various types of graphs and trees. The course emphasizes foundational principles and applications in data structures and algorithms.

Uploaded by

vishakstud24
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Discrete Structures and Graph Theory

Module 1:
Sets and Propositions : Introduction – Combination
of Sets – Finite and Infinite sets, Uncountable Infinite
Sets, Mathematical Induction, Principle of Inclusion and
Exclusion.
Permutations, Combinations : Permutations and
Combinations
Module 2:
Relations and Functions: A relational model for data Bases,
Properties of Binary Relations, Equivalence Relations and
Partitions, Partial Ordering Relations and Lattices, Functions and
the Pigeonhole Principle.

Module 3:
Mathematical Logic: Equivalence of Formulas - Duality Law
- Tautological Implications – Functionally Complete sets of
Connectives - Other Connectives.
Normal forms - Disjunctive Normal Forms – Conjunctive Normal
Forms – Principal Disjunctive Normal Forms - Principal
Conjunctive Normal Forms -
Ordering and Uniqueness of Normal Forms - The Theory of
Inference for the Statement Calculus – Rules of Inference –
Consistency of Premises and Indirect Method of Proof.
Module 4:
Graph Theory: Basic Terminology - Multigraphs and Weighted
Graphs – Paths and Circuits – Shortest Paths in Weighted
Graphs – Eulerian Paths and Circuits – Hamiltonian Graphs and
Circuits – Travelling Salesman Problem
Module 5:
Graph Theory:
Tress and Cut-sets: Tress – Rooted Tress – Path Lengths in
Rooted tress – Prefix Codes – Binary Search tress – Spanning
Tress and Cut Sets.

You might also like