MA5760   DISCRETE MATHEMATICS

      Basic counting principle : Pigeonhole principle, inclusion - exclusion principle, recurrence relations, generating functions. Construction of finite fields, codes grammars and language, elements of logic.

     Undirected and direct graphs, modelling with graphs, trials and cycles, connectivity and trees.

     Graph algorithms: BFS, DFS, shortest path, optimal spanning trees, matching, job assignment problem, optimal transportation through flows in networks.