An interdisciplinary course designed to provide the student with the analytical tools and concepts for dealing with practical “everyday” problems.
This course is a study of discrete structures commonly used in computer science and mathematics, including topics from sets and relations, permutations and combinations, graphs and trees, induction, recursion, and Boolean Algebras.
This course is designed to acquaint the student with the widely known theorems, conjectures, unsolved problems, and proofs of number theory.
This course presents the basic techniques for the efficient numerical solution of problems in science and engineering. Topics covered may include solutions of equations in one variable, interpolation and polynomial approximation, numerical differentiation and integration, differential equations, and solving linear systems.