Teaching at the ENSIIE

  1. Graph theory
    • Connectivity
    • Independent sets, domination sets
    • Planar graphs
    • Coloring
    • Trees, directed trees (Cours TD)
    • Matching
  2. Operations research
    • Minimum multicut
    • Dynamic programming
    • Mathematical programming
      • Simplex algorithm
      • Branch and bound
    • Markov chains, stochastic process
  3. Functional programming
    • Recursivity
    • Records, sum types
    • Iterators, higher order
  4. Imperative programming
    • Loops
    • Structures
    • Inputs/outputs
    • Pointers
  5. Formal verification : method B
  6. Compilation

Teaching at the IUT d'Orsay

  1. Analysis and design of databases