The unifying theme is the study of functions, including polynomials, rational functions, exponential, logarithmic and trigonometric functions. MA115 Discrete Mathematics - Web site Set theory, functions and relations, logic, counting principles, sequences and series, graph theory, and proof techniques. Applications to computer science. Calculus I, II Differentiation and integration and their application to the study of the elementary functions and to problems in the natural and social sciences. An introduction to some basic concepts of analysis.
Attention is paid to theory as well as applications.
Introduction to a symbolic algebra system and a computing language as tools to clarify the basic concepts. Three hours lecture, two hours laboratory. This course includes topics from combinatorics and from graph theory. Particular emphasis on elementary counting formulas, the formulating and solving of recurrence relations, countable and uncountably infinite sets, and graph theory proofs. Applications are given from computer science.