Discrete Mathematics

Discrete Mathematics

  1. Introduction, Propositional Logic,
  2. Propositional Equivalences, Predicates,
  3. Quantifiers, Nested Quantifiers,
  4. Rules of Inference and Examples and introduction to proofs,
  5. Sets, Sets operations and Functions,
  6. Sequences and Summations, Induction,
  7. Relations and Their Properties, Representing Relations, Closures of Relations, Equivalence Relations and Partial Ordering,
  8. Shortest Path Problems, Plannar Graphs, Graph Coloring
  9. Introduction to Trees, Application of Trees, Tree Traversal,
  10. Application of Trees, Tree Traversal,
  11. Spanning Trees, Minimum Spanning Trees,
  12. Introduction to Finite-State Machines,
Avatar
Akin Delibasi
Associate Professor of Control & Automation Engineering

My research interests include convex optimization, adaptive optics and switch systems