4 credits (3-1-0)
Overlaps with: MTL180
Propositional logic, Predicate Calculus and Quantifiers; Proof Methods; Sets, functions, relations, Cardinality, Infinity and Diagonalization; Induction and Recursion; Modular Arithmetic, Euclid’s Algorithm, primes, Public Key Cryptography; Polynomials, finite fields and Secret Sharing; Coding Theory: Error correcting codes, Hamming codes, Hamming bound; Basic Counting – Pigeon hole principle; Advanced Counting – recurrence relations, generating functions, inclusion-exclusion; basic information theory, entropy, Kraft’s inequality, mutual information, lower bounds; Probability – sample space, conditional probability, expectation, linearity of expectation, variance, Markov, Chebychev, probabilistic methods; Graph Theory – Eulerian, Hamiltonian & planar graphs, edge and vertex coloring.