Academic Departments & Programs
Content Loading
Mathematics and Computer Science Department
Mathematics and Computer Science are disciplines central to the liberal arts curriculum and to scholarly endeavors in all domains. The combined department at Emory offers educational programs and conducts research in mathematics and computer science, as well as several interdisciplinary areas. The department is highly regarded for research strengths in pure mathematics, scientific computing, and computer science.
The department’s undergraduate program offers nine Bachelor’s degrees, three of which are joint majors with Economics, Political Science, and QTM. Exceptionally strong students may consider pursuing a BS/MS in either Mathematics or Computer Science/Mathematics. In addition to Bachelor’s degrees, the department offers two mathematics minors and two computer science minors. Strong students may be considered for the department’s invitationonly Honors program.
Mathematics and Computer Science is housed in the Mathematics and Science Center with stateoftheart facilities including teaching labs, high performance research computers, large scale storage, and a comprehensive software suite. All classrooms are equipped with stateoftheart AV and computing tools.
 Academic Department Website
 http://mathcs.emory.edu
Concentrations
 Major in Computer Science (BA)
 Major in Computer Science (BS)
 Major in Economics and Mathematics (BA)
 Major in Applied Mathematics (BS)
 Major in Mathematics (BA)
 Major in Mathematics (BS)
 Major in Mathematics and Computer Science (BS)
 Major in Mathematics and Political Science (BA)
 Major in Applied Mathematics and Statistics (BS)
 Minor in Computer Informatics
 Minor in Computer Science
 Minor in Mathematics
 Minor in Applied Mathematics
Faculty
 Chair
 Vaidy Sunderam
 Director of Undergraduate Studies
 Bree EttingerKenneth Mandelberg
 Core
 Yevgeny AgichteinDorian ArnoldMichele BenziDavid BorthwickMichael CarrShun CheungJinho ChoiDwight DuffusJohn DuncanNosayba ElSayedBree EttingerDavide FossatiMichelangelo GrigniJoyce HoHao HuangSteven La FleurJames LuKenneth MandelbergManuela ManettaJames NagyVladimir OlikerKen OnoVictoria PowersParimala RamanVojtech RodlRobert RothLars RuthottoVaidy SunderamSuresh VenapallyAlessandro VenezianiYmir VigfussonJuan VilletaGarciaAvani WildaniYuanzhe XiLi XiongShanshuang YangDavid ZureickBrown
Courses
Computer Science 100Level Courses

A general introduction to computer science including an overview of hardware systems, programming essentials, algorithm design, data handling, and networking. Not intended for students needing a programming background for further work in computer science.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 None
 CrossListed
 None

Introductory course in a rotating series of computer languages. Please see current atlas for language offering.
 Credit Hours
 2
 GERs
 None
 Requisites
 None
 CrossListed
 None

An introduction to tools of computer science that are relevant to bioinformatics, with a focus on fundamental problems with sequence data. Practical topics will include Python programming, data management, and web services. Computational concepts are emphasized with examples from underlying biology.
 Credit Hours
 3
 GERs
 SNT
 Requisites
 None
 CrossListed
 None

Intro to tools and concepts of computer science most relevant to business (enterprise) computing and ecommerce. An intro to basic programming principles, page layout and visual interface design, client/server computing, simple techniques for accessing databases, and their algorithmic foundations.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 None
 CrossListed
 None

Intro to computer science for students who plan serious use of the computer in course work or research. Topics include: fundamental computing concepts, the Linux OS, the Xwindow system, and the Java programming language. Emphasis on algorithm development with examples highlighting data structures.
 Credit Hours
 4
 GERs
 MQR
 Requisites
 None
 CrossListed
 None

Emphasis is on the use and implementation of data structures, introductory algorithm analysis, and object oriented design and programming with Java.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 CS 170 as a Prerequisite
 CrossListed
 None

"Emphasis is on the use and implementation of data structures, introductory algorithm analysis, and object oriented design and programming with Java. For students who have not had CS 170 at Emory, but have an extensive programming background or AP credit."
 Credit Hours
 3
 GERs
 MQR
 Requisites
 None
 CrossListed
 None

Topics will be anounced each semester when the course is offered.
 Credit Hours
 3
 GERs
 FSEM
 Requisites
 None
 CrossListed
 None
Computer Science 200Level Courses

This course introduces elementary mathematics necessary for the computer science curriculum. Topics include proofwriting, sets, functions, logic, quantifiers, graphs, automata, languages, and asymptotic notation.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 CS 170/171Z&MATH 112
 CrossListed
 None

C programming. Elementary CPU and computer architecture. Data representation. ASCII and binary representation and conversion. Assembly language programming, with emphasis on how data structures and program constructs in C are represented in Assembler.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 CS 171 as a Prerequisite
 CrossListed
 None

Rotating topics in computer science. May be repeated for credit when the topic varies. Pre and co requisites depend on the topic offered.
 Credit Hours
 1  4
 GERs
 None
 Requisites
 None
 CrossListed
 None
Computer Science 300Level Courses

Analysis, design, and implementation of data structures and algorithms. Algorithms include divide andconquer, dynamic programming, greedy methods, tree and graph traversal, with analysis emphasizing lower bounds, worstcase, and expected time complexity.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 CS 171/224 as a Prerequisite
 CrossListed
 None

This course will focus on the analysis of syntactic and semantic structures, ontologies and taxonomies, distributional semantics and discourse, as well as their applications in computational linguistics. Assignments will include advanced programming implementations.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 CS 171 as a Prerequisite
 CrossListed
 LING 329

Digital circuits, efficient algorithms for computer arithmetic, floating point accelerators, microprogramming, memory technology and hierarchies, I/O subsystems, interrupt processing and DMA strategies, communications interfaces, and advanced architectures, including RISC and cache organization.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 CS 171/255 as a Prerequisite
 CrossListed
 None

This course introduces basic concepts and techniques of software engineering, and applies these in the context of a semesterlong group programming project.
 Credit Hours
 3
 GERs
 None
 Requisites
 CS 200 Level
 CrossListed
 None

Prerequisite: permission of instructor. Credit, variable. An independent study course devoted to the development of software projects. Cannot be used to meet course requirements for a CS major.
 Credit Hours
 1  3
 GERs
 None
 Requisites
 None
 CrossListed
 None

Introduction to storage hierarchies, database models, consistency, reliability, and security issues. Query languages and their implementations, efficiency considerations, and compression and encoding techniques.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 CS 171 as a Prerequisite
 CrossListed
 None

Introduction to data mining techniques including data preprocessing, data warehousing and management, association analysis, clustering, and text mining.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 CS 323 as prerequisite
 CrossListed
 None

Rotating topics in computer science. May be repeated for credit when the topic varies. Pre and co requisites depend on the topic offered.
 Credit Hours
 1  4
 GERs
 None
 Requisites
 None
 CrossListed
 None
Computer Science 400Level Courses

This course gives mathematical methods to classify the complexity of computational problems. Topics include regular languages, grammars, decidability, and NPcompleteness. Models of computing such as automata, circuits, and Turing machines are related.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 CS 224/323 as a Prerequisite
 CrossListed
 None

Foundations and problems of machine intelligence, application areas, representation of knowledge, constraint processing, AI programming languages, expert systems, design of an intelligent system.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 CS 323 as prerequisite
 CrossListed
 None

Explores the theory, design, & implementation of programming languages. Topics include syntax specification, parsing, formal semantics, functional & logic programming, pattern matching, backtracking, higherorder function, lambda calculus, continuation, parameter passing, metacircular evaluation.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 Any CS 300 level course prereq
 CrossListed
 None

System programming topics are illustrated by the POSIX API to the Linux operating system. Topics include: file i/o, the TTY driver, window systems, processes, shared memory, message passing, semaphores, signals, and interrupt handlers.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 CS 171/255 as a Prerequisite
 CrossListed
 None

The structure and organization of computer operating systems. Process, memory, and I/O management; device drivers, exception handling, and interprocess communication. Students write an operating system as a courselong project.
 Credit Hours
 4
 GERs
 MQR
 Requisites
 CS 450 or CS 551 as prereq.
 CrossListed
 None

Understanding offense is key to better cyberdefense. We focus on advanced vulnerabilities, exploits and defense technologies. We teach the hacker mindset, ethics as well as C and assembly.
 Credit Hours
 3
 GERs
 None
 Requisites
 CS 450 or CS 551 as prereq.
 CrossListed
 None

Intro to computer networks based on internal structure using the OSI layer model. Topics include: physical layer, data link layer, the network layer (routing algorithms, IP protocol, tunneling), and transport layer (UDP and TCP protocols, NS2 network simulation). Berkeley socket and pthreads APIs.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 CS 450 or CS 551 as prereq.
 CrossListed
 None

Languages and their grammars, lexical analysis and parsing, code generation, and optimization. Functional and Logic programming. Evaluation will include the design and implementation of a semesterlong compiler project for a simple imperative language.
 Credit Hours
 4
 GERs
 MQR
 Requisites
 CS 255/323/424 as a Prerequisi
 CrossListed
 None

May be repeated for credit when topic varies. Pre/corequisites vary with topic.
 Credit Hours
 1  4
 GERs
 None
 Requisites
 None
 CrossListed
 None

May be repeated for credit when topic varies. Pre/corequisites vary with topic.
 Credit Hours
 1  5
 GERs
 WRT
 Requisites
 None
 CrossListed
 None

Enrollment limited to departmental majors invited to participate in the Honors Program.
 Credit Hours
 1  4
 GERs
 None
 Requisites
 None
 CrossListed
 None

Enrollment limited to departmental majors invited to participate in the Honors Program.
 Credit Hours
 1  8
 GERs
 WRT
 Requisites
 None
 CrossListed
 None

Prerequisite: consent of instructor. Cannot be used to meet course requirements for a CS major or minor.
 Credit Hours
 1  3
 GERs
 None
 Requisites
 None
 CrossListed
 None
Mathematics 100Level Courses

Convex sets, linear inequalities, linear programming, twoperson games, finite graphs. Applications in management, economics, and behavioral sciences.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 None
 CrossListed
 None

Limits, continuity, derivatives, antiderivatives, the definite integral.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 PROHIBITS: MATH 111
 CrossListed
 None

Limits, continuity, derivatives, antiderivatives and definite integrals; applications to optimization, physical and life science models. Lab includes webbased practice and evaluation.
 Credit Hours
 4
 GERs
 MQR
 Requisites
 PROHIBITS: MATH 111
 CrossListed
 None

Techniques of integration, exponential and logarithm functions, sequences and series, polar coordinates.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 111/119 as a Prerequisite
 CrossListed
 None

This class is for freshmen who have earned a 4 or 5 on the AP AB exam, or a 5 on the IB HL exam. Topics include: techniques of integration, exponential and logarithm functions, sequences and series, and polar coordinates.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH AP/AB or IB as prereq.
 CrossListed
 None

Integration, differential equations, multivariable calculus, and discrete probability and statistics, with an emphasis on applications to biology.
 Credit Hours
 4
 GERs
 MQR
 Requisites
 MATH 111 or 111L as prereq.
 CrossListed
 None

Topics will be announced each semester when class is scheduled.
 Credit Hours
 3
 GERs
 FSEM
 Requisites
 None
 CrossListed
 None
Mathematics 200Level Courses

Development and use of mathematical models from probability and statistics with applications.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 112/112Z/119 as a Prerequ
 CrossListed
 None

Vectors; multivariable functions; partial derivatives; multiple integrals; vector and scalar fields; Green's and Stokes' theorems; divergence theorem.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 111 Pre/MATH 112 PreCo
 CrossListed
 PHYS 211

This is a standard first semester Differential Equations course which covers first and secondorder differential equations and systems of differential equations, with an emphasis placed on developing techniques for solving differential equations.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 112 or MATH 112Z as prere
 CrossListed
 None

Systems of linear equations, matrices, determinants, linear transformations, eigenvalues and eigenvectors, leastsquares.
 Credit Hours
 4
 GERs
 MQR
 Requisites
 MATH 112/112Z/119 as a Prerequ
 CrossListed
 None

An introduction to theoretical mathematics. Logic and proofs, operations on sets, induction, relations, functions.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 111 Pre/MATH 112 PreCo
 CrossListed
 None

Topics in the history of mathematics and their philosophical background. Genesis and evolution of ideas in analysis, algebra, geometry, mechanics, foundations. Historical and philosophical aspects of concepts of infinity, mathematical rigor, probability, etc.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 112 or MATH 112Z as prere
 CrossListed
 None

Topics in the history of mathematics and their philosophical background. Genesis and evolution of ideas in analysis, algebra, geometry, mechanics, foundations. Historical and philosophical aspects of concepts of infinity, mathematical rigor, probability, etc.
 Credit Hours
 4
 GERs
 MQRW
 Requisites
 MATH 112 or MATH 112Z as prere
 CrossListed
 None

This course is the first half of the advanced math introductory sequence. It covers the basics of linear algebra: vector spaces, linear transformations, determinants, and eigenvalues, with an emphasis on mathematical rigor. This class is for freshmen who scored a 5 on the Calculus AP BC exam.
 Credit Hours
 4
 GERs
 None
 Requisites
 AP Calculus BC as prerequisite
 CrossListed
 None

This course is the second half of the advanced mathematics introductory sequence. It covers the basics of vector calculus: differentiable mappings, differential forms, and integration theory.
 Credit Hours
 4
 GERs
 MQR
 Requisites
 None
 CrossListed
 None

 Credit Hours
 1  4
 GERs
 None
 Requisites
 None
 CrossListed
 None

Rotating topics in mathematics. May be repeated for credit when the topic varies. Pre and co requisites depend on the topic offered.
 Credit Hours
 1  5
 GERs
 WRT
 Requisites
 None
 CrossListed
 None

May be repeated for credit, total credit not to exceed six hours. Cannot be used to meet course requirements for a Math major or minor. Topics vary by instructor.
 Credit Hours
 1  4
 GERs
 None
 Requisites
 None
 CrossListed
 None
Mathematics 300Level Courses

Solution of linear and nonlinear systems of equations, interpolation, leastsquares approximation, numerical integration, and differentiation.
 Credit Hours
 4
 GERs
 MQR
 Requisites
 MATH 221/275/321 & CS 170
 CrossListed
 None

Analytic functions, elementary functions, integrals, power series, residues, and conformal mapping.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 211 & 250 or MATH 276
 CrossListed
 None

Axiomatic treatment of vector spaces, inner product spaces, minimal polynomials, Cayley Hamilton theorem, Jordan form, and bilinear forms.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 250 or 276 as prereq.
 CrossListed
 None

This course introduces the basic concepts of algebraic and analytic number theory. Topics include: congruence relations, the distribution of prime numbers, quadratic reciprocity, Diophantine equations, continued fractions, and generating functions.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 250 or 276 as prereq.
 CrossListed
 None

Combinations and permutations, counting techniques, recurrence relations, and generating functions. Block designs, finite planes, and coding theory. Introduction to graph theory.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 221/275/321 & MATH 250/27
 CrossListed
 None

Curves and surfaces in 3space. The geometry of the Gauss map. Special surfaces. The intrinsic geometry of surfaces. Surfaces and computer graphics.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 211 or 276 & 250 or 276 &
 CrossListed
 None

Principles of mathematical modeling; case studies using nonlinear ordinary differential equations, difference equations, and partial differential equations.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 212 & CS 170 as a Prerequ
 CrossListed
 None

Theory of linear programming, duality, optimal flows in networks, and mathematical programming.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 221/275/321 & CS 170
 CrossListed
 None

Nonlinear optimization problems arise in a wide range of applications, for example, in economics, physics, engineering, imaging. This introductory course covers a wide range of examples and both theory and practice of unconstrained and constrained optimization.
 Credit Hours
 3
 GERs
 None
 Requisites
 MATH (211&250)&(MATH 221or321)
 CrossListed
 None

PDEs and their origin, classification of PDEs, analytical methods for the solution of PDEs, qualitative properties of the solutions, eigenvalue problems and introduction to numerical methods.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 211/276 & 212 & 221/275/3
 CrossListed
 None

Partial Differential Equations (PDE's) are a formidable tool for describing reallife problems. In this course we use PDE's for cardiovascular problems and other reallife situations. Students will visit radiology labs and learn about image processing and numerical simulations in medicine.
 Credit Hours
 3
 GERs
 None
 Requisites
 MATH 211/276 & 212 & 221/275/3
 CrossListed
 None

Finite and continuous probability theory, distribution models (binomial, geometric, uniform, normal, Poisson, and exponential), the Chebyshev inequality, expectation and variance, moment generating functions, the central limit theorem, and applications.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 211 or 276 prerequisite
 CrossListed
 None

Fundamentals of statistical inference: estimation, properties of estimators, methods for comparing estimators, confidence intervals, hypothesis testing, regression, and analysis of variance.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 361 as a Prerequisite
 CrossListed
 None

Fundamentals of statistical inference: estimation, properties of estimators, methods for comparing estimators, confidence intervals, hypothesis testing, regression, and analysis of variance.This course is an extension of MATH 362 which includes a writing lab. Students take a writing lab and learn how to articulate why the statistical methods they use are applicable, discuss what their results show and make recommendations for future studies.
 Credit Hours
 4
 GERs
 MQRW
 Requisites
 MATH 361 as a Prerequisite
 CrossListed
 None

Rotating topics in mathematics. May be repeated for credit when the topic varies. Pre and co requisites depend on the topic offered.
 Credit Hours
 1  4
 GERs
 None
 Requisites
 None
 CrossListed
 None
Mathematics 400Level Courses

Analysis of sets and functions in nspace which focuses on basic topological properties of sets as well as continuity and differentiation of functions. Topics: exterme value theorem, chain rule, and inverse function theorem.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 211 or 276 & 250 or 276 &
 CrossListed
 None

This course is a continuation of Math 411 which focuses on integration and uniform convergence in nspace. Topics include: Stoke's theorem, Fubini's theorem, Taylor's theorem, the StoneWeierstrass theorem, and Sard's theorem.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 411 as a Prerequisite
 CrossListed
 None

Groups (definition and examples), cosets, Lagrange's Theorem, symmetric and alternating groups, Cayley's Theorem, isomorphisms, Cauchy's Theorem, quotient groups and homomorphisms, and the action of a group on a set. Additional topics may include the Sylow Theorems.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 221/275/321 & MATH 250/27
 CrossListed
 None

Ring Theory and Field Theory: polynomial rings, unique factorization, Euclidean domains, splitting fields of polynomials, elements of Galois theory, finite fields.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 421 as Prereq
 CrossListed
 None

Introduction to the use of calculus in economic analysis; comparative static problem and optimization theory; consideration of the mathematical techniques used in game theory.
 Credit Hours
 4
 GERs
 MQR
 Requisites
 MATH 211 or 276 & ECON 201
 CrossListed
 ECON 425

Rotating topics in mathematics. May be repeated for credit when the topic varies. Pre and co requisites depend on the topic offered.
 Credit Hours
 1  4
 GERs
 None
 Requisites
 None
 CrossListed
 None

May be repeated for credit when topic varies.
 Credit Hours
 1  4
 GERs
 MQR
 Requisites
 MATH 250 or 276 as prereq.
 CrossListed
 None

May be repeated for credit when topic varies.
 Credit Hours
 1  5
 GERs
 MQRW
 Requisites
 MATH 250 or 276 as prereq.
 CrossListed
 None

May be repeated for credit when topic varies.
 Credit Hours
 3
 GERs
 MQR
 Requisites
 MATH 221/275/321 & MATH 250/27
 CrossListed
 None

May be repeated for credit when topic varies.
 Credit Hours
 1  4
 GERs
 MQR
 Requisites
 MATH 221/275/321 & MATH 250/27
 CrossListed
 None

May be repeated for credit when topic varies.
 Credit Hours
 1  5
 GERs
 MQRW
 Requisites
 MATH 221/275/321 & MATH 250/27
 CrossListed
 None

May be repeated for credit when topic varies.
 Credit Hours
 1  4
 GERs
 MQR
 Requisites
 MATH 250 or 276 as prereq.
 CrossListed
 None

May be repeated for credit when topic varies.
 Credit Hours
 1  5
 GERs
 MQRW
 Requisites
 MATH 250 or 276 as prereq.
 CrossListed
 None

Normally taken in student's last semester, up to a maximum of 4 credit hours.
 Credit Hours
 1  4
 GERs
 None
 Requisites
 None
 CrossListed
 None

Normally taken in student's last semester, up to a maximum of 4 credit hours.
 Credit Hours
 1  8
 GERs
 WRT
 Requisites
 None
 CrossListed
 None

May be repeated for credit, total credit not to exceed six hours. Prerequisite: consent of instructor. Cannot be used to meet course requirements for a Math major or minor.
 Credit Hours
 1  3
 GERs
 None
 Requisites
 None
 CrossListed
 None