CS 351 Discrete Mathematics in Computing (NS)
Students are introduced to discrete mathematics concepts using a general-purpose programming language. We will walk through basic concepts such as variables, arithmetic sets, functions, algorithms, loops, strings, lists, dictionaries, files, number systems, Boolean algebra, statements, digital circuits, bitwise operators, sequences, sums, parity, invariants, and finite strategy games, counting, probabilities, vectors, matrices, polynomials, recurrence relations, recursion, graphs, number theory, and cryptology. Along the way, students will complete a series of hands-on exercises designed to build the ability to think with precision about both mathematical facts and computer programs.