Mathematics & Computer Science  
2009-10 Courses

Course descriptions are listed below for the courses numbered 300 and above. For descriptions for the 100- and 200-level courses, see the catalog descriptions for computer science or mathematics.

Computer Science — Fall 2009

CSCI 135Robotics Explorations Studio FerrerTR 9:10-11:00MCAcx 118
CSCI 135Robotics Explorations Studio BurchMW 8:10-10:00MCAcx 118
CSCI 150Foundations of Computer Science I BurchMWF 2:10-3, R 2:40-3:30MCRey 315
CSCI 151Foundations of Computer Science II LeonardMWF 2:10-3, R 2:40-3:30MCRey 317
CSCI 250Programming Practicum FerrerMWF 8:10-9:00MCRey 317
CSCI 335Artificial Intelligence FerrerTR 1:15-2:30MCRey 317
An introduction to the design, analysis, implementation, and application of classical and contemporary algorithms in artificial intelligence, with an emphasis on the development of complete, embodied intelligent agents. Topics will include symbolic planning, robot programming under both subsumption and hybrid paradigms, automated theorem proving, intelligent game-playing programs, rule-based systems, genetic algorithms, neural networks, and machine learning. Prerequisite: Any CSCI course listed 200 or above.
CSCI 380Theory of Computation CollinsMWF 10:10-11:00MCRey 317
Covers basic topics in automata, computability, and complexity theory, including: models of computation (finite automata, Turing machines and RAMs); regular sets and expressions; recursive, r.e., and non-r.e. sets and their basic closure properties; complexity classes; determinism vs. non-determinism, with and without resource bounds; reductions and completeness; practice with NP- and P-completeness proofs; and the complexity of optimization and approximation problems. Prerequisite: MATH 240.

Computer Science — Spring 2010

CSCI 135Robotics Explorations Studio LeonardWF 8:10-10:00MCAcx 118
CSCI 150Foundations of Computer Science I BurchMWF 9:10-10, R 8:10-9MCRey 315
CSCI 151Foundations of Computer Science II FerrerMWF 10:10-11, R 12:10-1MCRey 317
CSCI 230Computing Systems Organization BurchTR 9:45-11:00MCRey 315
CSCI 280Algorithms FerrerMWF 9:10-10:00MCRey 317
CSCI 340Database Systems BurchMWF 11:10-12:00MCRey 317
Introduction to the theoretical and practical aspects of database management systems. Emphasis is on the relational data model. Topics covered include query languages, relational design theory, file structures, and query optimization. Prerequisite: Any CSCI course listed 200 or above.
CSCI 420Operating Sys & Concurrent Cmp LeonardTR 1:00-2:15MCRey 317
Basic principles of modern operating systems design: emphasis on concurrency including problems (nondeterminism), goals (synchronization, exclusion) and methods (semaphores, monitors); resource management including memory management and processor scheduling; file systems; interrupt processing; multithreaded programming. Prerequisite: CSCI 230.

Mathematics — Fall 2009

MATH 115Mathem in Contemporary Issues SemeTR 8:15-9:30MCRey 110
MATH 115Mathem in Contemporary Issues SemeTR 9:45-11:00MCRey 110
MATH 120Functions and Models BarelMWF 10:10-11:00MCRey 110
MATH 120Functions and Models NailMWF 11:10-12:00MCRey 110
MATH 130Calculus I WoodMWF 10:10-11, R 1:10-2MCRey 315
MATH 130Calculus I CampbellMTWF 11:10-11:00MCRey 315
MATH 130Calculus I SutherlandMTWF 12:10-1:00MCRey 110
MATH 140Calculus II BarelMTWF 12:10-1:00MCRey 317
MATH 215Statistical Analysis CampbellTR 2:45-4:00MCRey 110
MATH 240Discrete Mathematics WoodMWF 9:10-10:00MCRey 315
MATH 260Differential Equations BarelTR 9:45-11:00MCRey 315
MATH 310Math Probability & Statistics WoodMWF 12:10-1:00MCRey 315
Theory of probability and mathematical statistics including an introduction to basic concepts of probability theory, discrete and continuous random variables, distribution theory, moment-generating functions, and the Central Limit Theorem. Other topics may include the theory of statistical inference, point estimation, confidence intervals, regression, hypothesis testing, and analysis of variance. Prerequisite: MATH 140.
MATH 320Algebra CampbellMWF 9:10-10:00MCRey 317
Introduction to classical algebraic systems and their morphisms. Topics include groups, rings, fields, substructures, ideals, homomorphisms, and quotients. Prerequisite: MATH 290.

Mathematics — Spring 2010

MATH 115Mathem in Contemporary Issues WoodTR 8:15-9:30MCRey 110
MATH 115Mathem in Contemporary Issues WoodTR 9:45-11:00MCRey 110
MATH 120Functions and Models SemeMWF 10:10-11:00MCRey 110
MATH 120Functions and Models NailMWF 11:10-12:00MCRey 110
MATH 130Calculus I BarelMWF 10:10-11, R 1:10-2MCRey 315
MATH 130Calculus I SemeMTWF 12:10-1:00MCRey 110
MATH 140Calculus II CampbellMTWF 11:10-11:00MCRey 315
MATH 140Calculus II WoodMTWF 12:10-1:00MCRey 315
MATH 215Statistical Analysis CampbellTR 1:15-2:30MCRey 315
MATH 230Multivariable Calculus BarelTR 9:45-11:00MCRey 317
MATH 290Intro to Advanced Mathematics SutherlandMWF 1:10-2:00MCRey 317
MATH 420Seminar in Algebra BarelMWF 2:10-3:00MCRey 317
Algebraic topics that extend the fundamental ideas in MATH 320 will be presented. Prerequisite: MATH 320.
MATH 494Adv Topics: Number Theory CampbellMWF 1:10-2:00MCRey 315
We will study properties of the integers, to include divisibility, factoring into primes, congruences, and quadratic residues. This will be extended to the Gaussian integers as well, which allows a rich interplay between algebra and geometry. The Fundamental Theorem of Arithmetic and Gauss's Law of Quadratic Reciprocity will be two main results studied. As time permits, we will study other aspects of number theory, to include Bernoulli numbers, elliptic curves, quadratic forms, arithmetic functions, p-adic numbers, and Dirichlet generating functions.
Search: