MATHEMATICS DEPARTMENT COURSE DESCRIPTIONS

SPRING, 2001

 

MATH 112 THE LANGUAGE OF MATHEMATICS 4 SEM HRS e. WHITAKER

This is an introduction to mathematics at the beginning college level. MATH 112 will explore contemporary mathematics with a problem-solving approach.

The class meetings will include lectures, problem-solving sessions, and group work. The final grade will be based on quizzes, exams, a project, and a comprehensive final. The prerequisite for this course is Math Placement Level 22 or higher. This course is not intended to prepare students for further courses in mathematics. Mathematical-reasoning intensive.

MATH 120 ELEMENTARY FUNCTIONS 4 SEM HRS J. WHITAKER/MENNETT

This is a standard pre-calculus mathematics course that explores the functions common to the study of calculus. Examination of polynomial, rational, exponential, logarithmic, and trigonometric functions will be done using algebraic, numeric, and graphical techniques. Applications of these functions in formulating and solving real-world problems will also be discussed.

The final grade in the course is based on quizzes, tests, and a comprehensive final exam. Students are required to have a TI-83, TI-83 Plus, or TI-86 graphing calculator for use in class and for homework assignments.

The prerequisite for this course is Math Placement Level 24 or higher. Mathematical-reasoning intensive.

MATH 127 INTRODUCTORY STATISTICS 4 SEM HRS ANDREWS

A study of statistics as the science of using data to glean insight into real-world problems. Includes graphical and numerical methods for describing and summarizing data, sampling procedures and experimental design, inferences about the real-world processes that underlie the data, and student projects for collecting and analyzing data. Open to non-majors only.

Prerequisites: Math Placement Level 23 or higher (Note: A student may receive credit for only one of the following statistics courses: MATH 127, MATH 227, PSYC 107, or MGT 210). Mathematical-reasoning intensive.

MATH 131 ESSENTIALS OF CALCULUS 4 SEM HRS MENNETT

This one semester calculus course is an introduction to the techniques and applications of differential and integral calculus. The applications come primarily from the social science and management fields and DO NOT involve any trigonometric models. The final grade in the course will be based on quizzes, tests, and a comprehensive final exam.

The prerequisite is MATH 120 or Math Placement Level 25. Students are required to have a TI-83, TI-83 Plus, or TI-86 graphing calculator for use in the course. Mathematical-reasoning intensive.

Notes: 1. Students may not receive credit for both MATH 131 and MATH 201

2. MATH 131 does not satisfy the prerequisite for MATH 202.

3. Take MATH 131 only if you are POSITIVE that you will take only one semester of calculus at Wittenberg. Otherwise, you should take MATH 201.

MATH 171 DISCRETE MATHEMATICS 4 SEM HRS SHELBURNE

This course covers a variety of topics in discrete mathematics which are important to the understanding of computer science and mathematics: logic, set theory, combinatorics and simple discrete probability theory, relations and functions, recursion and recurrence relations, and graph theory. The course will stress the presentation of mathematical arguments and proofs. Grading will be based on in-class tests, written homework assignments, and a final exam. Required for a major in computer science. Prerequisite is Math Placement Level 25 and the co-requisite is COMP 150. WRITING INTENSIVE. Mathematical-reasoning intensive.

MATH 201 CALCULUS I 4 SEM HRS STICKNEY/ANDREWS/e. WHITAKER

Calculus is the mathematical tool used to analyze changes in physical quantities. This is the first course in the standard calculus sequence. It develops the notion of "derivative", which is used for studying rates of change, and then introduces the concept of "definite integral", which is related to area problems. The overall approach will emphasize the concepts of calculus using graphical, numerical, and symbolic methods.

The two-semester calculus sequence, MATH 201/202, is required for all students majoring or minoring in mathematics, computer science, or physics, or majoring in chemistry. MATH 201 and MATH 202 can also count as "supporting science" courses for the BA and BS programs in Biology, Geology, and Biochemistry/Molecular Biology. Students who know that they’ll take only one semester of calculus may be better served in the single-semester introduction to calculus, MATH 131: "Essentials of Calculus". Talk with your advisor or with any math professor for advice on which calculus course is for you.

Normally, students are required to have a TI-83, TI-83 Plus, or TI-86 graphing calculator for use in class, for homework assignments, and for tests. If you have a different calculator that you’d like to use for the class, contact the instructor to find out whether your calculator is appropriate.

Depending on the instructor, the final grade in the course could be based on projects, homework, quizzes, tests, and a comprehensive final exam. The prerequisite for the course is MATH 120 or Math Placement Level 25. Mathematical-reasoning intensive.

NOTES: (1) Students may not receive credit for both MATH 131 and MATH 201.

(2) The 9:10 section (Dr. Stickney) is a special section. Students in this section will use the department’s TI-92 calculators, in addition to their own graphing calculators. If you don’t currently own a graphing calculator, you may not need to buy one. Contact Dr. Stickney for details.

MATH 202 CALCULUS II 4 SEM HRS J. WHITAKER

This is the second course in Wittenberg’s three semester calculus sequence. MATH 202 is primarily concerned with integration and power series representations of functions. Topics covered include: indefinite and definite integrals, the Fundamental Theorem of Calculus, integration techniques, elementary differential equations, approximations of definite integrals, improper integrals, applications of integrals, power series, Taylor’s Series, geometric series, and convergence tests for series.

Students are required to have a TI-83, TI-83 Plus, or TI-86 graphing calculator for MATH 202. See the individual instructor if you’re wondering whether your calculator is appropriate.

The final grade in the course is based on quizzes, tests, and a comprehensive final exam. MATH 201 is a prerequisite. Mathematical-reasoning intensive.

MATH 210 FUNDAMENTALS OF ANALYSIS 4 SEM HRS ASHTON

Functions, set theory, sequences, the topology of the real line, and methods of mathematical proof. Particular emphasis is given to careful, accurate definition and proof of mathematical concepts. Grades are based on several tests, homework assignments, and a final examination.

Prerequisite: MATH 202. WRITING INTENSIVE. Mathematical-reasoning intensive.

MATH 212 MULTIVARIABLE CALCULUS 4 SEM HRS STICKNEY

The continuation of MATH 202 which is a prerequisite. This course completes the basic calculus sequence. It covers the calculus of functions of several variables and associated analytic geometry. Students are required to have a TI-83, TI-83 Plus, or TI-86 graphing calculator for use in class, for homework assignments, and for tests. Mathematical-reasoning intensive.

MATH 228 UNIVARIATE PROBABILITY 4 SEM HRS ANDREWS

Probability is the branch of math in which we study randomness and quantify uncertainty. This course introduces some of the theory and applications of probability for a single variable. Topics include combinatorics, probability axioms, discrete and continuous random variables. This material constitutes one quarter of the first actuarial exam. Anyone interested in pursuing actuarial science or statistics should certainly take this course and it would be a great elective for any math major or minor.

Prerequisite: MATH 202. Mathematical-reasoning intensive.

MATH 365 ABSTRACT ALGEBRA 4 SEM HRS STICKNEY

This course will focus on abstract algebraic structures such as groups, rings, and fields with particular attention to groups. There will be an emphasis on presenting arguments with a full explanation of the reasoning. Prerequisite: MATH 205 and MATH 210. WRITING INTENSIVE. Mathematical-reasoning intensive.

MATH 380 TOPIC: OPTIMIZATION TECHNIQUES 4 SEM HRS NOYES

This topics course examines different methods of solving optimization problems. An optimization problem is a problem where one wishes to find the best solution. It typically involves maximizing or minimizing a function of one of more variables, possibly subject to some constraints on the variables. Typically these methods involve Linear Programming, Nonlinear Programming, and Unconstrained Minimization Techniques. The application models that will be solved by these methods will come from the sciences, engineering, economics, and business (operations research). This course will focus on the derivation and use of these techniques, their computer implementation, efficiency, and application to practical problems. The computer implementation will typically be done using Mathematica(R). However, C++, FORTRAN, or Pascal will also be used.

This course will be given for mathematics credit (MATH 380) or computer science credit (COMP 380) and should be of special interest to students in the sciences. The prerequisites are COMP 150 and MATH 201 or permission by the instructor. MATH 205 is also a desirable preprequisite. Students are required to have a TI-83, TI-83 Plus, or TI-86 graphing calculator for use in this class. Mathematical-reasoning intensive.

Grades will be based upon assignments and exams.

 

COMPUTER SCIENCE DEPARTMENT COURSE DESCRIPTIONS

SPRING, 2001

 

COMP 121 COMPUTING IN THE ARTS AND SCIENCES 4 SEM HRS e. WHITAKER

This introductory course is intended for non-majors, and assumes little computer experience beyond using word processing software. COMP 121 is designed to help students become familiar with microcomputers and their use in problem-solving and impact on society. Students will obtain familiarity with creating spreadsheets (in MS Excel), creating their databases (in MS Access), and creating Web pages (with Netscape Composer). Students will also learn a subset of a general-purpose programming language (Pascal).

The course meets for four hours each week, and includes extensive time for hands-on practice. The final grade will be based on labs and exams. Prerequisite is Math Placement Level 22 or higher. Mathematical-reasoning intensive.

COMP 150 COMPUTER PROGRAMMING I 5 SEM HRS NOYES

Introduction to computer science through the use of programming. Designed primarily for the student who expects to take further courses in computer science. Also very valuable for any student that expects to do programming that is related to another discipline (e.g., in the sciences). Topics include programming in a high-level language, problem-solving, algorithm design, control constructs, data constructs, input-output, procedural and data abstraction, and the role of computing in society.

All programming will be done using the microcomputers located in the Science building microcomputer laboratory. The course includes an introduction to an industrial quality compiler and its integrated development environment (IDE) on the Wittenberg NT network. The course stresses construction of algorithms, how to design and write programs, structured programming, programming style, program documentation and testing. Particular emphasis is placed on problem solving. The class has three 1-hour lecture/demonstrations plus a 2-hour lab per week. Much of the work for the course is done outside of class using the microlab computers to write, debug and run programs. The language to be used will be C++.

No previous experience with computers is assumed. The only prerequisite is Math Placement Level 22 or higher. The course grade is based on programming assignments, lab exercises, and in-class tests. Mathematical-reasoning intensive.

Note: this course (or it equivalent) is a prerequisite to the computational science course called Computational Models and Methods which will be offered in 2001-2002.

COMP 250 COMPUTER PROGRAMMING II 5 SEM HRS SHELBURNE

This course is an intensive study of program design and methods of structuring data. The first part of the course will emphasize data types such as multidimensional arrays, strings, structs, classes, pointers, and files and will also cover recursion and development of programs containing multiple source files. In the second half of the course, we will cover user-defined data types in more detail, with particular emphasis on linked lists, stacks, queues, priority queues, and trees, along with operations appropriate to each structure (e.g. tree traversals, backtracking, hashing). Applications include searching, sorting, numerical processing, text processing and graphics. Students will be expected to design and implement moderately sized programming projects on their own, but there may be an opportunity for one or two small group projects.

The course will meet three times a week for lecture, and once each week for a structured lab. Course grade will be based on programming assignments, written homework assignments and in-class tests. Great emphasis will be placed on good programming style. COMP 150 is the prerequisite. WRITING INTENSIVE. Mathematical-reasoning intensive.

COMP 265 PRINCIPLES OF PROGRAMMING LANGUAGES 5 SEM HRS NOYES

This course emphasizes the principles and programming styles (procedural, functional, object oriented, logic oriented) that govern the design and implementation of contemporary programming languages. Topics include language syntax and translation, data types and operations, sequence control, data control, subprograms, and environments. Languages to be studied include those taken from the following: Ada, APL, C, C++, FORTRAN, LISP, Mathematica®, Modula-2, Pascal, Prolog, Scheme and Smalltalk. Much of the work for the course will be done outside of class; this includes the use of the University computer and microcomputers together with appropriate library research. COMP 250 and MATH 201 are prerequisites. MATH 171 is a co-requisite.

Grades are based upon assignments, reports, presentations, and exams. This course will meet three times a week and have a weekly two hour lab session. It is a WRITING INTENSIVE course. Mathematical-reasoning intensive.

COMP 380 TOPIC: OPTIMIZATION TECHNIQUES 4 SEM HRS NOYES

This topics course examines different methods of solving optimization problems. An optimization problem is a problem where one wishes to find the best solution. It typically involves maximizing or minimizing a function of one of more variables, possibly subject to some constraints on the variables. Typically these methods involve Linear Programming, Nonlinear Programming, and Unconstrained Minimization Techniques. The application models that will be solved by these methods will come from the sciences, engineering, economics, and business (operations research). This course will focus on the derivation and use of these techniques, their computer implementation, efficiency, and application to practical problems. The computer implementation will typically be done using Mathematica(R). However, C++, FORTRAN, or Pascal will also be used.

This course will be given for mathematics credit (MATH 380) or computer science credit (COMP 380) and should be of special interest to students in the sciences. The prerequisites are COMP 150 and MATH 201 or permission by the instructor. MATH 205 is also a desirable prerequisite. Students are required to have a TI-83, TI-83 Plus, or TI-86 graphing calculator for use in this class. Mathematical-reasoning intensive.

Grades will be based upon assignments and exams.

COMP 380 TOPIC: COMPILERS 4 SEM HRS SHELBURNE

This course is an introduction to the principles and techniques of compiler design. Students will study such topics as lexical analysis, parsing, type checking, and intermediate and final code generation. The major project will be the implementation of an interpreter for a subset of Pascal or some similar language.

The class will meet three times a week. Grades will be based on exams and programming assignments.

Prerequisites: COMP 255, COMP 285, or permission of instructor. Mathematical-reasoning intensive.