Scribd
Upload
10 views2 pages

Target

The document outlines the curriculum for a course on Discrete Structures and Optimization, covering topics such as propositional logic, set operations, counting principles, group theory, graph theory, Boolean algebra, and optimization techniques. It includes detailed subtopics like mathematical induction, Bayes' theorem, Eulerian paths, and linear programming methods. The course aims to equip students with foundational knowledge and practical skills in discrete mathematics and optimization strategies.

Uploaded by

parwinderkaur412024
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
10 views2 pages

Target

The document outlines the curriculum for a course on Discrete Structures and Optimization, covering topics such as propositional logic, set operations, counting principles, group theory, graph theory, Boolean algebra, and optimization techniques. It includes detailed subtopics like mathematical induction, Bayes' theorem, Eulerian paths, and linear programming methods. The course aims to equip students with foundational knowledge and practical skills in discrete mathematics and optimization strategies.

Uploaded by

parwinderkaur412024
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

Target-13-3-2025

 1. Discrete Structures and Optimization


Unit - 1: Discrete Structures and Optimization

 Propositional and Predicate Logic


 Propositional Equivalences
 Normal Forms
Mathematical Logic
 Predicates and Quantifiers
 Nested Quantifiers
 Rules of Inference

 Set Operations
 Representation and Properties of
Set and Relations Relations
 Equivalence Relations
 Partially Ordering

 Basics of Counting
 Pigeonhole Principle
 Permutations and Combinations
Counting, Mathematical Induction
 Inclusion- Exclusion Principle
and Discrete Probability
 Mathematical Induction
 Probability
 Bayes’ Theorem

 Groups
 Subgroups
 Semi Groups
 Product and Quotients of Algebraic
Structures
 Isomorphism
Group Theory
 Homomorphism
 Automorphism
 Rings
 Integral Domain Fields
 Applications of Group Theory

Graph Theory  Simple Graph


Unit - 1: Discrete Structures and Optimization

 Multigraph
 Weighted Graph
 Paths and Circuits
 Shortest Paths in Weighted Graphs
 Eulerian Paths and Circuits
 Hamiltonian Paths and Circuits
 Planner graph, Graph Coloring
 Bipartite Graphs
 Trees and Rooted Trees
 Prefix Codes
 Tree Traversals
 Spanning Trees and Cut-Sets

 Boolean Functions and its


Boolean Algebra Representation
 Simplifications of Boolean Functions

 Linear Programming - Mathematical


Model
 Graphical Solution
 Simplex and Dual Simplex Method
 Sensitive Analysis
 Integer Programming
 Transportation and Assignment
Optimization
Models
 PERT-CPM: Diagram
Representation
 Critical Path Calculations
 Resource Levelling
 Cost Consideration in Project
Scheduling

You might also like