3 Credits (3 Contact Hours)Combinations; permutations; permutations with restricted position; Polya’s theorem; principle of inclusion and exclusion; partitions; recurrence relations; generating functions; Mobius inversion; enumeration techniques; Ramsey numbers; finite projective and affine geometries; Latin rectangles; orthogonal arrays; block designs; error detecting and error correcting codes. Students are expected to have completed an undergraduate-level course in linear algebra before enrolling in this course. Offered fall semester only.
