Scribd
Upload
542 views

Unit 1 Discrete Maths

This document provides an overview of topics in discrete structures and optimization including mathematical logic, sets and relations, counting and probability, graph theory, Boolean algebra, and optimization. Key concepts covered include propositional and predicate logic, set operations, permutations and combinations, graph paths and circuits, Boolean functions, and linear programming solutions such as the simplex method. Optimization techniques like integer programming, transportation models, and PERT-CPM project scheduling are also summarized.

Uploaded by

Nelson Raja
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
542 views

Unit 1 Discrete Maths

This document provides an overview of topics in discrete structures and optimization including mathematical logic, sets and relations, counting and probability, graph theory, Boolean algebra, and optimization. Key concepts covered include propositional and predicate logic, set operations, permutations and combinations, graph paths and circuits, Boolean functions, and linear programming solutions such as the simplex method. Optimization techniques like integer programming, transportation models, and PERT-CPM project scheduling are also summarized.

Uploaded by

Nelson Raja
Copyright
© © All Rights Reserved
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

Unit – 1 : Discrete Structures and Optimization

Mathematical Logic : Propositional and Predicate Logic, Propositional Equivalences,


Normal Forms, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference.

Sets and Relations : Set Operations, Representation and Properties of Relations,


Equivalence Relations, Partially Ordering.

Counting, Mathematical Induction and Discrete Probability : Basics of Counting,


Pigeonhole Principle, Permutations and Combinations, Inclusion- Exclusion Principle,
Mathematical Induction, Probability, Bayes’ Theorem

Graph Theory : Simple Graph, Multi-graph, Weighted Graph, Paths and Circuits,
Shortest Paths in Weighted Graphs, Eulerian Paths and Circuits, Hamiltonian Paths and
Circuits, Planner graph, Graph Colouring, Bipartite Graphs, Trees and Rooted Trees,
Prefix Codes, Tree Traversals, Spanning Trees and Cut-Sets.

Boolean Algebra : Boolean Functions and its Representation, Simplifications of


Boolean Functions.

Optimization : Linear Programming – Mathematical Model, Graphical Solution, Simplex


and Dual Simplex Method, Sensitive Analysis; Integer Programming, Transportation and
Assignment Models, PERT-CPM: Diagram Representation, Critical Path Calculations,
Resource Levelling, Cost Consideration in Project Scheduling.

You might also like