Mathematics and Computer Science

PROFESSOR

Alec Michael Sheard III. 2008. Chair. B.A., Yale University; M.A. and Ph.D., University of California, Berkeley. (Logic, set theory.)

ASSOCIATE PROFESSORS

Eric Gottlieb. 1998. B.S., Antioch College; M.S., University of Washington; Ph.D., University of Miami. (Algebraic combinatorics.)
Christopher Mouron. 2002. E.C. Ellett Chair of Mathematics. B.S., Lafayette College; M.S. and Ph.D., Texas Tech University. (Topology, continuum theory, discrete dynamical systems.)

ASSISTANT PROFESSORS

Erin N. Bodine. 2010. B.S. and B.A., Harvey Mudd College; Ph.D., University of Tennessee, Knoxville. (Optimal control theory, mathematical ecology, differential equations, discrete difference equations.)
Eric Breck. 2008. B.S., University of Michigan; M.S. and Ph.D., Cornell University. (Computational linguistics, natural language processing, machine learning.)
Rachel M. Dunwell.2005. B.Sc., Leeds University; M.Sc., Liverpool University, Ph.D., Heriot-Watt University. (Psychometrics.)
Jeff Hamrick. 2009. B.S., B.B.A., and B.A., Stetson University; M.A. and Ph.D., Boston University. (Nonparametric statistics of stochastic processes, mathematical finance, econometrics.)
Chris Seaton.2004. B.A., Kalamazoo College; Ph.D., University of Colorado at Boulder. (Differential geometry, differential topology, orbifolds.)
Betsy Williams Sanders.2007. B.S., Millsaps College; M.S. and Ph.D., Vanderbilt University. (Computer graphics and animation.)

STAFF

K. Michelle Hammontree. Departmental Assistant. B.A., University of Southern Indiana, Evansville.

REQUIREMENTS FOR A MAJOR IN MATHEMATICS

A total of forty-nine (49) credits as follows:

1. Mathematics 121, 122, 201, 223, 261, 386, 485, and 486.
2. Six additional four-credit courses from among mathematics courses numbered above 200 or Computer Science 141, including at least four courses numbered above 300, excluding 495 and 496.

REQUIREMENTS FOR A MAJOR IN COMPUTER SCIENCE

A total of fifty-three (53) credits as follows:

1. Computer Science 141, 142, 172, 231, 241, 330, 485, and 486.
2. Computer Science 350 or 355.
3. Mathematics 121 and one additional mathematics course
4. Three additional four-credit computer science courses numbered above 300, excluding 495 and 496.

REQUIREMENTS FOR A MINOR IN MATHEMATICS

A total of twenty-four (24) credits as follows:

1. Mathematics 121 and 122.
2. Four additional four-credit mathematics course numbered above 200, including at least one course numbered above 300.

REQUIREMENTS FOR A MINOR IN COMPUTER SCIENCE

A total of twenty-four (24) credits as follows:

1. Computer Science 141, 142, 172, 231, and 241.
2. One additional four-credit computer science course numbered above 300.

HONORS IN MATHEMATICS OR COMPUTER SCIENCE:

1. Required courses: fulfillment of the requirements for the major.
2. Honors Tutorial: 495 and 496.
3. Approval by the department is required.

PLANNING A MAJOR

Students considering a major in Mathematics or Computer Science should contact the Chair or another member of the department as early as possible to ensure progress is being made toward the major. More information can be found at the department’s web site: www.rhodes.edu/mathcs.

For reasonable progress toward a major in Mathematics, a student should begin the Calculus sequence (Math 121, 122 and 223) at the appropriate level in the first year, and complete the sequence before the Spring of the second year; complete Math 201 in the first year (or second year if necessary); and complete Math 261 by the end of the second year.

For reasonable progress toward a major in Computer Science, a student should begin the introductory programming sequence (Computer Science 141, 142, 241) in the first year. In the second year, a student should complete Computer Science 172 in fall and Computer Science 231 in the spring. The Mathematics requirements should be completed by the end of the third year.

COURSE OFFERINGS IN MATHEMATICS

107. Linear Methods.
Fall, Spring. Credits: 4.
Degree Requirements: F6.
Topics include systems of linear equations, matrices, matrix inversion and applications (including Leontief input-output analysis), mathematical programming, linear programming and the simplex method, finite Markov chains, and game theory.
Prerequisites: None.

108. Cryptology.
Spring. Credits: 4.
Degree Requirements: F6.
This course is an examination of conventional cryptographic methods (such as substitution and transposition ciphers), public key methods (such as RSA, a standard method for secure web transactions), and computer-based conventional cryptographic techniques (block ciphers and hash functions). We will develop and use mathematical tools such as modular arithmetic, probability, matrix algebra, and number theory both to implement and cryptanalyze these methods. In addition, we will deal with a few of the technical and public policy issues surrounding uses of encryption.
Prerequisites: None.

111. Introduction to Applied Statistics.
Fall, Spring. Credits: 4.
Degree Requirements: F6.
A modern introduction to statistical inference. Core topics include one- and two-sample hypothesis testing and confidence interval construction for means and proportions using both randomization techniques and traditional methods; correlation; and simple linear regression. Students are introduced to professional statistical packages. Students who have already taken Math 122 should consider taking Math 311-312 instead. Students who already have credit for Economics 290 may not earn credit for Math 111.
Prerequisites: None.

115. Applied Calculus.
Fall, Spring. Credits: 4.
Degree Requirements: F6.
This one-semester course presents an introduction to applied mathematics and an overview of calculus: applications of the derivative, the definite Integral, the Fundamental Theorem of Calculus, partial derivatives and double integrals. Applications will involve the use of a variety of functions, including exponential, logarithmic and trigonometric functions. Each topic is introduced through the modeling process; computer-based applications and group work are major components of this course. (Note: Students who have already had Math 121 may not earn credit for Math 115. Math 115 is not adequate preparation for Math 122.)
Prerequisites: None.

121. Calculus I.
Fall, Spring. Credits: 4.
Degree Requirements: F6.
This course is an introduction to the concepts, formalism, and applications of derivatives and integrals. Elementary transcendental functions are used throughout; specific topics include limits, the derivative, applications of differentiation, the definite integral, and the Fundamental Theorem of Calculus.
Prerequisites: Students will need a background in high school algebra, geometry, trigonometry, and exponential and logarithmic functions.

122. Calculus II.
Fall, Spring. Credits: 4.
Degree Requirements: F6.
This course is an introduction to (1) formal and numerical techniques of integration, (2) Taylor’s theorem, sequences, series, power series, and their applications, (3) applications of integration and series to solving first-order and linear differential equations, and (4) applications of integration to calculate area, length, volume, probability, work, centroids, and fluid pressure.
Prerequisites: Math 121.

131. Mathematics through Advanced Software..
Fall. Credits: 4.
The fundamental principles of the Mathematica programming language are presented, with examples from the mathematical sciences. Students will learn about symbolic manipulation, pattern matching, compound expressions, substitution rules, blocking, packages, anonymous functions, nesting, folding, compiling, timing, and manipulation. These features of Mathematica will be explored through such concepts as eigenvalues and eigenvectors; analytical and numerical solutions to ordinary differential equations; simulation of random numbers and processes; Newton’s method; and conjugategradient optimization.
Prerequisites:Any calculus course or permission of instructor..

201. Transition to Advanced Mathematics.
Fall. Credits: 4.
Degree Requirements: F6.
A thorough introduction to the reading, writing, presenting and creating of mathematical proofs. Students will learn and practice in a careful and deliberate way the techniques used to prove mathematical theorems. Proofs studied will be chosen from a variety of fields such as set theory, number theory, analysis, algebra, and graph theory. Topics also include elements of the history and philosophy of mathematics and an introduction to the mathematical community.
Prerequisites:Math 122 or permission of instructor.

223. Calculus III.
Fall, Spring. Credits: 4.
Degree Requirements: F6.
A continuation of Math 122: vector calculus, functions of several variables, partial derivatives, multiple integrals, line integrals, and Green’s theorem.
Prerequisites: Math 122.

232. Modeling and Data Analysis with Advanced Software.
Spring. Credits: 4.
In this course, students will continue exploring the fundamental principles underlying Mathematica’s programming language at a more advanced level through data analysis and modeling projects. Students will learn how to use Mathematica to address applied problems, such as importing and cleaning web pages, insetting and transforming graphics, searching the human genome for fragments of DNA sequences, visualizing chemical reactions, modeling predator-prey systems, and screening human proteins and historical stock data for patterns.
Prerequisites: Math 131.

251. Differential Equations.
Spring. Credits: 4.
Degree Requirements: F6.
The theory, methods, and applications of ordinary differential equations. Topics include existence, uniqueness and other properties of solutions, linear equations, power series and Laplace transform methods, systems of linear equations, and qualitative analysis.
Prerequisites: Math 122.

261. Linear Algebra.
Spring. Credits: 4.
Degree Requirements: F6.
Topics include systems of linear equations, matrix algebra, determinants, real and complex vector spaces, linear transformations, eigenvalues and eigenvectors, and diagonalization. Attention is given to proofs.
Prerequisites: Math 201, 223, or permission of instructor.

311. Probability Theory.
Fall. Credits: 4.
Topics include the axioms of Kolmogorov, basic combinatorics, conditional probability, independence, various discrete and continuous probability distributions, expected value, variance, moment-generating functions, characteristic functions, the weak and strong law of large numbers, the Central Limit Theorem, and simulation. (Course offered in alternate years; scheduled for 2011-2012.)
Corequisite: Math 223.

312. Mathematical Statistics.
Spring. Credits: 4.
This course introduces students to theoretical issues and data-driven applications in statistics. Topics include modes of convergence, estimation theory, confidence interval construction, hypothesis testing, linear regression, goodness-of-fit tests, and nonparametric tests. Special emphasis is placed on the use of the Student’s t, F, Z, and chi-squared distributions to draw inferences about the means and variances of one or two populations. (Course offered in alternate years; scheduled for 2011-2012.)
Prerequisites: Math 311.

321-322. Real Analysis.
Fall, Spring. Credits: 4-4.
Topics include the real and complex number systems, metric spaces, sequences and series, continuity, and differentiation, as well as topics selected from the Riemann and the Riemann-Stieltjes integrals, sequences and series of functions, functions of several real variables, and Lebesgue theory. Emphasis is on careful proof.
Prerequisites:For 321, Math 201 and Math 223. For 322, Math 321.

341. Introduction to Financial Mathematics.
Fall. Credits: 4.
This course is an introduction to mathematical models used in finance. Topics include: risk-free and risky assets, binomial and trinomial models of stock prices, other discrete-time and continuous time market models, geometric Brownian motion, martingales, the Fundamental Theorem of Asset Pricing, classical meanvariance portfolio optimization, forwards/futures contracts, equity options, Ito’s lemma, the Black-Scholes partial differential equation, hedging options positions, and stochastic models of interest rates. (Course offered in alternate years; scheduled for 2012-2013.)
Prerequisites:Math 223.

342. Mathematical Economics.
Spring. Credits: 4.
This course is an introduction to mathematical techniques and models used in modern economics. After a review of selected material from calculus, topics will include: convexity, hemicontinuity, implicit and inverse function theorems, and the Karush-Kuhn-Tucker conditions; control theory, the calculus of variations, the Euler equation, and the maximum principle; discrete-time optimization, dynamic programming, and Bellman’s equation; first- and second-order difference equations; and fixed points, contraction mappings, and theorems of Brouwer and Kakutani. (Course offered in alternate years; scheduled for 2012-2013.)
Prerequisites:Math 223.

362-363. Abstract Algebra.
Fall, Spring. Credits: 4-4.
An introduction to axiomatic algebraic structures. Topics include groups, subgroups, permutation groups, cyclic groups, normal subgroups, quotient groups, homomorphisms, isomorphisms, rings, integral domains, polynomial rings, ideals, quotient rings, fields, and extension fields. Additional topics may include finite fields, Galois theory, and advanced topics from linear algebra. (Course offered in alternate years; scheduled for 2012-2013.)
Prerequisites: For 362, Math 201 and Math 261. For 363, Math 362.

370. Complex Variables.
Spring. Credits: 4.
This course is an introduction to the theory of functions of a complex variable. Topics include complex numbers and their properties, analytic functions and the Cauchy-Riemann equations, complex logarithms, exponential and trigonometric functions, complex integration and the Cauchy integral formula, complex power series, the residue theorem, and applications to calculations of definite integrals. (Courses offered in alternate years; scheduled for 2011-2012.)
Prerequisites: Math 223.

386. Junior Seminar.
Spring. Credits: 1.
This course will prepare students for the Senior Seminar experience. Students will attend the Senior Seminar presentations, pursue independent readings, and prepare a Senior Seminar prospectus for approval by the faculty of the department.

431. Topology.
Spring. Credits: 4.
Topics selected from sets, functions, metric spaces, topological spaces, separation properties, compactness, connectedness, the Stone-Weierstrass theorem, mapping theorems, plane topology. (Course offered every third year; scheduled for 2012-2013.)
Prerequisites: Math 201 and Math 223.

455-456. Readings in Mathematics.
Fall, Spring. Credits: 1 to 4.
This course allows students to do advanced work not provided for in the regular courses. Its content will be fixed after consultation with the student and in accord with his or her particular interests.
Prerequisites: Permission of department chair.

460. Internship.
Fall, Spring. Credits: 1 to 4.
Internships in Mathematics, which are normally arranged by the Director of Career Services, permit a qualified student to receive academic credit for offcampus work experience. Upon completion of the internship, the student makes written and oral reports focusing on an integration of the student’s academic work and the internship project. Normally the course will be taken on a Pass/Fail basis; it does not count toward the requirements for the major or minor except with special approval of the department. Interested students should contact the Chair of the department and the Director of Career Services.

465. Special Topics in Mathematics.
Fall, Spring. Credits: 4.
An occasional offering of topics not covered in the existing mathematics courses. Examples of topics include: graph theory, Fourier analysis, measure theory, dynamical systems, matrix groups, foundations of mathematics, game theory, set theory, logic, non-Euclidean geometry, orbifold Euler characteristics, and operations research.

482. Combinatorics.
Fall. Credits: 4.
Topics selected from basic counting principles, Ramsey theory, the inclusion/ exclusion principle, recurrence relations, generating functions, partially ordered sets, systems of distinct representatives, combinatorial designs, graphs, directed graphs, partitions, combinatorial optimization, enumeration under group action, and an introduction to coding theory. (Course offered every third year; scheduled for 2011-2012.)
Prerequisites: Math 201 or permission of instructor.

485-486. Senior Seminar.
Fall, Spring. Credits: 2-2 or 4-0.
Students pursue individual projects supervised by members of the faculty. Seminar sessions focus on issues of effective written and oral presentation of mathematics. A student may pursue either a research project, in which the student carries out original research on a suitable topic of interest, or an expository project, demonstrating understanding of mathematics by exploring some topic of established mathematics which is not covered in a regular course. Students who pursue an expository project may complete the senior seminar requirement in either one semester (4 credits in the Fall) or two semesters (2 credits in the Fall, 2 credits in the Spring). Students pursuing a research project must complete the requirement over two semesters.

495-496. Honors Tutorial in Mathematics.
Fall, Spring. Credits: 4-4.
The Honors Tutorial provides an alternative to the Senior Seminar for qualified students who wish to pursue an original research project in greater depth than would be possible otherwise. Criteria for successful completion of an Honors project include originality, mathematical maturity, progress, and independence. Prerequisites: Permission of department chair.

COURSE OFFERINGS IN COMPUTER SCIENCE

103. Computer Science Demystified.
Fall. Credits: 4.
Degree Requirements: F6.
A broad introduction to computing appropriate for all students, regardless of intended major. This course introduces fundamentals of computers and computer information management primarily through projects that emphasize mastery of basic concepts, acquisition of skills, and logical reasoning. Concepts presented include computer data representation, an intro to architecture and how computers work, and basic network organization. Skills are developed to facilitate the use of a computer for communication and online research. Logical reasoning is fostered through working with models and abstraction, algorithmic thinking with an intro to programming, and critical evaluation of the use of computers and technology. Emphasis is on the development of a conceptual framework for further learning and problem-solving with computers, rather than on the use of specific software or hardware.

141. Computer Science I: Programming Fundamentals.
Fall, Spring. Credits: 4.
Degree Requirements: F6.
An introduction to the fundamental concepts and practices of procedural programming. Topics include data types, control structures, functions, arrays, files, and the mechanics of running, testing, and debugging. Emphasis is placed on program design and problem solving techniques. The course also includes an introduction to the historical and social context of computing and an overview of computer science as a discipline.

142. Computer Science II: Object-Oriented Programming.
Fall, Spring. Credits: 4.
Degree Requirements: F6.
An introduction to the fundamental concepts and practices of object-oriented programming. The object-oriented programming paradigm is introduced, with a focus on the definition and use of classes as a basis for fundamental objectoriented program design. Other topics include an overview of programming language principles, simple analysis of algorithms, basic searching and sorting techniques, and an introduction to software engineering issues.
Prerequisites: Computer Science 141.

172. Discrete Structures for Computer Science.
Fall. Credits: 4.
Degree Requirements: F6.
An introduction to and survey of the mathematics used in computer science including functions, relations, sets, counting, logic, Boolean algebra, proof techniques, induction, recursion, computational complexity, and computability. Other topics may be included as time permits.
Prerequisites: Computer Science 141.

231. Introduction to Systems Programming and Computer Organization.
Spring. Credits: 4.
A bottom-up exploration of the interaction between computer hardware and software. Topics begin with an introduction to digital logic, and continue through elementary processor design, to assembly language, machine data representation, and computer arithmetic. Other topics in contemporary computer architecture such as multicore processors and GPGPU’s may be discussed as time allows. Projects include hardware and simulated digital circuits as well as programs in assembly language.
Prerequisites: Computer Science 141.

241. Computer Science III: Data Structures and Algorithms.
Fall. Credits: 4.
An introduction to the fundamental concepts of data structures and the algorithms that arise from them, using the object-oriented design paradigm. Data structures covered include stacks, queues, linked lists, hash tables, trees, and graphs. Other topics include an introduction to iterative and recursive algorithmic strategies and basic algorithm analysis.
Corequisite: Computer Science 172 (unless already taken).
Prerequisites: Computer Science 142.

315. Networks and Security.
Fall. Credits: 4.
An introduction to two fundamental and related topics in computing: networked communication and computer security. Modern computers and computational devices are nearly always connected to some network; this course will introduce frameworks for understanding how this connection works. The openness with which computer networking began has allowed malicious entities of all sorts to prey upon computer users, so the course will also include a study of computer security as it interacts with networking. (Course offered in alternate years; scheduled for 2012-2013.)
Prerequisites: Computer Science 241.

320. Computer Graphics.
Spring. Credits: 4.
Coverage of the basic concepts of 2D and 3D graphics, including an overview of graphics hardware, use of a graphics application programming interface, user interface design, techniques for computer animation, and graphical algorithms such as geometric transformations, clipping, windowing, hidden surface removal, and raster graphics techniques for the representation of curves, surfaces, and solids. (Course offered in alternate years; scheduled for 2012-2013.)
Corequisite: Math 223 or Math 261 (unless already taken).
Prerequisites: Computer Science 241.

330. Operating Systems.
Fall. Credits: 4.
An introduction to the fundamentals of operating systems design and implementation. Topics include the process model and implementation of processes, an overview of the major components of a modern operating system, mutual exclusion and interprocess synchronization, a survey of scheduling algorithms, memory management techniques, and file systems. (Course offered in alternate years; scheduled for 2011-2012.)
Prerequisites: Computer Science 231.

350. Theory of Computation.
Spring. Credits: 4.
A study of theoretical models for computing. The hierarchy of finite state machines, pushdown machines, context free grammars, and Turing machines will be analyzed, along with their variations. The basic concepts of decidability, complexity theory, and NP-Complete problems will be introduced. (Course offered in alternate years; scheduled for 2011-2012.)
Prerequisites: Computer Science 172.

355. Advanced Algorithms.
Spring. Credits: 4.
An in-depth study of the design and analysis of advanced algorithms, including the performance tradeoffs and resources required by various algorithmic implementations. Major classes of computational problems will be identified and explored. Advanced data structures and approximation heuristics are introduced as required for solution design. Topics vary depending on the specific problems covered but will include the Master Theorem, dynamic programming, divide-and conquer and greedy algorithms. (Course offered in alternate years; scheduled for 2011-2012.)
Prerequisites: Computer Science 241.

360. Programming Languages.
Spring. Credits: 4.
A wide-ranging and in-depth coverage of fundamental programming language concepts, presenting design issues of the various language constructs, and examining the design choices for these constructs in a range of the most popular contemporary programming languages. Language design alternatives are examined and critiqued. Methods of syntax description, common approaches to describing the semantics of programming languages, and various implementation approaches are covered. (Course offered in alternate years; scheduled for 2011-2012.)
Prerequisites: Computer Science 241.

455-456. Readings in Computer Science.
Fall, Spring. Credits: 1 to 4.
This course allows students to do advanced work not provided for in the regular courses. Its content will be fixed after consultation with the student and in accord with his or her particular interests.
Prerequisites: Permission of department chair.

460. Internship.
Fall, Spring. Credits: 1 to 4.
Internships in Computer Science, which are normally arranged by the Director of Career Services, permit a qualified student to receive academic credit for offcampus work experience. Upon completion of the internship, the student makes written and oral reports focusing on an integration of the student’s academic work and the internship project. Normally the course will be taken on a Pass/Fail basis; it does not count toward the requirements for the major or minor except with special approval of the department. Interested students should contact the Chair of the department and the Director of Career Services.

465. Special Topics in Computer Science.
Fall, Spring. Credits: 4.
An occasional offering of topics not covered in the existing computer science courses. Examples of topics include artificial intelligence (search techniques, game playing, neural nets, machine learning, natural language processing) and database systems (relational, hierarchical and network databases, security, and synchronization).

485-486. Senior Seminar.
Fall, Spring. Credits: 1-4.
Fall term: This course lays the groundwork for the Spring Senior Seminar experience. Independent readings will be discussed and presented, and a Senior Seminar Project prospectus will be prepared and presented for approval by the faculty of the department. Spring term: This course comprises an in-depth exploration of the principles and techniques of analysis and design of software systems from an object-oriented perspective. Design patterns, a diagrammatic modeling language, and standard techniques of computer software specification, implementation, testing, and documentation will be explored and used as tools by students working in teams. Each team will produce a robust, scalable, and maintainable large-scale system based on the project proposal completed in CS 485. The Senior Seminar sequence is meant to emphasize the unity and power of computer science by applying and extending ideas drawn from the courses required for all Computer Science majors. All participants will make several oral presentations.
Prerequisites: Senior standing in the Computer Science major.

495-496. Honors Tutorial in Computer Science.
Fall, Spring. Credits: 4 to 8.
Prerequisites: Permission of department chair.