Description
Graph theory, combinatorics, applications of sets, algebra. Useful to students in applied mathematics and computer science. Use of results and techniques from these areas to solve a variety of problems in finite mathematics. Additional topics may include recurrence relations, coding theory, finite state machines, Boolean algebra. Fall Term odd years. Prerequisites: Second-year standing; MA 250 or MA 252.