St. Lawrence University                                Mathematics, Computer Science and Statistics

Courses

Mathematics Courses
Computer Science Courses
Schedules
Major & Minor Requirements
To view the Semester Course Schedule, TA Schedule and the Final Exam Schedule click on Schedules.
Mathematics Course Descriptions
Note: Click on the link below to view the course description or scroll down.
MA 110
MA 134
MA 213
MA 305
MA 318
MA 327
MA 351
MA 489
MA 111
MA 135
MA 217
MA 306
MA 323
MA 328
MA 352
MA 498
MA 113
MA 136
MA 226
MA 315
MA 324
MA 330
MA 370

MA 115
MA 205
MA 230
MA 316
MA 325
MA 333
MA 380

MA 123
MA 206
MA 280
MA 317
MA 326
MA 343
MA 395

MA 110
 Concepts of  Mathematics
An introduction to significant ideas of mathematics, intended for students who will not specialize in mathematics or science. Topics are  chosen to display  historical perspective, mathematics as a universal language and as an art and  the logical structure of mathematics. This  course is intended for non-majors; it  does not count toward either the major or minor in mathematics and students  who have passed a calculus course. 
(Math 135, 136 or 205) may not receive course credit for Math 110.
               
MA 111  Mathematics of  Decision-Making
Recently developed and extremely useful techniques in decision-making  processes are examined and implemented. Problems such as maximizing profits, minimizing costs and efficient allocation of resources are studied using techniques of linear and non-linear programming.   Applications of graph theory, network analysis (PERT-CPM) and dynamic programming may also be discussed. This course may be useful  for students intending to pursue graduate study in economics or business administration.
This course does not count toward the major in mathematics.
                    
MA 113  Applied Statistics 
An introduction to statistics with emphasis on applications. Topics include description of data, elementary probability theory, sampling, estimation, hypothesis testing, analysis of variance, regression and chi-square tests.
                    
MA 115   Mathematical Modeling of the Environment 
To understand our environment better, we construct simple models to describe complex situations and predict the consequences of our  actions.  This course introduces some techniques of mathematical modeling as applied to contemporary environmental issues. This course is  intended for non-majors; it does not count toward either the major or minor in mathematics and students who have passed a calculus course  (Math 135, 136 or 205) may not receive course credit for Math 115.
            
MA 123
 Mathematics and Art
This course explores the connections between mathematics and art: how mathematics can provide a vocabulary for describing and explaining  art; how artists have used mathematics to achieve artistic goals, and how art has been used to explain mathematical ideas.  This course is  intended for non-majors; it does not count toward either the major or minor in mathematics.
                  
MA 134   Functions, Relations and Introductory Analytic Geometry 
A development of skills and concepts necessary for the study of calculus. 
Topics include the algebraic, logarithmic, exponential and trigonometric functions; Cartesian coordinates and the interplay between algebraic and geometric problems; functional equalities and inequalities and their graphs. This course is intended for students whose background in  high school was not strong enough to prepare them for calculus; it does not count for distribution credit or for the major or minor in  mathematics.     Students who have passed a calculus course (Math 135, 136 or 205) may not receive course credit for Math 134. Offered fall semester  only.
                  
MA 135  Calculus I 
An introduction to the subject, intended primarily for students in mathematics, science, economics or basic engineering. Topics include limits;  continuity and differentiability of real-valued functions of a single variable; derivatives; graphing and optimization problems;  anti-differentiation.
                    
MA 136  Calculus II 
A continuation of Calculus I.  Topics include Riemann sums and the definition of the definite integral; techniques of integration; approximation techniques; improper integrals; applications and related topics. 
Prerequisite: Math 135 or the equivalent.
                    
MA 205  Multivariable Calculus 
Topics include sequences, series, the calculus functions with several variables, vector-valued functions.
Prerequisite: Math 136 or the equivalent.
                       
MA 206
 Vector Calculus
A direct continuation of Math 205, the main focus of this course is the study of smooth vector fields on Euclidean spaces and their associated line and flux integrals over parameterized paths and surfaces. The main objective is to develop and prove the three fundamental  integral theorems of vector calculus: the Fundamental Theorem of Calculus for Line Integrals, Stokes' Theorem and the Divergence  Theorem. 
 Prerequisite: Math 205.
            
MA 213 Applied Statistics II 
A continuation of Math 113 intended for students in the physical, social or behavioral sciences. Topics are chosen from among multiple  linear regression, principles of experimental design, analysis of variance, analysis of residuals, and nonparametric procedures. A thorough introduction  to the use of a statistical computer package is also included.   
Prerequisite: Math 113 or permission of instructor.
                        
MA 217 Linear Algebra 
A study of finite dimensional linear spaces, systems of linear equations, matrices, determinants, bases, linear transformations, change of bases and eigenvalues.
                       
MA 226
Design and Analysis of Experiments
An introduction to the statistical design and analysis of experiments.  This course will cover the basic elements of experimental design
including randomization, blocking and replication.  Topics will include completely randomized design, randomized complete block design, Latin Square and factorial designs.  Analysis of variance techniques will be extensively discussed for analyzing data collected using these methods.  Through use of a statistical software package will be incorporated into the course.
Prerequisite:  Math 113 or Economics 200 or permission of instructor.
                   
MA 230 Differential Equations 
An introduction to the various methods of solving ordinary and partial differential equations. The types of equations considered include first orderordinary equations, second order ordinary linear equations and elementary partial differential equations. Topics covered include the  Laplace transform, numerical methods, power series methods, systems of equations and an introduction to partial differential equations.    Applications are presented. 
Prerequisite: Math 136
                      
MA 280 A Bridge to Higher Mathematics 
This course is designed to introduce students to the concepts and methods of higher mathematics. Techniques of mathematical proof are emphasized.  Topics covered include set theory, relations, functions, countable and uncountable sets and additional topics as selected by the instructor.
                  
MA 305 Real Analysis
A rigorous introduction to fundamental concepts of real analysis. Topics may include: sequences and series, power series, Taylor series and  the calculus of power series; metric spaces, continuous functions on metric spaces, completeness, compactness, connectedness; sequences   of   functions, pointwise and uniform convergence of functions. 
Prerequisites: Math 205 and 280. Offered fall semester.
                       
MA 306
Complex Analysis
Topics include algebra, geometry and topology of the complex number field, differential and integral calculus of functions of a complex variable.  Taylor and Laurent series, integral theorems and applications. 
Prerequisites: Math 205 and Math 280.  Offered spring semester.  Previously offered as Math 404.
                 
MA 315 Group Theory
An introduction to the abstract theory of groups. Topics include the structure of groups, permutation groups, subgroups and quotient groups. 
Prerequisite: Math 280.
               
MA 316
 
 

 

Ring Theory
An introduction to the abstract theory of algebraic structures including rings and fields. Topics may include ideals, quotients, the structure of  fields, Galois theory. 
Prerequisite: Math 280.
                        
MA 317 Mathematical Logic
An introduction to modern mathematical logic, including the most important results in the subject. Topics include propositional and predicate  logic; models, formal deductions and the Gödel Completeness Theorem; applications to algebra, analysis and number theory; decidability  and the Gödel Incompleteness Theorem. Treatment of the subject matter is rigorous, but historical and philosophical aspects are discussed. 
Prerequisite: Math 280. Also offered as Philosophy 317.
                    
MA 318 Graph Theory
Graph theory deals with the study of a finite set of points connected by lines.  Problems in such diverse areas as transportation networks,  organizational structure, chemical bonds, allocation and distribution of good and services, genealogical family trees, group structure in  psychology and sociology, tournaments and electrical circuit analysis can be formulated and solved by the use of graph theory.   Also offered as CS 318.
 Prerequisite: Math 217 or 280 or permission of instructor.
                          
MA 323 History of Mathematics
This course is given on a seminar basis. Primarily for juniors and seniors. 
Prerequisite: permission of instructor.
                      
MA 324 Numerical Analysis
Finite differences, interpolation, numerical integration and differentiation,  numerical solution of differential equations and related subjects. 
Prerequisites: Math 217 and knowledge of a programming language.
                        
MA 325 Probability
The first semester treats the theory of probability and random variables, discrete and continuous distributions, mathematical expectations  and limit theorems.  Math 205.
                   
MA 326
Mathematical Statistics
Following Math 325, this course deals with estimation of parameters, properties of estimators, and topics of statistical inference including tests of hypotheses, confidence intervals, simple and multiple linear regression and analysis of variance. 
After successful completion of the Math 325-326 sequence, a student is ready to take the first actuarial examination. 
Prerequisite: Math 325.
                 
MA 327
Optimization Theory I
A mathematical treatment of problems such as maximizing profits, minimizing costs, shipping goods, assigning manpower in an optimal way and designing winning game strategies. Topics for the first semester are selected from general linear programming, simplex method, duality theory, decision theory and games, two-person zero-sum games, matrix games, game theory and linear programming; applications. 
Prerequisite: Math 205.
                         
MA 328 Optimization Theory II
A continuation of Math 327, topics in the second semester may include non-linear programming, constrained-unconstrained problems;  Kuhn-Tucker conditions; and saddle point theory. This course may be useful for students intending to pursue graduate study in economics or business administration. 
Prerequisite: Math 327 or permission of instructor.
                       
MA 330 Differential Equations II
This course continues the study of differential equations from Math 230.  The study considers higher order equations, systems of equations, Sturm-Liouville problems, Bessel’s equation and partial differential equations.  Existence and uniqueness theorems and ordinary and singular points are discussed and applications are given. 
Prerequisites: Math 217 and 230.
                     
MA 333 Mathematical Methods of Physics
Important problems in the physical sciences and engineering often require powerful mathematical methods for their solution. This course provides an introduction to the formalism of these methods and emphasizes their application to problems drawn from diverse areas of classical and modern physics. Representative topics include the integral theorems of Gauss and Stokes, Fourier series, matrix methods, selected techniques from the theory of partial differential equations and the calculus of variations with applications to Lagrangian mechanics.   The course also introduces students to the computer algebra system Maple as an aid in visualization and problem solving. 
Prerequisites: Math 205 and Physics 152.   Also offered as Physics 333.
                  
MA 343 Time Series Analysis
Statistical methods for analyzing data that vary over time are investigated.  Topics include forecasting systems, regression methods, moving averages, exponential smoothing, seasonal data, analysis of residuals, prediction intervals and Box-Jenkins models. Application to real data, particularly economic data, are emphasized along with the mathematical theory underlying the various models and techniques.  
Prerequisite: Math 136 or permission of the instructor.   Also offered as Economics 343.
                   
MA 351 Theory of Numbers
The theory of numbers deals with the integers. Some of the topics are divisibility, simple and continued fractions, congruences, quadratic residues, and Diophantine equations. 
Prerequisite: Math 280.
              
MA 352 Non-Euclidean Geometry
An elementary treatment of the hyperbolic plane geometry of Bolyai and Lobachevsky with an introduction to elliptic geometry. Synthetic methods are used primarily and the historical development is also considered. Coverage includes non-Euclidean measures of arcs and lengths, introduction to non-Euclidean trigonometry, consistency of non-Euclidean geometry. 
Especially recommended for prospective secondary school teachers.
                 
MA 370
 
 

 

Topology
An introduction to topology. Various topics may include the general notion of a topological space, subspaces, metrics, continuous maps, connectedness, compactness, deformation of curves (homotopy) and the fundamental group of a space. 
Prerequisite: Math 280.
                  
MA 380
Theory of Computation  
This course fosters a depth of understanding of the basic theoretical underpinnings of computer organization and programming. Students will   learn the Chomsky hierarchy of languages and how to design various classes of automata to recognize computer languages. Application of  mathematical proof techniques to the study of automata and grammars enhances students' understanding of both proof and language. Students will learn to communicate their new understanding through a combination of written assignments and class presentations.   Also offered as CS 380.
            
MA 395 College Geometry
A consideration of some advanced topics in plane geometry from a historical perspective. Euclidean plane geometry is reviewed through a study of constructions in the plane and extended through space geometry and the geometry of the sphere, Euclidean transformations in the plane, the nine-point circle, circle of Apollonius and a brief introduction to non-Euclidean geometry through the Saccheri quadrilateral. 
Especially recommended for prospective secondary school teachers.
             
MA 489 Senior Project for Majors
Permission required.
         
MA 498 Honors Project For Majors
Permission required.
    
Computer Science Course Descriptions
Note: Click on the link below to view the course description or scroll down.
CS 105
CS 220
CS 318
CS 332
CS 362
CS 374
CS 489
CS 140
CS 289/290
CS 319
CS 334
CS 364
CS 380
CS 498
CS 219
CS 317
CS 324
CS 348
CS 370
CS 389\390

 
CS 105 Concepts in Computation
This course will introduce students to problem solving in a technological environment. Problems will be chose from among a variety of application areas, including the Word Wide Web, spreadsheets, computer graphics and high-level computer programming languages. There will be discussion of issues relating to technology's impact on society, to include ethical and legal  issues. 
Students who have passed Computer Science 140 or 219 may not receive course credit for this course.
                      
CS 140
 

 

Introduction to Computer Programming
This course gives students an introduction to programming using a high-level language,  with emphasis on problem-solving and algorithm
development.  Computer programming skills are enhanced through individual student  projects.
         
CS 219 Techniques of Computer Science
An in-depth look at computing and programming using high-level languages.  Topics include advanced programming techniques and efficient algorithms for the solution of problems on a computer. Students complete a large programming project. 
Prerequisite: CS 140 or the equivalent.
                              
CS 220 Computer Organization
Topics include data representations, digital circuits, the organization of CPUs, machine language, and an introduction to assembly language 
programming. Prerequisite: CS 219.  Offered spring semester only.
                     
CS  289, 290 Independent Projects in Computer Science
Permission required.
                           
CS 317 Mathematical Logic  also offered as Mathematics  317
Click on the title to view the description
                    
CS 318 Graph Theory   also offered as Mathematics 318
Click on the title to view the description
                  
CS 319 Data Structures
Techniques and algorithms for the organization, representation and processing of data on the computer. Topics include strings, lists, stacks, queues, trees and graphs, as well as their applications.
Prerequisite: CS 219.   Offered fall semester.
              
CS 324 Numerical Analysis   also offered as Mathematics 324
Click on the title to view the description
                  
CS 332 Programming on the World Wide Web
The World Wide Web provides a unique computing environment.  The course will 
 introduce students to the terminology of the Web and the Hypertext Markup Language  (HTML) as well as concepts of distributed computing including client-side and  server-side programming.  Small, concept-focused assignments give students a range of  experience writing Web pages and programs to produce Web pages.   Students will then  have considerable freedom to select a larger group project that they will complete and present to the class.  A term paper on a technical aspect of the World Wide Web is also  expected.
                      
CS 334 Distributed Computing
Distributed systems, collections of communicating computing devices, are of great and growing importance in the modern world; collections as  diverse as the parts of VLSI chip, clustered computers, and even the Internet are an example of distributed systems.  This course will foster an  understanding of the algorithms used to permit distributed computing devices to coordinate their activity across space and time.  Students will see  these algorithms first-hand by implementing a series of increasingly challenging distributed programming projects.
Prerequisites:  CS 319, CS 220.
              
CS 348 Special Topics In Computer Science:   Software Engineering
Software Enginering is the study of a systematic, disciplined, quantifiable approach to the development, operation, and maintenance of large scare  softwaare systems.   This course examines an object oriented process of developing larege scale software systems.  Specifically, This course will address the fundamental  objecat oriented techniques, concepts, and tools used throughout the software life cycle.  Topics include analysis, specification, design, testing and  delivery of large scale software systems.  Students will work in small teams and develop a sizeable semeser long project.
             
CS 362 Algorithm Analysis
 Students learn techniques and methods for designing, analyzing and testing the efficiency and performance of computer algorithms. The course also includes an introduction to the theory of polynomial reducibility. 
Prerequisite: CS 319 and Mathematics 280.
        
CS 364 Programming Languages
This course consists of two parts: a comparison of various computer languages, their uses and a study of the concepts and organization of  computer languages. 
Prerequisite: CS 220 Or CS 319.
   
CS 370 Systems Programming
An introduction to computer system design and use. Topics may include assemblers, interpreters, compilers, loaders, macroprocessors and operating systems. 
Prerequisite: CS 220.
       
CS 374 Artificial Intelligence
This course introduces the concepts and uses of artificial intelligence.  Possible topics include search strategies, natural language processing, expert systems, neural nets, and robotics. 
Prerequisite: CS 319.
   
CS 380
Theory of Computation  
This course fosters a depth of understanding of the basic theoretical underpinnings of computer organization and programming. Students will   learn the Chomsky hierarchy of languages and how to design various classes of automata to recognize computer languages. Application of  mathematical proof techniques to the study of automata and grammars enhances students' understanding of both proof and language. Students will learn to communicate their new understanding through a combination of written assignments and class presentations. 
Prerequisite: CS 319.  Also offered as Mathematics 380.
       
CS 389, 390 Independent Projects in Computer Science
Permission required.
       
CS 489
Senior Project for Majors
Permission required.
             
CS 498 Honors Project for Majors
Permission required.
      

Updated:  Februa;ry 25, 2005
Maintained by: P. Barkley
Created by: P. Barkley & A. Ang