Academics

Mathematics and Computer Science > Course Descriptions

MATH 103 The Nature of Mathematics
Intended for students with primary interests in the humanities and social sciences. The course uses set theory, logic, and language as a foundation for studying a variety of topics central to the development of modern mathematics. Emphasizing the central role of language in mathematics, the course shows that mathematics is about communication of ideas. Topics will be explored through experimentation with computers where appropriate using games, puzzles, and group projects as well as lectures and discussions. Additional topics include codes and basic geometry. The course will focus on the interplay of different ideas.

MATH 104 Elementary Mathematics from an Advanced Standpoint
(Cross-listed as Education 104.)

MATH 105 Elementary Functions
Properties of functions with emphasis on polynomial, exponential, logarithmic, and trigonometric functions. Analytic geometry. (Does not meet GEC Natural and Mathematical Sciences Requirement.)

MATH 110 Calculus I
The calculus of functions of one variable. Limits, continuity, differentiation, and applications; a brief introduction to integration. Prerequisite: 3.5 years of high school mathematics (to include trigonometry) or Mathematics 105.

MATH 111 Calculus II
The calculus of functions of one variable. Integration, applications of integration, sequences, and series. Prerequisite: Mathematics 110.

MATH 115 Honors Calculus I
Theory and applications of the calculus of  functions of one variable. Limits, continuous functions, differentiable functions, the definite integral, and applications. Prerequisite: permission of the instructor.

MATH 116 Honors Calculus II
Continuation of Mathematics 115. Integration and applications, sequences, infinite series. Prerequisite: permission of the instructor.

MATH 150 Introduction to Probability and Statistics
Designed for students in the social and life  sciences. Discrete probability theory, distributions, sampling, correlation, and regression, Chi square and other tests of significance. Emphasis on the use of the computer as a tool and on applications to a variety of disciplines. (Not open to students who have taken Economics/ Business 180).

MATH 160 Finite Mathematics  with Applications
Mathematical topics as needed to build and solve mathematical models of situations in the life, social, and managerial sciences. Topics chosen from basic probability theory; vectors, matrices, and Markov chains; linear programming; mathematics of finance; and game theory.

MATH 161 Mathematical Modeling in the Natural and Social Sciences
Mathematical topics as needed to build and solve mathematical models of situations in the life, environmental, and economic sciences.  Topics covered include discrete dynamical systems, difference equations, linear, quadratic, and exponential growth models, the logistic model, and examples of chaos in dynamical systems.

MATH 195 The Mathematics of Games and Gambling (Offered Less Frequently)
This course introduces and develops some of the important and beautiful “elementary” mathematics needed for rational analysis of various game and gambling activities. Topics treated include permutations and combinations, probability, expectation, the binomial distribution, elementary game theory, power indices, and the gambler’s ruin. Social and historical issues related to gambling will also be considered along with a variety of hands-on gaming activities, but the primary emphasis will be on the understanding and application of the mathematics behind these activities.

MATH 198 Mathematics in Civilization (Offered Less Frequently)
Mathematics has played a major role in the development of Western civilization. This course investigates how important mathematical subjects such as algebra and geometry arose out of such diverse activities as science, commerce, and art. Our approach will be historical, and our journey will take us from the development of number systems in the ancient Middle East nearly 4,000 years ago to the use of non-Euclidean geometry to describe the universe in the twentieth century.

Selected topics from affine, Euclidean, non-Euclidean, projective, and differential geometry. Prerequisite: Mathematics 230 or permission of the instructor.

MATH 210 Multivariable Calculus
Partial differentiation, the algebra and calculus of vectors, curves and their parameterization, multiple integration, Stokes’s and Green’s  theorem, and applications. Prerequisite: Mathematics 111.

MATH 211 Mathematics of Chaos (Offered Less Frequently)
A study of nonlinear dynamical systems, including iteration of functions, attracting and repelling periodic orbits, bifurcation, the period doubling route to chaos, complex dynamics, fractals, and Mandelbrot and Julia sets. Real-world implications and applications of chaos. Can meet the requirements for a 300-level-or-above mathematics course on completion of an additional project approved by the instructor. Prerequisite: Mathematics 111.

MATH 214 Differential Equations
Differential equation models, analytic solution techniques, qualitative solution concepts, and computer visualization for single equations and systems. Applications of differential equations. Prerequisite: Mathematics 210 or permission  of the instructor.

MATH 230 Introduction to Abstract  and Discrete Mathematics
Topics covered include logic and proofs, set theory, relations, cardinal numbers, countable and uncountable sets, permutations and combinations, graph theory, and group theory. Prerequisite: Mathematics 110.

MATH 231 Linear Algebra
Vector spaces, linear independence, linear transformations, matrices, determinants, and applications to geometry. Prerequisite: Mathematics 230 or permission of the instructor.

MATH 260 History of Mathematics  (Offered Less Frequently)
A survey of the important concepts of mathematics from the time of the Babylonians to the present. Emphasis will be on the evolution of mathematical ideas and the contributions of the most prominent individuals associated with the development of mathematics. Prerequisite: Mathematics 111 or permission of the instructor.

MATH 310 Complex Analysis
Study of functions of one complex variable. Analytic functions, complex integration, Cauchy’s theorem, complex power series, and special functions. Applications to other areas of mathematics and to mathematical physics. Prerequisites: Mathematics 210 and 230 or permission of the instructor.

MATH 311 Introduction to Real Analysis
A rigorous course covering the following introductory real analysis topics: axioms for the real numbers, sequences, boundedness, limits, monotone functions, continuity, uniform continuity, Cauchy criterion for convergence, cluster points, compactness, differentiability, integration, and infinite series. Prerequisites: Mathematics 210 and 230.

MATH 314 Numerical Analysis  (Offered Less Frequently)
Linear and polynomial interpolation, finite differences, matrix methods. Solution of equations and systems of equations. Numerical differentiation, integration, and solutions of differential equations. Algorithms and computer applications. Prerequisites: Mathematics 111, 231, and Computer Science 112. (Cross-listed as Computer Science 314.)

MATH 320 Mathematical Methods  (Offered Less Frequently)
(Cross-listed as Physics 320.)

MATH 323 Cryptography
(Cross-listed as Computer Science 323.)

MATH 329 Number Theory
Mathematical induction, divisibility properties of integers, prime numbers, and congruences. Prerequisite: Mathematics 230 or permission of the instructor.

MATH 330 Modern Algebra I
A study of algebraic structures with emphasis on groups, rings, and fields. Prerequisite: Mathematics 230.

MATH 331 Modern Algebra II
Additional topics in modern or linear algebra such as field extensions, Galois Theory, group conjugacy, modules, eigenvalue theory, dual spaces, and unitary spaces. Prerequisite: Mathematics 330 or permission of the instructor.

MATH 340 Geometry  (Offered Less Frequently)
Selected topics from affine, Euclidean, non-Euclidean, projective, and differential geometry. Prerequisite: Mathematics 230 or permission of the instructor.

MATH 350 Mathematical Probability
Discrete and continuous probability. Distributions, the law of large numbers, the central limit  theorem, random variables, and generating functions. Prerequisites: Mathematics 210  and 230 or permission of the instructor.

MATH 351 Mathematical Statistics
A mathematical study of such topics as estimation of parameters, confidence intervals and tests of hypotheses, decision theory, regression, analysis of variance, and nonparametric methods. Prerequisite: Mathematics 350.

MATH 360 Mathematical Modeling and Computer Simulation (Offered Less Frequently)
(Cross-listed as Computer Science 360.)

MATH 365 Algebraic Coding Theory (Offered Less Frequently)
A study of the algebraic structure of codes designed to transmit messages through a noisy channel in an efficient and relatively error-free fashion. Topics include finite-dimensional vector spaces over a finite field and the connection between coding theory and areas such as geometry, combinatorics, and number theory. Prerequisite: Mathematics 231 or permission of the instructor. (Cross-listed as Computer Science 365.)

MATH 375 Combinatorics and Graph Theory
Enumeration techniques with emphasis on  permutations and combinations, generating functions, recurrence relations, inclusion and exclusion, and the pigeonhole principle. Graph theory with emphasis on trees, circuits, cut sets, planar graphs, chromatic numbers, and transportation networks. Additional topics from designs with emphasis on Latin squares, finite projective and affine geometries, block designs, and design of experiments. Prerequisite: Mathematics 230. (Cross-listed as Computer Science 375.)

MATH 410 Topology  (Offered Less Frequently)
Point set topology. Such topics as topological spaces, separation axioms, covering properties, metrization, convergence and completeness, and homotopy theory. Prerequisite: Mathematics 230.

MATH 411 Topics in Modern Analysis (Offered Less Frequently)
Introductory notions of functional analysis. Banach spaces, integration and measure, Hilbert spaces, and commutative Banach algebras.

MATH 434 Theory of Computation
(Cross-listed as Computer Science 434.)

MATH 499 Great Theorems of Mathematics
Seminar course to introduce students to various masterpieces in the development of mathematics. Some of the most historically important proofs and ingenious logical arguments from mathematics will be presented and discussed. An emphasis will be placed on the interconnectedness among various subject areas within mathematics. Prerequisite: permission of the instructor. (Meets GEC Senior Studies Requirement.)

CSCI 107 Introduction to Programming for Interactive Web Sites
A broad exploration of the technologies associated with Web programming for those who do not plan to pursue further course work in computer science. Assumes no prior programming experience. Topics include Internet history and its basic architecture, managing an account on a Web server, HTML markup (text, images, links), design issues (HTML tables vs. HTML Frames), use of style sheets (CSS), introduction to the client-server model, HTML forms, JavaScript control structures, the document object model (DOM), and using JavaScript to manipulate the DOM and process HTML forms. Please note: This is a general audience course intended for those who have limited computer background; this course does not count toward the major or minor in Computer Science or Mathematics. Prerequisite: General familiarity with computer files and folders, word processing, and surfing the Web with a browser.

CSCI 112 Introduction to Object-Oriented Programming
Introduction to modern object-oriented programming and design, using Java. The goal is to see problem solving in a new light, namely using objects. Topics include the basic building blocks of problem solving (sequence, selection, repetition), followed by classes, objects, data structures and algorithms. A prior knowledge of computer programming is not required, although a strong background in Mathematics or Logic is recommended. Students may receive credit for this course based on the AP computer science exam (Java version).

CSCI 212 Computer Science I
Introduction to computer science, using Java. Basic data structures, algorithms, and algorithm analysis. Topics include dynamic memory allocation, dynamic arrays, lists, sorting, searching, and the application of advanced object-oriented design to data structures and algorithms. Prerequisite: Computer Science 112.

CSCI 213 Introduction to Computer Architecture
Computer architecture, modern CPU design, memory layout, assembly language programming, addressing techniques, input/output techniques, and interfacing with high-level languages. Prerequisite: Computer Science 112.

CSCI 214 Principles of Digital Logic
Basic logic, digital electronics, microcomputer architecture, and interfacing, with hands-on laboratory activity. Prerequisite: Computer Science 213.

CSCI 217 Computer Science II
Continuation of Computer Science I, using Java. Emphasis on advanced data structures and algorithms. Topics include linked data structures, trees, graphs, recursion, algorithms, and algorithm analysis. Prerequisite: Computer Science 212.

CSCI 260 Symbolic Logic
An introduction to propositional and predicate logic. Topics include formal semantics, translation, natural deduction, quantification theory, and completeness. The relevance of logic to computer theory and artificial intelligence is stressed. (Cross-listed as Philosophy 265.)

CSCI 312 Client-Server Web Applications
An in-depth study of building Web applications using the client-server model. Topics include  an overview of HTML and HTML forms for collecting user data, client-server interaction, CGI programming, storage and manipulation of server data using databases, and returning dynamic content to the client. Preprocessed HTML documents with PHP or Java Server Pages and Web session control with cookies and other useful objects. Additional topics may include the distributed object framework, XML for data extensibility, and an overview of Microsoft’s Active Server Pages (ASP) and .NET platform for distributed Web applications. Prerequisite: Computer Science 212.

CSCI 314 Numerical Analysis  (Offered Less Frequently)
(Cross-listed as Mathematics 314.)

CSCI 318 Programming Languages
A study of different programming languages and their paradigms (or styles). Topics include imperative vs. functional vs. event-driven vs. declarative programming, typing, memory organization, scope, and lifetime management. Lab exercises focus on programming in the various paradigms; students can expect to program in languages like ML, Visual Basic, and SQL. Prerequisite: Computer Science 212.

CSCI 323 Cryptography
An introduction to cryptology and cryptanalysis, the making of codes and the breaking of codes. History and basic concepts. Classical ciphers  and attacks on classical ciphers. One-time Pad. Modern ciphers including DES, AES. Public key ciphers including RSA and Diffie-Hellman.  Digital signatures. Additional topics may include Elliptic Curve systems, knapsack systems, and other cryptographic systems. Prerequisites: Mathematics 230 and Computer Science 212, or permission of the instructor. (Cross-listed as Mathematics 323.)

CSCI 336 Operating Systems and Systems Programming
An introduction to modern operating systems and their most important features. Topics include multiprocessing, virtual memory, multithreading, concurrency, I/O, networking, security, and distributed computing. Students construct a major component of an operating system in C or C++. Prerequisites: Computer Science 212 and 213.

CSCI 360 Mathematical Modeling and Computer Simulation (Offered Less Frequently)
Introduction to the process and techniques of modeling actual situations using mathematical methods and computer simulation. Topics may include optimization, dynamical systems, axiom systems, queuing theory, and introduction of a simulation language. Team projects and reports. Prerequisites: Mathematics 111, Computer Science 212, and some additional sophistication in at least one of the following: mathematics, computer science, or applying mathematics in a field of interest. (Cross-listed as Mathematics 360.)

CSCI 365 Algebraic Coding Theory  (Offered Less Frequently)
(Cross-listed as Mathematics 365.)

CSCI 375 Combinatorics and Graph Theory
(Cross-listed as Mathematics 375.)

CSCI 417 Algorithms and Algorithm Analysis
The study of algorithms and their mathematical analysis. Divide-and-conquer, greedy, brute-force, dynamic programming, backtracking, advanced tree and graph algorithms, big-O notation, case and amortized analysis. Prerequisites: Mathematics 230 and Computer Science 217.

CSCI 425 Artificial Intelligence
An introduction to AI via topics including tree and graph searches, min-max methods, alpha-beta pruning, heuristics, backtracking, natural language processing, and computer vision. Prerequisite: Computer Science 217.

CSCI 427 Introduction to Database Systems
An in-depth study of proper methods of design for database systems, with an emphasis on the relational model. Topics include relational design, query languages, and transactional processing. Lab exercises focus on GUI-driven, SQL-based access as well as modern, multi-tier styles of design. Prerequisite: Computer Science 217.

CSCI 434 Theory of Computation
Fundamental conceptual, theoretical, and philosophical ideas from computer science. Formal languages, finite state automata, and Kleene’s theorem. Formal grammars, pushdown automata, and context-free languages. Turing machines, computability, and Church’s thesis. Decidability, unsolvability, and NP- completeness. Prerequisite: Mathematics 230. (Cross-listed as Mathematics 434.)

CSCI 461 Compiler Design
An introduction to the design and construction of compilers for modern programming languages. Topics include grammars, formal language definition, abstract syntax trees, symbol tables, syntax and semantic checking, code generation, and optimization. Students construct a modern compiler for an object-oriented programming language. Prerequisites: Mathematics 230 and Computer Science 213 and 217.

CSCI 488 Senior Seminar in  Computer Science
A seminar-like discussion of software engineering, object-oriented design, and large-scale software development. Students will practice modern software engineering as well as read and present papers concerning the subject. Prerequisites: Computer Science 217, 318, and permission of the instructor. (Meets GEC Senior Studies Requirement.)

CSCI 489 Advanced Topics in  Computer Science
Special topics and projects in computer science, including but not limited to distributed systems, secure computing, Web development, user-interface design, and software engineering. Prerequisites: Computer Science 217, 318, and permission of the instructor. (Meets GEC Senior Studies Requirement.)