Discrete Structures and Optimization
Unit 1
Topics covered
- Mathematical logic, predicates, quantifiers and inference
- Sets, relations, equivalence and partial ordering
- Counting, induction, discrete probability and Bayes’ theorem
- Groups, rings, fields, homomorphism and related algebraic structures
- Graphs, trees, paths, colouring, spanning trees and cut-sets
- Boolean algebra and function simplification
- Linear and integer programming, simplex methods, transportation, assignment, PERT and CPM