computer science - 2020-21 bulletin · or csci 0530 coding the matrix: an introduction to linear...

Computer Science 1

Computer ScienceChairUgur Cetintemel

Vice Chair and Director of UndergraduateStudiesThomas W. Doeppner

Director of Graduate StudiesDavid H. Laidlaw

Since our inception in 1979, the Computer Science Department atBrown has forged a path of innovative information technology researchand teaching at both the undergraduate and graduate levels. From ourmodest beginnings as an interest group within the Divisions of AppliedMathematics and Engineering in the 1960s to its current stature as one ofthe nation's leading computer science programs, the Computer ScienceDepartment has continuously produced prominent contributors in the field.Computer Science combines the intellectual challenge of a new disciplinewith the excitement of an innovative and rapidly expanding technology.The department resides in Brown’s Center for Information Technology; thisstriking building houses many of the university’s computing activities, aswell as the department’s instructional computing facilities and researchlabs. Faculty, staff and students are provided state-of-the-art computingfacilities.

We are a diverse community of scholars engaged in all aspectsof research, teaching and mentoring in computer science and itsrelated interdisciplinary disciplines. Realizing the importance ofcomputing and algorithmic thinking in so many scientific, social andtechnological endeavors, we collaborate extensively with colleaguesin archaeology, applied mathematics, biology, cognitive and linguisticsciences, economics, engineering, mathematics, medicine, physics andneuroscience.

Our undergraduate offerings reflect the department's multidisciplinaryorientations, with joint concentrations in mathematics, appliedmathematics, computational biology and economics. We have strongundergraduate research groups and a long history of involvingundergraduates in projects that span disciplinary boundaries.

For additional information, please visit the department's website: http://www.cs.brown.edu/

Computer Science ConcentrationRequirementsComputer science is now a critical tool for pursuing an ever-broadeningrange of topics, from outer space to the workings of the human mind. Inmost areas of science and in many liberal arts fields, cutting-edge workdepends increasingly on computational approaches. The undergraduateprogram at Brown is designed to combine breadth in practical andtheoretical computer science with depth in specialized areas. These areasrange from traditional topics, such as analysis of algorithms, artificialintelligence, databases, distributed systems, graphics, mobile computing,networks, operating systems, programming languages, robotics andsecurity, to novel areas including games and scientific visualization.

Our requirements are built on a collection of pathways, each representinga well defined area within computer science. Concentrators interested inparticular areas can choose the courses included in particular pathways. Conversely, concentrators who are unsure of their area of interest butwho have particularly enjoyed certain courses can choose pathways thatinclude these concentrations. Students may not use more than two CSCI1970 courses to complete the requirements for the Sc.B. and one CSCI1970 course for the A.B. requirements.

Requirements for the Standard Track of theSc.B. degreePrerequisites (0-3 courses)Calculus prerequisite: students must complete or place out ofsecond semester calculus.

0-3

MATH 0100 Introductory Calculus, Part IIor MATH 0170 Advanced Placement Calculusor MATH 0190 Advanced Placement Calculus (Physics/

Engineering)Concentration RequirementsCore-Computer Science:Select one of the following introductory course Series: 2

Series ACSCI 0150& CSCI 0160

Introduction to Object-OrientedProgramming and Computer Scienceand Introduction to Algorithms and DataStructures

Series BCSCI 0170& CSCI 0180

Computer Science: An IntegratedIntroductionand Computer Science: An IntegratedIntroduction

Series CCSCI 0190 Accelerated Introduction to Computer

Science (and an additional CS course nototherwise used to satisfy a concentrationrequirement; this course may be CSCI0180, an intermediate-level course, or anadvanced course)

Thirteen CS courses numbered 0220 or higher. 13## Two complete pathways (at least one core course from each)

# Each requires two 1000-level courses as well as one-to-three intermediate courses# One of the courses used in one pathway must be acapstone course (defined below) 1

# The core and related courses used in one pathway may notoverlap with those used in another# 2000-level courses beyond those explicitly mentionedmy also be used toward the concentration. They willbe considered to be part of the same pathway as theirthematically-related 1000-level courses

## Additional intermediate courses so that a total of five aretaken, with at least one from each of the three categories## One additional 1000-level course that is neither a core nor arelated course for the pathways used aboveIntermediate CoursesStudents must complete the intermediate courses defined forthe pathway they choose. In addition, ScB students must takeat least one course from each intermediate course category toensure they span all areas. Taking additional courses beyondthose listed for the pathway may be required.

FoundationsCSCI 0220 Introduction to Discrete Structures and

ProbabilityCSCI 1010 Theory of ComputationMathematicsCSCI 0530 Coding the Matrix: An Introduction to

Linear Algebra for Computer Scienceor MATH 0520 Linear Algebraor MATH 0540 Honors Linear Algebra

CSCI 1450 Probability for Computing and DataAnalysis

or APMA 1650 Statistical Inference I

Computer Science 1

2 Computer Science

or APMA 1655 Statistical Inference IMATH 0180 Intermediate Calculus

or MATH 0200 Intermediate Calculus (Physics/Engineering)or MATH 0350 Honors Calculus

SystemsCSCI 0320 Introduction to Software EngineeringCSCI 0330 Introduction to Computer Systems

PathwaysCompleting a pathway entails taking two courses in the pathwayof which at least one is a course course for the pathway. Onemust also take the intermediate courses specified as partof the pathway. Certain graduate courses can also satisfypathway requirements, see the CS Pathway page for moreinfo:https://cs.brown.edu/degrees/undergrad/concentrating-in-cs/concentration-requirements-2020/pathways-for-undergraduate-and-masters-students/ 3

SYSTEMS: studies the design, construction, and analysis ofmodern, multi-faceted computing systemsCore Courses

CSCI 1380 Distributed Computer Systemsor CSCI 1670 Operating Systemsor CSCI 1680 Computer Networks

Related CoursesCSCI 1270 Database Management Systems

or CSCI 1310 Fundamentals of Computer Systemsor CSCI 1320 Creating Modern Web & Mobile Applicationsor CSCI 1600 Real-Time and Embedded Softwareor CSCI 1650 Software Security and Exploitationor CSCI 1660 Introduction to Computer Systems Securityor CSCI 1730 Design and Implementation of Programming

Languagesor CSCI 1760 Multiprocessor Synchronizationor CSCI 1950Y Logic for Systemsor ENGN 1640 Design of Computing Systems

Intermediate CoursesCSCI 0330 Introduction to Computer SystemsCSCI 0220 Introduction to Discrete Structures and

Probabilityor CSCI 0320 Introduction to Software Engineering

SOFTWARE PRINCIPLES: studies the design, construction,and analysis of modern software systemsCore Courses

CSCI 1260 Compilers and Program Analysisor CSCI 1320 Creating Modern Web & Mobile Applicationsor CSCI 1600 Real-Time and Embedded Softwareor CSCI 1730 Design and Implementation of Programming

Languagesor CSCI 1950Y Logic for Systems

Related CoursesCSCI 1270 Database Management Systems

or CSCI 1380 Distributed Computer Systemsor CSCI 1650 Software Security and Exploitationor CSCI 1680 Computer Networksor CSCI 1951I CS for Social Changeor CSCI 1951T Surveying VR Data Visualization Software for

ResearchIntermediate Courses

CSCI 0220 Introduction to Discrete Structures andProbability

CSCI 0320 Introduction to Software EngineeringCSCI 0330 Introduction to Computer Systems (Data)

DATA: Studies the management and use of large datacollectionsCore Courses

CSCI 1270 Database Management Systemsor CSCI 1420 Machine Learningor CSCI 1951A Data Science

Related CoursesCSCI 1550 Probabilistic Methods in Computer

Scienceor CSCI 1580 Information Retrieval and Web Searchor ECON 1660 Big Data

Intermediate CoursesCSCI 0320 Introduction to Software Engineering

or CSCI 0330 Introduction to Computer SystemsMATH 0520 Linear Algebra

or MATH 0540 Honors Linear Algebraor CSCI 0530 Coding the Matrix: An Introduction to Linear

Algebra for Computer ScienceCSCI 1450 Probability for Computing and Data

Analysisor APMA 1650 Statistical Inference Ior APMA 1655 Statistical Inference I

ARTIFICIAL INTELLIGENCE / MACHINE LEARNING:studies the theory and application of algorithms for makingdecisions and inferences from rules and dataCore Courses

CSCI 1410 Artificial Intelligenceor CSCI 1420 Machine Learningor CSCI 1430 Computer Visionor CSCI 1460 Computational Linguisticsor CSCI 1470 Deep Learningor CSCI 1951R Introduction to Robotics

Related CoursesCSCI 1550 Probabilistic Methods in Computer

Scienceor CSCI 1951A Data Scienceor CSCI 1951C Designing Humanity Centered Robotsor CSCI 1951K Algorithmic Game Theoryor ENGN 1610 Image Understanding

Intermediate CoursesCSCI 1450 Probability for Computing and Data


MATH 0520 Linear Algebraor MATH 0540 Honors Linear Algebraor CSCI 0530 Coding the Matrix: An Introduction to Linear

Algebra for Computer ScienceTHEORY: students the foundations of models andalgorithms for computing in various contextsCore Courses

CSCI 1510 Introduction to Cryptography andComputer Security

or CSCI 1550 Probabilistic Methods in Computer Scienceor CSCI 1570 Design and Analysis of Algorithmsor CSCI 1760 Multiprocessor Synchronization

Related CoursesCSCI 1590 Introduction to Computational Complexity

or CSCI 1810 Computational Molecular Biologyor CSCI 1820 Algorithmic Foundations of Computational Biology

2 Computer Science

Computer Science 3

or CSCI 1950H Computational Topologyor CSCI 1950Y Logic for Systemsor CSCI 1951G Optimization Methods in Financeor CSCI 1951K Algorithmic Game Theory

Intermediate CoursesCSCI 1010 Theory of ComputationCSCI 1450 Probability for Computing and Data



Algebra for Computer ScienceSECURITY: studies the design, construction, analysis,and defense of techniques to protect systems, data, andcommunicationsCore Courses

CSCI 1510 Introduction to Cryptography andComputer Security

or CSCI 1660 Introduction to Computer Systems Securityor CSCI 1650 Software Security and Exploitation

Related CoursesCSCI 1320 Creating Modern Web & Mobile

Applicationsor CSCI 1380 Distributed Computer Systemsor CSCI 1670 Operating Systemsor CSCI 1680 Computer Networksor CSCI 1730 Design and Implementation of Programming

Languagesor CSCI 1800 Cybersecurity and International Relationsor CSCI 1805 Computers, Freedom and Privacyor CSCI 1950Y Logic for Systems

Intermediate CoursesCSCI 0330 Introduction to Computer SystemsCSCI 1010 Theory of ComputationCSCI 0220 Introduction to Discrete Structures and

Probability (Or Probability and Statistics(see options below))

or CSCI 1450 Probability for Computing and Data Analysisor APMA 1650 Statistical Inference Ior APMA 1655 Statistical Inference I

VISUAL COMPUTING: studies the creation, interaction,and analysis of images and visual information, includinganimation and gamesCore Courses

CSCI 1230 Introduction to Computer Graphicsor CSCI 1250 Introduction to Computer Animationor CSCI 1280 Intermediate 3D Computer Animationor CSCI 1290 Computational Photographyor CSCI 1300 User Interfaces and User Experienceor CSCI 1370 Virtual Reality Design for Scienceor CSCI 1430 Computer Visionor CSCI 1950T Advanced Animation Production

Related CoursesCSCI 1950N 2D Game Engines

or CSCI 1470 Deep Learningor CSCI 1950U Topics in 3D Game Engine Developmentor ENGN 1610 Image Understandingor CLPS 1520 Computational Vision

or DATA 1200 Reality Remix - Experimental VRIntermediate Courses

CSCI 0320 Introduction to Software Engineeringor CSCI 0330 Introduction to Computer Systems


Algebra for Computer ScienceCOMPUTER ARCHITECTURE: studies the design,construction, and analysis of computer architecture andhardwareCore Courses

ENGN 1630 Digital Electronics Systems Designor ENGN 1640 Design of Computing Systemsor ENGN 1650 Embedded Microprocessor Design

Related CoursesCSCI 1600 Real-Time and Embedded Software

or CSCI 1760 Multiprocessor Synchronizationor ENGN 1600 Design and Implementation of Digital Integrated

CircuitsIntermediate Course

CSCI 0330 Introduction to Computer SystemsCOMPUTATIONAL BIOLOGY: studies the foundations andapplications of algorithms for analyzing biological data andprocessesCore Courses

CSCI 1810 Computational Molecular BiologyCSCI 1820 Algorithmic Foundations of Computational

BiologyCSCI 1850 Deep Learning in Genomics

Related CoursesCSCI 1420 Machine Learning

or CSCI 1430 Computer Visionor CSCI 1951A Data Scienceor CLPS 1520 Computational Vision

Intermediate CoursesCSCI 0220 Introduction to Discrete Structures and

ProbabilityCSCI 1010 Theory of ComputationCSCI 1450 Probability for Computing and Data


DESIGN: studies the design, construction, and analysis ofprocesses at the interface between humans and systemsCore Courses

CSCI 1300 User Interfaces and User Experienceor CSCI 1370 Virtual Reality Design for Scienceor CSCI 1951C Designing Humanity Centered Robots

Related CoursesCSCI 1230 Introduction to Computer Graphics

or CSCI 1320 Creating Modern Web & Mobile Applicationsor CSCI 1600 Real-Time and Embedded Softwareor CSCI 1900 csciStartupor CSCI 1951A Data Scienceor CSCI 1951I CS for Social Changeor CSCI 1951T Surveying VR Data Visualization Software for

Researchor VISA 1720 Physical Computing

Intermediate Courses

Computer Science 3

4 Computer Science

CSCI 0320 Introduction to Software Engineeringor CSCI 0330 Introduction to Computer Systems

CSCI 1450 Probability for Computing and DataAnalysis

or APMA 1650 Statistical Inference Ior APMA 1655 Statistical Inference I

SELF-DESIGNED: This pathway is modeled after theBrown programs for designing one’s own concentration.Students electing this pathway must write a proposal fortheir pathway and have it approved by an advisor and thedirector of undergraduate studies. The proposal must meetthe breadth and overall course requirements. This must bedone by the end of shopping period of the student’s seventhsemester.1

Capstone: a one-semester course, taken in the student's lastundergraduate year, in which the student (or group of students)use a significant portion of their undergraduate education, broadlyinterpreted, in studying some current topic in depth, to produce aculminating artifact such as a paper or software project.

2Certain 1000-level courses may be used to fill the additional 1000-level course requirements for both the AB and ScB. No more thanone such course may be used for the AB concentration and no morethan three for the ScB concentration. A list of approved non-CScourses is on our web page. Unless explicitly stated on our webpage, such non-CS courses may not be used as part of pathways.

3https://cs.brown.edu/degrees/undergrad/concentrating-in-cs/concentration-requirements-2020/pathways-for-undergraduate-and-masters-students/

Requirements for the Professional Track ofthe Sc.B. degree.The requirements for the professional track include all those of thestandard track, as well as the following:

Students must complete two two-to-four-month full-time professionalexperiences, doing work that is related to their concentration programs.Such work is normally done within an industrial organization, but may alsobe at a university under the supervision of a faculty member.

On completion of each professional experience, the student must writeand upload to ASK a reflective essay about the experience addressing thefollowing prompts, to be approved by the student's concentration advisor:

• Which courses were put to use in your summer's work? Which topics,in particular, were important?

• In retrospect, which courses should you have taken before embarkingon your summer experience? What are the topics from these coursesthat would have helped you over the summer if you had been morefamiliar with them?

• Are there topics you should have been familiar with in preparation foryour summer experience, but are not taught at Brown? What are thesetopics?

• What did you learn from the experience that probably could not havebeen picked up from course work?

• Is the sort of work you did over the summer something you would liketo continue doing once you graduate? Explain.

• Would you recommend your summer experience to other Brownstudents? Explain.

Requirements for the Standard Track of theA.B. degreePrerequisites (0-3 courses) 0-3Students must complete or place out of second semestercalculus.

MATH 0100 Introductory Calculus, Part IIor MATH 0170 Advanced Placement Calculusor MATH 0190 Advanced Placement Calculus (Physics/

Engineering)

Concentration Requirements (9 courses)Core Computer Science:Select one of the following series: 2






Science (and an additional CS course nototherwise used to satisfy a concentrationrequirement; this course may be CSCI0180, an intermediate-level course, or anadvanced course)

Seven CS courses numbered 0220 or higher 7## One complete pathway (see ScB for pathways)

Requires two 1000-level courses as well as one-to-threeintermediate courses

## Additional intermediate courses so that a total of three aretaken with at least one in each of two different intermediate-course categories (see the ScB requirements for a listing ofthese categories)## One additional 1000-level course that is neither a core nor arelated course for the pathways used above## Of the remaining two courses, at least one must be at the1000-level or higher (i.e., one may be an intermediate course nototherwise used as part of the concentration). One course may bean approved 1000-level course from another department. Unlessexplicitly stated in a pathway, such non-CS courses may not beused as part of pathways.

Requirements for the Professional Track ofthe A.B. degree.The requirements for the professional track include all those of thestandard track, as well as the following:









4 Computer Science

Computer Science 5

Computer Science-EconomicsConcentration RequirementsThe joint Computer Science-Economics concentration exposes students tothe theoretical and practical connections between computer science andeconomics. It prepares students for professional careers that incorporateaspects of economics and computer technology and for academic careersconducting research in areas that emphasize the overlap between thetwo fields. Concentrators may choose to pursue either the A.B. or theSc.B. degree. While the A.B. degree allows students to explore thetwo disciplines by taking advanced courses in both departments, itssmaller number of required courses is compatible with a liberal education.The Sc.B. degree achieves greater depth in both computer scienceand economics by requiring more courses, and it offers students theopportunity to creatively integrate both disciplines through a designrequirement. In addition to courses in economics, computer science, andapplied mathematics, all concentrators must fulfill the Computer Sciencedepartment's writing requirement by passing a course that involvessignificant expository writing.

Standard Program for the Sc.B. degree.Prerequisites (3 courses):

MATH 0100 Introductory Calculus, Part IIMATH 0520 Linear Algebra


Algebra for Computer ScienceECON 0110 Principles of Economics

Required Courses: 17 courses: 8 Computer Science, 8Economics, and a CapstoneCSCI 1450 Probability for Computing and Data

Analysis 11


Select one of the following Series: 2Series ACSCI 0150& CSCI 0160





Science (and an additional CS course nototherwise used to satisfy a concentrationrequirement; this course may be CSCI0180, an intermediate-level CS course, ora 1000-level course.)

Two of the following intermediate courses, one of which must bemath-oriented and one systems-oriented.

2

CSCI 0220 Introduction to Discrete Structures andProbability (math)

CSCI 0320 Introduction to Software Engineering(systems)

CSCI 0330 Introduction to Computer Systems(systems)

CSCI 1010 Theory of Computation (math) 2

A pair of 1000-level CS courses that, along with the intermediatecourses and math courses, satisfy one of the CS Pathways. 3

2

An additional CS course that is either at the 1000-level or is anintermediate course not already used to satisfy concentrationrequirements. CSCI 1450 may not be used to satisfy thisrequirement.

1

ECON 1130 Intermediate Microeconomics(Mathematical) 4

1

ECON 1210 Intermediate Macroeconomics 1ECON 1630 Mathematical Econometrics I 1Three courses from the "mathematical economics" group(CSCI 1951K can be counted as one of them, if it has notbeen used to satisfy the computer science requirements of theconcentration and if the student has taken either ECON 1470 orECON 1870):

3

ECON 1170 Welfare Economics and Social ChoiceTheory

ECON 1225 Advanced Macroeconomics: Monetary,Fiscal, and Stabilization Policies

ECON 1460 Industrial OrganizationECON 1470 Bargaining Theory and ApplicationsECON 1490 Designing Internet MarketplacesECON 1640 Mathematical Econometrics IIECON 1660 Big DataECON 1670 Advanced Topics in EconometricsECON 1750 Investments IIECON 1820 Theory of Behavioral EconomicsECON 1850 Theory of Economic GrowthECON 1860 The Theory of General EquilibriumECON 1870 Game Theory and Applications to

Economicsand any graduate Economics course

Two additional 1000-level Economics courses excluding 1620,1960, 1970 5

2

One capstone course in either CS or Economics: a one-semester course, normally taken in the student's last semesterundergraduate year, in which the student (or group of students)use a significant portion of their undergraduate education,broadly interpreted, in studying some current topic (preferably atthe intersection of computer science and economics) in depth,to produce a culminating artifact such as a paper or softwareproject. A senior thesis, which involved two semesters of work,may count as a capstone. 6

1

Total Credits 171

CSCI 1450 was formerly known as CSCI 0450: they are the samecourse and hence only one may be taken for credit. APMA 1650or APMA 1655 may be used in place of CSCI 1450 in CS pathwayrequirements. However, oncentration credit will be given for only onefor APMA 1650, APMA 1655, and CSCI 1450.

2CSCI 1010 may be used either as a math-oriented intermediatecourse or as an advanced course. CSCI 1010 was formerly known asCSCI 0510: They are the same course and hence only one may betaken for credit.

3A list of pre-approved pairs may be found at the approved-pairs web page (http://www.cs.brown.edu/ugrad/concentrations/approvedpairs.html). You are not restricted to pairs on this list, butany pair not on the list must be approved by the Computer Sciencedirector of undergraduate studies. CS Pathways can be foundon the New Pathways (https://cs.brown.edu/degrees/undergrad/concentration-requirements/pathways-for-undergraduate-and-masters-students) page.

4Or ECON 1110, with permission.

5Students may use either ECON 1070 or ECON 1090 toward theconcentration, but not both. Note that ECON 1620, ECON 1960, andECON 1970 (independent study) cannot be used for concentrationcredit. However, 1620 and 1960 can be used for university credit andup to two 1970s may be used for university credit.

Computer Science 5

6 Computer Science

6One capstone course (http://cs.brown.edu/degrees/undergrad/concentrations/capstone) in either Computer Science or Economics: aone-semester course, taken in the student's last undergraduate year,in which the student (or group of students) use a significant portion oftheir undergraduate education, broadly interpreted, in studying somecurrent topic (preferably at the intersection of computer science andeconomics) in depth, to produce a culminating artifact such as a paperor software project.

Standard Program for the A.B. degree:Prerequisites (3 courses):

MATH 0100 Introductory Calculus, Part IIMATH 0520 Linear Algebra


Algebra for Computer ScienceECON 0110 Principles of Economics

Required Courses: 13 courses: 7 Computer Science and 6EconomicsCSCI 1450 Probability for Computing and Data

Analysis1


Select one of the following series: 2Series ACSCI 0150& CSCI 0160





Science (and an additional CS course nototherwise used to satisfy a concentrationrequirement; this course may be CSCI0180, an intermediate-level course, or a1000-level course)

Two of the following intermediate courses, one of which must bemath-oriented and one systems-oriented:

2




CSCI 1010 Theory of Computation (math)Two additional CS courses; at least one must be at the 1000-level. The other must either be at the 1000-level or be anintermediate course not already used to satisfy concentrationrequirements. CSCI 1450 may not be used to satisfy thisrequirement.

2

ECON 1130 Intermediate Microeconomics(Mathematical) 1

1

ECON 1210 Intermediate Macroeconomics 1ECON 1630 Mathematical Econometrics I 1Three courses from the "mathematical-economics" group: 2 3

ECON 1170 Welfare Economics and Social ChoiceTheory

ECON 1225 Advanced Macroeconomics: Monetary,Fiscal, and Stabilization Policies

ECON 1460 Industrial OrganizationECON 1470 Bargaining Theory and ApplicationsECON 1490 Designing Internet MarketplacesECON 1640 Mathematical Econometrics IIECON 1660 Big DataECON 1670 Advanced Topics in EconometricsECON 1750 Investments IIECON 1820 Theory of Behavioral EconomicsECON 1850 Theory of Economic GrowthECON 1860 The Theory of General EquilibriumECON 1870 Game Theory and Applications to

Economicsor any graduate Economics course 3

Total Credits 131

Or ECON 1110, with permission.2

CSCI 1951K can be counted as one of them, if it has not been used tosatisfy the computer science requirements of the concentration and ifthe student has taken either ECON 1470 or ECON 1870.

3Note that ECON 1620, ECON 1960, and ECON 1970 (independentstudy) cannot be used for concentration credit. However, 1620 and1960 can be used for university credit and up to two 1970s may beused for university credit.

HonorsStudents who meet stated requirements are eligible to write an honorsthesis in their senior year. Students should consult the listed honorsrequirements of whichever of the two departments their primary thesisadvisor belongs to, at the respective departments' websites.

Professional TrackThe requirements for the professional track include all those of thestandard track, as well as the following:









Applied Mathematics-Computer ScienceConcentration RequirementsThe Sc.B. concentration in Applied Math-Computer Science provides afoundation of basic concepts and methodology of mathematical analysisand computation and prepares students for advanced work in computerscience, applied mathematics, and scientific computation. Concentratorsmust complete courses in mathematics, applied math, computer science,and an approved English writing course. While the concentration in

6 Computer Science

Computer Science 7

Applied Math-Computer Science allows students to develop the use ofquantitative methods in thinking about and solving problems, knowledgethat is valuable in all walks of life, students who have completed theconcentration have pursued graduate study, computer consulting andinformation industries, and scientific and statistical analysis careersin industry or government. This degree offers a standard track and aprofessional track.

Requirements for the Standard Track of theSc.B. degree.Prerequisites - two semesters of Calculus, for example

MATH 0090& MATH 0100

Introductory Calculus, Part Iand Introductory Calculus, Part II

MATH 0170 Advanced Placement CalculusConcentration Requirements (17 courses)Core-Math:MATH 0180 Intermediate Calculus 1

or MATH 0350 Honors CalculusMATH 0520 Linear Algebra 1


Algebra for Computer ScienceCore-Applied Mathematics:APMA 0350 Applied Ordinary Differential Equations 1APMA 0360 Applied Partial Differential Equations I 1APMA 1170 Introduction to Computational Linear

Algebra1

or APMA 1180 Introduction to Numerical Solution of DifferentialEquations

Core-Computer Science:Select one of the following Series: 2






Science (and an additional CS course nototherwise used to satisfy a concentrationrequirement; (this course may be CSCI0180, an intermediate-level CS course, ora 1000-level course) )

Select three of the following intermediate-level courses, oneof which must be math-oriented and one systems-oriented.The intermediate courses must cover the requirements of thepathway chosen under additional requirements for CS.

3




CSCI 1010 Theory of Computation (math)CSCI 1450 Probability for Computing and Data

Analysis (math) 1

or APMA 1650 Statistical Inference I

Three 1000-level Computer Science courses. Two of thesecourses and the intermediate courses must satisfy one of the CSpathways. 2

3

Three 1000-level Applied Mathematics courses approved by theconcentration advisor, of which two should constitute a standardsequence or address a common theme. Typical sequencesinclude: APMA 1200/1210 and APMA 1650 or 1655/1660.APMA 1910 cannot be used as an elective.

3

A capstone course: a one-semester course, taken in thestudent's last undergraduate year, in which the student (or groupof students) use a significant portion of their undergraduateeducation, broadly interpreted, in studying some current topicin depth, to produce a culminating artifact such as a paper orsoftware project. The title and abstract of the artifact, along withthe student's and faculty-sponsor's names, will be placed in theCS website. The inclusion of a relevant image or system diagramis strongly encouraged. The complete text of the best artifacts ofeach class will be featured on the CS website. A senior thesis,which involves two semesters of work, may count as a capstone.3

1

Note: CSCI 1010 and 1450 may be used either as a math-oriented intermediate courses or as advanced courses.CSCI 1010 was formerly known as CSCI 510: they are the samecourse and hence only one may be taken for credit. CSCI 1450was formerly known as CSCI 450: they are the same courseand hence only one may be taken for credit. Applied Math1650 or 1655 may be used in place of CSCI 1450. However,concentration credit will be given for only one of Applied Math1650, 1655, and CSCI 1450.

Total Credits 171

APMA 1650 may only be used if not being used as an Applied Mathcourse.

2Pathways may be viewed here: https://cs.brown.edu/degrees/undergrad/concentrating-in-cs/concentration-requirements-2020/pathways-for-undergraduate-and-masters-students/

3Capstone Options may be found here: https://cs.brown.edu/degrees/undergrad/concentrating-in-cs/concentration-requirements-2020/capstone/

Requirements for the Professional Track ofthe Sc.B. degree.The requirements for the professional track include all those of thestandard track, as well as the following:









Computer Science 7

8 Computer Science

Mathematics-Computer ScienceConcentration RequirementsStudents may opt to pursue an interdisciplinary Bachelor of Sciencedegree in Math-Computer Science, a concentration administeredcooperatively between the mathematics and computer sciencedepartments. Course requirements include math- and systems-oriented computer science courses, as well as computational coursesin applied math. Students must identify a series of electives that coherearound a common theme. As with other concentrations offered by theComputer Science department, students have the option to pursuethe professional track (http://www.cs.brown.edu/ugrad/concentrations/professional.track.html) of the ScB program in Mathematics-ComputerScience.

Requirements for the Standard Track of theSc.B. degree.PrerequisitesThree semesters of Calculus to the level of MATH 0180,MATH 0200, or MATH 0350

3

MATH 0520 Linear Algebra 1or MATH 0540 Honors Linear Algebraor CSCI 0530 Coding the Matrix: An Introduction to Linear

Algebra for Computer ScienceCore CoursesMATH 1530 Abstract Algebra 1Select one of the following series: 2






Science (and an additional CS course nototherwise used to satisfy a concentrationrequirement; this course may be CSCI0180, an intermediate-level CS course, ora 1000-level CS course)

CSCI 0320 Introduction to Software Engineering 1or CSCI 0330 Introduction to Computer Systems

CSCI 0220 Introduction to Discrete Structures andProbability

1

or CSCI 1010 Theory of ComputationThree 1000-level Mathematics courses 3Three advanced courses in Computer Science 1, 2 3Three additional courses different from any of the above chosenfrom Mathematics, Computer Science, Applied Mathematics, orrelated areas 3

3

A capstone course in Computer Science or Mathematics 4 1

Total Credits 191

These courses must be at the 1000-level or higher. Two of thesecourses and the intermediate courses must satisfy one of the CSpathways (https://cs.brown.edu/degrees/undergrad/concentration-requirements/pathways-for-undergraduate-and-masters-students).

2Note: CSCI 1010 may be used either as a math-oriented intermediatecourse or as an advanced course. CSCI 1010 was formerly knownas CSCI 510: they are the same course and hence only one maybe taken for credit. CSCI 1450 was formerly known as CSCI 450:they are the same course and hence only one may be taken forcredit. Applied Math 1650 or 1655 may be used in place of CSCI1450 in CS pathway requirements (https://cs.brown.edu/degrees/undergrad/concentration-requirements/pathways-for-undergraduate-and-masters-students). However, concentration credit will be given foronly one of Applied Math 1650, 1655, and CSCI 1450.

3 These must be approved by a concentration advisor.

4A one-semester course, taken in the student's last undergraduateyear, in which the student (or group of students) use a significantportion of their undergraduate education, broadly interpreted, instudying some current topic in depth, to produce a culminating artifactsuch as a paper or software project. The title and abstract of theartifact, along with the student's and faculty-sponsor's names, willbe placed in the CS website. The inclusion of a relevant image orsystem diagram is strongly encouraged. The complete text of thebest artifacts of each class will be featured on the CS website. Asenior thesis, which involves two semesters of work, may count asa capstone (http://cs.brown.edu/degrees/undergrad/concentrations/capstone).

Requirements for the Professional Track of the Sc.B. degree.

The requirements for the professional track include all those of thestandard track, as well as the following:









Computer Science Graduate ProgramThe department of Computer Science offers two graduate degrees incomputer science. The Master of Science (Sc.M.) degree for those whowish to improve their professional competence in computer science or toprepare for further graduate study, and the Doctor of Philosophy (Ph.D)degree.

For more information on admission, please visit the following website:

http://www.brown.edu/academics/gradschool/programs/computer-science

Ph.D. RequirementsRequirements for the Ph.D. program can be found at https://cs.brown.edu/degrees/doctoral/reqs/reqs_phd.2015.pdf

8 Computer Science

Computer Science 9

Requirements for the Masters DegreeThe requirements consist of a basic component and an advancedcomponent. All courses must be at the 1000 level or higher. All coursesmust be completed with a grade of B or better.

The courses in student's program must be approved by the director of theMaster's program (as well as by the student's advisor).

Basic ComponentThe basic component consists of six courses. None of these courses maybe reading and research courses such as CSCI 1970 and CSCI 2980.

The six courses are chosen as follows:

• Two must be CS courses that form a pathway (see the explanation ofpathways at https://cs.brown.edu/degrees/undergrad/concentration-requirements/pathways-for-undergraduate-and-masters-students).

• One must be a CS course in an area that’s not listed in the chosenpathway (it must not be a core course, must not be a grad course, andmust not be a related course of the pathway).

• The three additional courses must be in CS or related and mustbe approved by your advisor or the director of graduate studies(master’s). Getting this approval will require you to show that thecourses are relevant to your CS interests. In general, the more non-CScourses you wish to take, the stronger your justification must be.

Advanced Component

The advanced component requires the student to complete one of thefollowing six options. Reading and research courses (such as CSCI 2980)may be used as part of options 1, 2, 3, and 4, but not as part of options5 and 6. An “advanced course,” as used below, is either a 2000-level CScourses or a 1000-level CS courses that includes a Master's supplement.Master's supplement are nominally half-credit courses, but studentsmay do the work of these courses without officially registering forthem. Examples of such supplements are CSCI 1234 (supplementingCSCI 1230), CSCI 1690 (supplementing CSCI 1670), and CSCI 1729(supplementing CSCI 1730).

“Internships”, as used below, must be approved by the student's advisorand are paid work in the area of the student's master's studies. They maybe full, or part time. A full-time internship must last at least two monthsbut no more than four months. A part-time internship must last at leastfour months but no more than six months. Normally the internship willbe performed between the student's second and third semesters in theprogram.

The six options are:

1. Complete a thesis supervised by her or his advisor and approved bya committee consisting of the advisor and at least one other facultymember.

2. Complete a thesis supervised by her or his advisor and approved bya committee consisting of the advisor and at least one other facultymember, and complete an internship.

3. Complete a project supervised and approved by her or his advisor.4. Complete a project supervised and approved by her or his advisor,

and complete an internship.5. Complete two advanced courses.6. Complete two advanced courses and complete an internship.

RationaleStudents entering the Master's program typically have one of twogoals: they intend to pursue research in Computer Science and arepreparing themselves to enter Ph.D. programs, or they intend to becomeprofessional computer scientists and pursue careers in industry. In bothcases, students should take collections of courses that not only givethem strength in particular areas of Computer Science, but also includecomplementary areas that familiarize them with other ways of thinkingabout the field. For example, a student whose interests are in the practicalaspects of designing computer systems should certainly take coursesin this area, but should also be exposed to the mindset of theoreticalcomputer science. In a rapidly changing discipline, there is much cross-

fertilization among areas and students should have some experience indoing advanced work in areas not directly related to their own.

A student whose goal is a research career should become involved asquickly as possible with a research group as part of their Master's studies,and demonstrate and learn about research by participating in it. Theresulting thesis or project report will serve to establish her or his suitabilityfor entering a Ph.D. program.

A student whose goal is to be a professional computer scientist shouldhave some professional experience as part of her or his preparation. Acertain amount of coursework is required before a student can qualifyfor a pedagogically useful internship. Students with limited experiencein Computer Science should take a few advanced Computer Sciencecourses before embarking on an internship. Other students, particularlythose whose undergraduate degrees were at Brown, will have hadinternship experiences while undergraduates. Internships provide insightsfor subsequent courses and project work at Brown. Students without suchexperiences are at a disadvantage with respect to their peers. Thus westrongly encourage students who have not had such experience to chooseof of options 2, 4, and 6, for which internships are required.

Note that these internships are not courses and the work is not evaluatedas it would be for a course. Students' advisors will assist them in choosingand obtaining internships, but it is up to students themselves to ensurethat they get as much benefit as possible from their experiences. Theymust be able to take advantage of these experiences while completingtheir Master's projects – we expect as high-quality work from them aswe do from students who entered the program with prior internshipexperiences.

A Master's degree normally requires three to four semesters of full-timestudy, depending upon one's preparation.

CSCI 1010 Theory of Computation 1CSCI 1230 Introduction to Computer Graphics * 1CSCI 1250 Introduction to Computer Animation 1CSCI 1260 Compilers and Program Analysis 1CSCI 1270 Database Management Systems 1CSCI 1280 Intermediate 3D Computer Animation 1CSCI 1300 User Interfaces and User Experience 1CSCI 1310 Fundamentals of Computer Systems 1CSCI 1320 Creating Modern Web & Mobile

Applications1

CSCI 1370 Virtual Reality Design for Science 1CSCI 1380 Distributed Computer Systems 1CSCI 1410 Artificial Intelligence 1CSCI 1420 Machine Learning 1CSCI 1430 Computer Vision 1CSCI 1450 Probability for Computing and Data

Analysis1

CSCI 1460 Computational Linguistics 1CSCI 1510 Introduction to Cryptography and

Computer Security1

CSCI 1550 Probabilistic Methods in ComputerScience

1

CSCI 1570 Design and Analysis of Algorithms 1CSCI 1590 Introduction to Computational Complexity 1CSCI 1600 Real-Time and Embedded Software 1CSCI 1610 Building High-Performance Servers 1CSCI 1660 Introduction to Computer Systems

Security *1

CSCI 1670 Operating Systems * 1CSCI 1680 Computer Networks 1CSCI 1730 Design and Implementation of

Programming Languages1

CSCI 1760 Multiprocessor Synchronization 1CSCI 1780 Parallel and Distributed Programming 1

Computer Science 9

10 Computer Science

CSCI 1800 Cybersecurity and International Relations 1CSCI 1810 Computational Molecular Biology 1CSCI 1820 Algorithmic Foundations of Computational

Biology1

CSCI 1900 csciStartup 1CSCI 1950Y Logic for Systems 1CSCI 1951A Data Science 1CSCI 1951C Designing Humanity Centered Robots 1CSCI 1951G Optimization Methods in Finance 1CSCI 1951J Interdisciplinary Scientific Visualization 1CSCI 2240 Interactive Computer Graphics 1CSCI 2270 Topics in Database Management 1CSCI 2310 Human Factors and User Interface Design 1CSCI 2330 Programming Environments 1CSCI 2340 Software Engineering 1CSCI 2370 Interdisciplinary Scientific Visualization 1CSCI 2410 Statistical Models in Natural-Language

Understanding1

CSCI 2420 Probabilistic Graphical Models 1CSCI 2500A Advanced Algorithms 1CSCI 2500B Optimization Algorithms for Planar Graphs 1CSCI 2510 Approximation Algorithms 1CSCI 2540 Advanced Probabilistic Methods in

Computer Science1

CSCI 2550 Parallel Computation: Models, Algorithms,Limits

1

CSCI 2590 Advanced Topics in Cryptography 1CSCI 2730 Programming Language Theory 1CSCI 2750 Topics in Parallel and Distributed

Computing1

CSCI 2820 Advanced Algorithms in ComputationalBiology and Medical Bioinformatics

1

CSCI 2950K Special Topics in ComputationalLinguistics

1

CSCI 2950T Topics in Distributed Databases andSystems

1

CSCI 2950U Special Topics on Networking andDistributed Systems

1

CSCI 2951E Topics in Computer Systems Security 1CSCI 2951F Learning and Sequential Decision Making 1CSCI 2951K Topics in Collaborative Robotics 1CSCI 2951M Advanced Algorithms Seminar 1CSCI 2951N Advanced Algorithms in Computational

Biology1

CSCI 2951O Foundations of Prescriptive Analytics 1CSCI 2951S Distributed Computing through

Combinatorial Topology1

CSCI 2951T Data-Driven Computer Vision 1CSCI 2951U Topics in Software Security 1* Students may arrange with the instructor to receive 2000 levelcredit for additional coursework in CSCI 1230, 1660 or 1670

Concurrent ScB (NUS) and ScM inComputational Biology (Brown University)The School of Computing at National University of Singapore and TheDepartment of Computer Science at Brown have established a concurrentBachelor’s and Master’s degree program in Computational Biology. Afterhaving first completed four years of undergraduate study at NationalUniversity of Singapore (NUS), qualified students will attend BrownUniversity to complete their fifth and final year of study in computationalbiology. After the successful completion of requirements set forth by bothuniversities, the students will simultaneously earn both their Sc.B. and

Sc.M. degrees. The Sc.B will be awarded by the National University ofSingapore, while the Sc.M. is awarded by Brown University.

CoursesCSCI 0020. The Digital World.Removes the mystery surrounding computers and the ever-growing digitalworld. Introduces a range of topics and many aspects of multimedia,along with explanations of the underlying digital technology and itsrelevance to our society. Other topics include artificial intelligence, ITsecurity, ethics and the economics of computing as well as the effectsof its pervasiveness in today’s world. Introductory programming andanalytic skills are developed through HTML, Photoshop, Excel and Pythonassignments. CSCI 0020 is a good introduction to a wide range of CStopics that have broad relevance in our society. No prerequisites.Fall CSCI0020 S01 16575 TTh 9:00-10:20(02) (D. Stanford)

CSCI 0030. Introduction to Computation for the Humanities andSocial Sciences.Introduces students to the use of computation for solving problems in thesocial sciences and the humanities. We will investigate a series of real-world problems taken from the news, from books such as Freakonomics,and from current research. Topics covered include data gathering,analysis, and visualization; web-based interfaces; algorithms; andscripting. Enrollment limited to 20. Instructor permission required.

CSCI 0040. Introduction to Scientific Computing and ProblemSolving.CSCI0040 provides an introduction to using computers to solve STEM(Science, Technology, Engineering and Mathematics) data analysis,visualization and simulation problems from engineering, neuroscience,biology, mathematics and finance.

Students will access and analyze a number of "real world" data sets whilebecoming fluent MATLAB programmers. Other tools utilized may includeExcel, Wolframalpha and Python.

By course end, students should be able to use MATLAB to solve a largevariety of scientific data analysis, visualization and simulation problems.

No prior programming experience is required (MATLAB is easy and fun touse).

CSCI 0050. A Data-Centric Introduction to Programming.An introduction to computer programming with a focus on skills neededfor data-intensive applications. Topics include core constructs forprocessing both tabular and structured data; decomposing problems intoprogramming tasks; data structures; algorithms; and testing programs forcorrect behavior.

CSCI 0060. Practical System Skills.An introduction to develop hands-on-computing skills necessary tocomfortably work within a UNIX-like operating system. Topics include theshell, its filesystem, bash scripting, SSH, version control, as well as howto locally develop, deploy and publish a website. https://cs.brown.edu/courses/csci0060/

CSCI 0080. A First Byte of Computer Science.Introduces non-CS concentrators to the academic discipline of computerscience, its thought processes, and its relevance to other fields andmodern life more generally. The target audience is students who areinterested in learning more about what computer science is about and theideas it has to offer tomorrow's citizens and scholars. Topics include thebasics of computation and programming, a taste of theoretical computerscience and algorithms, and an introduction to codes and artificialintelligence. Although students will learn to read and understand shortprograms, the course will not teach or require advanced programmingskills.

10 Computer Science

Computer Science 11

CSCI 0081. TA Apprenticeship: Full Credit.Being an undergraduate TA is a learning experience: one not only getsa deeper understanding of the course material, but gains managementand social skills that are invaluable for one's future. Students taking thiscourse must first be selected as an undergraduate TA for a ComputerScience course, a course the student has taken and done well in. Studentswill work with the course's instructor on a variety of course-related topics,including preparation of material and development of assignments.Whether CSCI 0081 or its half-credit version (CSCI 0082) is taken is up tothe professor of the course being TA'd. Instructor permission required.Fall CSCI0081 S01 16576 Arranged (T. Doeppner)Spr CSCI0081 S01 25078 Arranged (T. Doeppner)

CSCI 0082. TA Apprenticeship: Half Credit.Being an undergraduate TA is a learning experience: one not only getsa deeper understanding of the course material, but gains managementand social skills that are invaluable for one's future. Students taking thiscourse must first be selected as an undergraduate TA for a ComputerScience course, a course the student has taken and done well in. Studentswill work with the course's instructor on a variety of course-related topics,including preparation of material and development of assignments.Whether CSCI 0082 or its full-credit version (CSCI 0081) is taken is up tothe professor of the course being TA'd. Instructor permission required.Fall CSCI0082 S01 16577 Arranged (T. Doeppner)Spr CSCI0082 S01 25079 Arranged (T. Doeppner)

CSCI 0100. Data Fluency for All.This course is intended to introduce Brown students to computationaltechniques that data scientists use to tell stories. Data fluencyencompasses both data literacy, the basics of statistics and machinelearning, and data communication, which relies heavily on principles ofdesign. Students will gain hands on experience using statistical toolssuch as 'R' to analyze real world data sets, and 'ggplot' to visualize them.Sample application domains include just about every field, since the onlyrequirement is data, which there almost always are (e.g., the completeworks of Shakespeare is a sample data set).Fall CSCI0100 S01 16578 MWF 11:00-11:50(16) (A. Greenwald)

CSCI 0111. Computing Foundations: Data.An introduction to computing and programming that focuses onunderstanding and manipulating data. Students will learn to writeprograms to process both tabular and structured data, to assess programsboth experimentally and theoretically, to apply basic data scienceconcepts, and to discuss big ideas around the communication and use ofdigital information.Designed for both concentrators and non-concentrators, this is the first inan eventual three-course introductory sequence leading into advancedCS courses. Programming assignments will be smaller scale than in CSCI0150/0170, thus allowing students time to practice programming anddiscuss computational ideas in a broader context.Fall CSCI0111 S01 16579 MWF 10:00-10:50(14) (K. Fisler)Spr CSCI0111 S01 25075 MWF 9:00-9:50(02) (D. Woos)

CSCI 0130. User Interfaces and User Experience.Topics include understanding when to use different interfaces, modelingand representing user interaction, principles of user experience design,eliciting requirements and feedback from users, methods for designing andprototyping interfaces, and user interface evaluation. Students interestedin learning the process behind building a user interface and gaininghands-on experience designing a user interface should take this course.Programming experience is unnecessary. There will be assignments,readings, and design labs. CSCI 0130 is the same lecture, labs, andreadings as CSCI 1300 but half of the assignments will be different(CSCI 1300 will have assignments with computer science prerequisites).Website: http://cs.brown.edu/courses/csci1300/

CSCI 0150. Introduction to Object-Oriented Programming andComputer Science.Emphasizes object-oriented design and programming in Java, an effectivemodern technique for producing modular, reusable, internet-awareprograms. Also introduces interactive computer graphics, user interfacedesign and some fundamental data structures and algorithms. A sequenceof successively more complex graphics programs, including Tetris,and culminating in a significant final project, helps provide a seriousintroduction to the field intended for both potential concentrators and thosewho may take only a single course. No prerequisites, no prior knowledgeof programming required.Fall CSCI0150 S01 16581 TTh 2:30-3:50(12) (A. van Dam)

CSCI 0160. Introduction to Algorithms and Data Structures.Introduces fundamental techniques for problem solving by computerthat are relevant to most areas of computer science, both theoreticaland applied. Algorithms and data structures for sorting, searching,graph problems, and geometric problems are covered. Programmingassignments conform with the object-oriented methodology introduced inCSCI 0150. Prerequisite: CSCI 0150 or written permission.Spr CSCI0160 S01 25076 TTh 1:00-2:20(08) (D. Woos)

CSCI 0170. Computer Science: An Integrated Introduction.CSCI0170/0180 is an introductory sequence that helps students beginto develop the skills, knowledge, and confidence to solve computationalproblems elegantly, correctly, efficiently, and with ease. The sequenceis unique in teaching both the functional and imperative programmingparadigms---the first through the languages Scheme and ML in CSCI0170;the second through Java in CSCI0180. The sequence requires noprevious programming experience. Indeed, few high school students areexposed to functional programming; hence even students with previousprogramming experience often find this sequence an invaluable part oftheir education.

Although students are taught to use programming languages as tools,the goal of CSCI0170/0180 is not merely to teach programming. Onthe contrary, the goal is to convey to students that computer science ismuch more than programming! All of the following fundamental computerscience techniques are integrated into the course material: algorithms,data structures, analysis, problem solving, abstract reasoning, andcollaboration. Concrete examples are drawn from different subareasof computer science: in 0170, from arbitrary-precision arithmetic,natural language processing, databases, and strategic games; in 0180,from discrete-event simulation, data compression, and client/serverarchitectures.Fall CSCI0170 S01 16582 MWF 10:00-10:50(14) (J. Hughes)

CSCI 0180. Computer Science: An Integrated Introduction.A continuation of CSCI 0170. Students learn to program in Java whilecontinuing to develop their algorithmic and analytic skills. Emphasisis placed on object-oriented design, imperative programming, and theimplementation and use of data structures. Examples are drawn from suchareas as databases, strategy games, web programming, graphical userinterfaces, route finding, and data compression. Lab work done with theassistance of TAs. Prerequisite: CSCI 0170 or CSCI 0190.Spr CSCI0180 S01 25077 MWF 11:00-11:50(04) (K. Fisler)

CSCI 0190. Accelerated Introduction to Computer Science.A one-semester introduction to CS covering programming integratedwith core data structures, algorithms, and analysis techniques, similarto the two-course introductory sequences (CSCI 0150-0160 and CSCI0170-0180). Students wishing to take CSCI 0190 must pass a a sequenceof online placement assignments. Though the placement process ismost appropriate for students who have had some prior programmingexperience, it is self-contained so all are welcome to try learning theprovided material and attempting placement. Placement information will beavailable by June 1st at http://cs.brown.edu/courses/csci0190/. Studentswho do not successfully pass the placement process won't be allowed toregister.Fall CSCI0190 S01 16583 MWF 9:00-9:50(01) (S. Krishnamurthi)

Computer Science 11

12 Computer Science

CSCI 0220. Introduction to Discrete Structures and Probability.Seeks to place on solid foundations the most common structures ofcomputer science, to illustrate proof techniques, to provide the backgroundfor an introductory course in computational theory, and to introduce basicconcepts of probability theory. Introduces Boolean algebras, logic, settheory, elements of algebraic structures, graph theory, combinatorics, andprobability. No prerequisites.Spr CSCI0220 S01 25080 MWF 1:00-1:50(06) (M. Littman)

CSCI 0310. Introduction to Computer Systems.Basic principles of computer organization. Begins with machinerepresentation of data types and logic design, then explores architectureand operations of computer systems, including I/O, pipelining, andmemory hierarchies. Uses assembly language as an intermediateabstraction to study introductory operating system and compiler concepts.Prerequisite: CSCI 0150 or CSCI 0180 or CSCI 0190.

CSCI 0320. Introduction to Software Engineering.Techniques for designing, building, and maintaining large,scalable, andreusable systems. We will cover advanced programming techniques usingJava and Javascript. Course assignments will familiarize students withsoftware testing, relational databases, concurrency techniques such asthreads, and software engineering tools like git, profilers, and debuggers.A major component of the course will be a group software project of yourown design.

Prerequisite: CSCI 0160, CSCI 0180 or CSCI 0190; CSCI 0220 isrecommended.Spr CSCI0320 S01 25081 TTh 1:00-2:20(08) (T. Nelson)

CSCI 0330. Introduction to Computer Systems.High-level computer architecture and systems programming. The coursecovers the organization of computer systems (in terms of storage units,caches, processors, and I/O controllers) and teaches students assembly-language programming and C-language programming. Extensiveprogramming exercises introduce students to systems-level programmingon Unix systems, as well as to multi-threaded programming with POSIXthreads. Students will be introduced to the functions of operating systems.Prerequisite: CSCI 0150, 0180, or 0190.Fall CSCI0330 S01 16584 MWF 2:00-2:50(07) (T. Doeppner)

CSCI 0530. Coding the Matrix: An Introduction to Linear Algebra forComputer Science.Introduces vectors, matrices and their role in computer science in threecomponents: (1) concepts, theorems, and proofs, (2) procedures andprograms, (3) applications and working with data. Weekly lab sessionswhere students apply concepts to a real task with real data. Examplelabs: transformations in 2-d graphics, error-correcting codes, imagecompression using wavelets, synthesizing a new perspective in a photo,face recognition, news story categorization, cancer diagnosis usingmachine learning, matching airplanes to destinations, Google's PageRankmethod. Other topics as time allows. Skills in programming and priorexposure to reading and writing mathematical proofs required.

CSCI 1010. Theory of Computation.The course introduces basic models of computation including languages,finite-state automata and Turing machines. Proves fundamental limitson computation (incomputability, the halting problem). Provides thetools to compare the hardness of computational problems (reductions).Introduces computational complexity classes (P, NP, PSPACE andothers). Prerequisite: CSCI 0220 or 1450.

CSCI 1230. Introduction to Computer Graphics.Fundamental concepts in 2D and 3D computer graphics, e.g., 2D rastergraphics techniques, simple image processing, and user interface design.Focuses on geometric transformations, and 3D modeling, viewing andrendering. A sequence of assignments in C++ culminates in a simplegeometric modeler and ray tracer. Prerequisite: CSCI 0160, CSCI 0180,or CSCI 0190. Some knowledge of basic linear algebra is helpful but notrequired. Strong object-oriented programming ability (e.g., in C++, Java orPython) is required.Fall CSCI1230 S01 16589 MW 3:00-4:20(17) (J. Hughes)

CSCI 1234. Computer Graphics Lab.CSCI 1234 is a half-credit course intended to be taken concurrently withCSCI 1230 and provides students with a greater understanding of thematerial by having them extend each of 1230's assignments to greaterdepth.Fall CSCI1234 S01 16763 Arranged (J. Hughes)

CSCI 1250. Introduction to Computer Animation.Introduction to 3D computer animation production including storywriting, production planning, modeling, shading, animation, lighting,and compositing. The first part of the course leads students throughprogressive exercises that build on each other to learn basic skillsin 2D and 3D animation. At each step, student work is evaluated forexpressiveness, technical correctness and aesthetic qualities. Studentsthen work in groups creating a polished short animation. Emphasis on in-class critique of ongoing work which is essential to the cycle of visuallyevaluating work in progress, determining improvements, and implementingthem for further evaluation.

Please see course website for application procedure.Fall CSCI1250 S01 16588 MW 12:00-1:50 (B. Meier)

CSCI 1260. Compilers and Program Analysis.Lexical analysis, syntactic analysis, semantic analysis, code generation,code optimization, translator writing systems. Prerequisites: CSCI 0220and 0320; 0510 is recommended.Fall CSCI1260 S01 16794 TTh 10:30-11:50(11) (D. Woos)

CSCI 1270. Database Management Systems.Introduction to database structure, organization, languages, andimplementation. Relational model, query languages, query processing,query optimization, normalization, file structures, concurrency controland recovery algorithms, and distributed databases. Coverage ofmodern applications such as the Web, but with emphasis on DatabaseManagement Systems internals. Prerequisites: CSCI 0160, CSCI 0180, orCSCI 0190. One of CSCI 0330 or CSCI 0320 is strongly recommended.Fall CSCI1270 S01 16586 MW 3:00-4:20(17) (S. Zdonik)

CSCI 1280. Intermediate 3D Computer Animation.Continues work begun in CSCI 1250 with deeper exploration oftechnical and artistic aspects of 3D computer animation including moresophisticated shading and lighting methods and character modeling,rigging, animation, and dynamics. After a series of individual exercises,students pursue an independent topic and then, working alone or inpairs, create a polished demonstration. Emphasis is on in-class critiqueof ongoing work. Prerequisite: CSCI 1250. Students may contact theinstructor in December for permission.Spr CSCI1280 S01 25082 MW 12:00-1:50 (B. Meier)

CSCI 1290. Computational Photography.Describes the convergence of computer graphics and computer visionwith photography. Its goal is to overcome the limitations of traditionalphotography using computational techniques to enhance the way wecapture, manipulate, and interact with visual media. Topics covered:cameras, human visual perception, image processing and manipulation,image based lighting and rendering, high dynamic range, singleview reconstruction, photo quality assessment, non photorealisticrendering, the use of Internet-scale data, and more. Students areencouraged to capture and process their own data. Prerequisites: previousprogramming experience, basic linear algebra, calculus, and probability;previous knowledge of computer graphics or computer vision. Stronglyrecommended: CSCI 1230, CSCI 1430, ENGN 1610.

CSCI 1300. User Interfaces and User Experience.Topics include understanding when to use different interfaces, modelingand representing user interaction, principles of user experience design,eliciting requirements and feedback from users, methods for designing andprototyping interfaces, and user interface evaluation. Students interestedin learning the process behind building a user interface and gaining hands-on experience designing a user interface should take this course. Therewill be assignments, readings, and design labs. CSCI 1300 and CS 0130share the same lecture, labs, and readings but half of the assignmentswill be different (CSCI 1300 will have assignments with computer scienceprerequisites). Website: http://cs.brown.edu/courses/csci1300/

12 Computer Science

Computer Science 13

CSCI 1310. Fundamentals of Computer Systems.Covers fundamental concepts, principles, and abstractions that underliethe design and engineering of computer systems, with reference toapplications of these concepts in industry. Topics include machineorganization, systems programming and performance, key conceptsof operating systems, isolation, security, virtualization, concurrentprogramming, and the basics of distributed systems. Combined lectures,case studies, labs, and several hands-on projects involving programmingexercises. Prerequisites: CSCI 0160, 0180, or 0190; or CSCI 0150, 0170 ifconcurrently taking CSCI 0160 or 0180; or permission of the instructor.Spr CSCI1310 S01 25373 TTh 2:30-3:50(11) (M. Schwarzkopf)

CSCI 1320. Creating Modern Web & Mobile Applications.This course covers all aspects of web application development, includinginitial concept, user-centric design, development methodologies, frontand back end development, databases, security, testing, load testing,accessibility, and deployment. There will be a substantial team project.The course is designed for students with a programming background(equiv CSCI 0320/CSCI 0330) who want to learn how to build webapplications, and for students with a background in web design, includingHTML and Javascript, who are interested in learning how to extenddesign techniques to incorporate the technologies needed in modern webapplications. Project teams will consist of students with both backgrounds.Spr CSCI1320 S01 25151 MWF 10:00-10:50(03) (S. Reiss)

CSCI 1340. Innovating Game Development.What technologies will shape the next generation of videos? Thisproject-centered course focuses on computational innovations for gamedevelopment. Students examine innovative game technology throughcase studies of existing games and talks by industrial and academicgame professionals. In teams, students propose and implement a projectdemonstrating a novel technology for gaming. Recommended: strongcomputational or engineering background.

CSCI 1370. Virtual Reality Design for Science.Explores the visual and human-computer interaction design process forscientific applications in Brown's immersive virtual reality Cave. Joint withRISD. Computer Science and design students learn how to work togethereffectively; study the process of design; learn about scientific problems;create designs applications; critique, evaluate, realize and iterate designs;and demonstrate final projects. Instructor permission required.

CSCI 1380. Distributed Computer Systems.Explores the fundamental principles and practice underlying networkedinformation systems, first we cover basic distributed computingmechanisms (e.g., naming, replication, security, etc.) and enablingmiddleware technologies. We then discuss how these mechanisms andtechnologies fit together to realize distributed databases and file systems,web-based and mobile information systems. Prerequisite: CSCI 0320 orCSCI 0330.Spr CSCI1380 S01 25372 Arranged (T. Benson)

CSCI 1410. Artificial Intelligence.Practical approaches to designing intelligent systems. Topics includesearch and optimization, uncertainty, learning, and decision making.Application areas include natural language processing, machine vision,machine learning, and robotics. Prerequisites: CSCI 0160, CSCI 0180or CSCI 0190; and one of CSCI0220 or CSCI1450 or APMA1650 orAPMA1655.Fall CSCI1410 S01 17200 TTh 10:30-11:50(13) (A. Greenwald)Spr CSCI1410 S01 25152 TTh 1:00-2:20(08) (G. Konidaris)

CSCI 1420. Machine Learning.How can artificial systems learn from examples and discover informationburied in data? We explore the theory and practice of statistical machinelearning, focusing on computational methods for supervised andunsupervised learning. Specific topics include empirical risk minimization,probably approximately correct learning, kernel methods, neural networks,maximum likelihood estimation, the expectation maximization algorithm,and principal component analysis. This course also aims to exposestudents to relevant ethical and societal considerations related to machinelearning that may arise in practice.Please contact the instructor for information about the waitlist.Spr CSCI1420 S01 25153 TTh 2:30-3:50(11) (S. Bach)

CSCI 1430. Computer Vision.How can we program computers to understand the visual world? Thiscourse treats vision as inference from noisy and uncertain data andemphasizes probabilistic and statistical approaches. Topics may includeperception of 3D scene structure from stereo, motion, and shading;segmentation and grouping; texture analysis; learning, object recognition;tracking and motion estimation. Strongly recommended: basic linearalgebra, calculus, and probability.Spr CSCI1430 S01 25375 Arranged (J. Tompkin)

CSCI 1440. Computation in Economics and Games.This course examines topics in game theory and mechanism design froma computer scientist’s perspective. Through the lens of computation, thefocus is the design and analysis of systems utilized by self-interestedagents. Students will investigate how the potential for strategic agentbehavior can/should influence system design, and the ramifications ofconflicts of interest between system designers and participating agents.Emphasis on computational tractability is paramount, so that simpledesigns are often preferred to optimal. Students will learn to analyzecompeting designs using the tools of theoretical computer science, andempirical tools, such as empirical game-theoretic analysis. Applicationareas include computational advertising, wireless spectrum, and predictionmarkets.

CSCI 1450. Probability for Computing and Data Analysis.Probability and statistics have become indispensable tools in computerscience. Probabilistic methods and statistical reasoning play major rolesin machine learning, cryptography, network security, communicationprotocols, web search engines, robotics, program verification, and more.This course introduces the basic concepts of probability and statistics,focusing on topics that are most useful in computer science applications.Topics include: modeling and solution in sample space, random variables,simple random processes and their probability distributions, Markovprocesses, limit theorems, and basic elements of Bayesian and frequentiststatistical inference. Basic programming experience required forhomework assignments. Students cannot get concentration credit for bothCSCI1450 and APMA1650/APMA1655Fall CSCI1450 S01 16587 TTh 2:30-3:50(12) (E. Upfal)

CSCI 1460. Computational Linguistics.The application of computational methods to problems in natural-languageprocessing. In particular we examine techniques due to recent advances indeep learning: word embeddings, recurrent neural networks (e.g., LSTMs),sequence-to-sequence models, and generative adversarial networks(GANs). Programming projects include parsing, machine translation,question answering, and chat-bots. The prerequisite of CS 1470 (or theequivalent background) is very important.Spr CSCI1460 S01 25377 MWF 2:00-2:50(07) (E. Charniak)

CSCI 1470. Deep Learning.Deep learning is the name for a particular version of neural networks--a version that emphasizes multiple layers of networks. Deep leaning,plus the specialized techniques that it has inspired (e.g. convolutionalfeatures and word embeddings) have lead to rapid improvements in manyapplications such as computer vision, machine translation, and computerGo. This course intends to give students a practical understanding ofdeep learning as applied in these and other areas. It also teaches theTensorflow programming language for the expression of deep leaningalgorithms. (The primary API for Tensorflow is from Python.)This course is using its own waitlist. If the course is full, you can signup for the waitlist using this form: https://docs.google.com/forms/d/e/1FAIpQLSffeOCnsiVMT0svyjLH2IHcNC_FIQHrKl3C7W_PwG7Cu9aWSw/viewform?usp=sf_linkYou can check your position on the waitlist by submittinga request here: https://docs.google.com/forms/d/e/1FAIpQLSesSF50NfPs40rAs9PnSZA92PbdHVdEUObKwvQVzGGIYAdYWg/viewform?usp=sf_linkNote that you must be logged in to your Brown Google account in order toview these links.IMPORTANT: *The course staff will not reply to emails about the waitlist.*The instructions above tell you all you need to know about getting on it andchecking where you are.Fall CSCI1470 S01 16590 MWF 12:00-12:50(15) (D. Ritchie)

Computer Science 13

14 Computer Science

CSCI 1480. Building Intelligent Robots.How do robots function autonomously in dynamic, unpredictableenvironments? This course focuses on programming mobile robots,such as the iRobot Roomba, to perceive and act autonomously in real-world environments. The major paradigms for autonomous control androbot perception are examined and compared with robotic notions inscience fiction. Prerequisite: CSCI 0150, CSCI 0170 or CSCI 0190.Recommended: CSCI 1410 or CSCI 1230.

CSCI 1490. Introduction to Combinatorial Optimization.This course covers the algorithmic aspects of optimizing decisions infully observable, non-changing environments. Students are introducedto state-of-the-art optimization methods such as linear programming,integer programming, local search, and constraint programming. Stronglyrecommended: CSCI 0160, CSCI 0180 or CSCI 0190; CSCI 0510; andCSCI 0530 or MATH 0520 or MATH 0540.

CSCI 1510. Introduction to Cryptography and Computer Security.This course studies the tools for guaranteeing safe communication andcomputation in an adversarial setting. We develop notions of securityand give provably secure constructions for such cryptographic objects ascryptosystems, signature schemes and pseudorandom generators. Wealso review the principles for secure system design. Prerequisites: CSCI0220, and either CSCI 0510 or CSCI 1010.

CSCI 1550. Probabilistic Methods in Computer Science.Randomization and probabilistic techniques play an important role inmodern computer science, with applications ranging from combinatorialoptimization and machine learning to communications networksand secure protocols. This course introduces the most fundamentalprobabilistic techniques used in computer science applications, inparticular in randomized algorithms, probabilistic analysis of algorithmsand machine learning.

Prerequisite: Basic background in probability theory course such as CSCI1450.Spr CSCI1550 S01 25192 TTh 2:30-3:50(11) (E. Upfal)

CSCI 1570. Design and Analysis of Algorithms.A single algorithmic improvement can have a greater impact on our abilityto solve a problem than ten years of incremental improvements in CPUspeed. We study techniques for designing and analyzing algorithms.Typical problem areas addressed include hashing, searching, dynamicprogramming, graph algorithms, network flow, and optimization algorithmsincluding linear programming. Prerequisites: CSCI 0160, CSCI 0180, orCSCI 0190, and one of CSCI 0220, CSCI 1010, CSCI 1450, MATH 0750,MATH 1010, MATH 1530.

CSCI 1575. Algorithms: in Depth.Half-credit course intended to be taken with CSCI 1570. Students willexplore each topic in greater depth by collaboratively solving homeworkproblems that will reinforce valuable new perspectives on the material.Corequisite: CSCI 1570.

CSCI 1580. Information Retrieval and Web Search.Covers traditional material as well as recent advances in informationretrieval (IR), the study of indexing, processing, and querying of textualdata. The focus will be on newer techniques geared to hypertextdocuments available on the World Wide Web. Topics include efficienttext indexing; Boolean and vector space retrieval models; evaluation andinterface issues; Web crawling, link-based algorithms, and Web metadata;text/Web clustering, classification; text mining.

CSCI 1590. Introduction to Computational Complexity.Introduction to serial and parallel models of computation; time and spacecomplexity classes on these models; the circuit model of computation andits relation to serial and parallel time complexity; space-time tradeoffs onserial computers; area-time tradeoffs on the VLSI computational model;interactive and probabilistically checkable proofs; the definition of NP interms of probabilistically checkable proofs; hardness of approximations tosolutions to NP-hard problems. Prerequisite: CSCI 0510.

CSCI 1600. Real-Time and Embedded Software.Comprehensive introduction to the design and implementation of softwarefor programmable embedded computing systems, those enclosed indevices such as cellular phones, game consoles, and car engines.Includes the overall embedded real-time software design and developmentprocesses, as well as aspects of embedded hardware and real-time,small-footprint operating systems. Major project component. Prerequisites:CSCI 0320 or 0330.

CSCI 1610. Building High-Performance Servers.In depth study of modern server design. Considers architectures forbuilding high-performance, robust, scalable, and secure network servers.We will consider all aspects of "mission-critical" servers. Topics includemultithreaded and asynchronous programming techniques, databaseaccess, performance profiling, security, and redundancy. Teams will buildsignificant projects. Prerequisite: CSCI 0320 or 0360. CSCI 1670 or 1680is recommended.

CSCI 1620. Computer Systems Security Lab.CSCI 1620 is a half-credit laboratory course intended to be takenconcurrently with CSCI 1660 and provides students with a deeperunderstanding of the material by doing additional assignments, whichinclude extensions of the 1660's assignments. Instructor permissionrequired.Spr CSCI1620 S01 25194 Arranged (R. Tamassia)

CSCI 1650. Software Security and Exploitation.Covers software exploitation techniques and state-of-the-art mechanismsfor protecting (vulnerable) software. It begins with a summary of prevalentsoftware defects, typically found in applications written in memory unsafelanguages, like C/C++, and proceeds with studying traditional and modernexploitation techniques, ranging from classical code-injection and code-reuse up to the newest goodies (just-in-time code reuse). For the mostpart, it focuses on defenses against certain vulnerability classes andexploitation methods. Students will learn about the boundaries andeffectiveness of virtualization, stack and heap protections, and addressspace randomization, and analyze advanced exploitation techniques andcountermeasures.Fall CSCI1650 S01 16585 MW 3:00-4:20(17) (V. Kemerlis)

CSCI 1660. Introduction to Computer Systems Security.This course teaches principles of computer security from an appliedviewpoint and provides hands-on experience on security threats andcountermeasures. Topics include code execution vulnerabilities (bufferoverflow, sandboxing, mobile code), malware (trojans, viruses, andworms), access control (users, roles, policies), cryptosystems (hashing,signatures, certificates), network security (firewalls, TLS, intrusiondetection, VPN), and human and social issues. Prerequisites: one of CSCI0160 or CSCI 0180 or CSCI 0190; and CSCI 0330.Spr CSCI1660 S01 25193 TTh 1:00-2:20(08) (R. Tamassia)

CSCI 1670. Operating Systems.Covers not just the principles of operating systems but the intricacies ofhow they work. Topics include multithreaded programming, managingthreads and interrupts, managing storage, processor scheduling,operating-system structure, virtualization, security, and the design of filesystems (both local and distributed). Extensive examples are taken fromactual systems, including Linux and Windows. Students are expectedto complete both problem sets and programming assignments (in C).Prerequisite: CSCI 0330.Spr CSCI1670 S01 25195 MWF 2:00-2:50(07) (T. Doeppner)

CSCI 1680. Computer Networks.Covers the technologies supporting the Internet, from Ethernet andWiFi through the routing protocols that govern the flow of traffic andthe web technologies that are generating most of it. A major concern isunderstanding the protocols used on the Internet: what the issues are, howthey work, their shortcomings, and what improvements are on the horizon.Prerequisite: CSCI 0330 or consent of instructor.

14 Computer Science

Computer Science 15

CSCI 1690. Operating Systems Laboratory.Half-credit course intended to be taken with CSCI 1670. Studentsindividually write a simple operating system in C. Serves to reinforce theconcepts learned in 1670 and provides valuable experience in systemsprogramming. Corequisite: CSCI 1670.Spr CSCI1690 S01 25196 Arranged (T. Doeppner)

CSCI 1729. Programming Languages Lab.Half-credit course intended to be taken concurrently with CSCI 1730.Students individually implement a full programming language chosenby the course. Reinforces the concepts learned in CSCI 1730 andprovides valuable experience in implementing programming languages.Corequisite: CSCI 1730

CSCI 1730. Design and Implementation of Programming Languages.Explores the principles of modern programming languages byimplementation. Examines linguistic features, especially control operatorssuch as first-class functions, exceptions, and continuations. Studiesdata and their types, including polymorphism, type inference, and typesoundness. Examines compiler and run-time system topics: continuation-passing style and garbage collection. Prerequisite: CSCI 0160, CSCI 0180or CSCI 0190. Preferred: CSCI 0220, either CSCI 0320 or CSCI 0330, andCSCI 0510.Fall CSCI1730 S01 16591 MWF 11:00-11:50(16) ’To Be Arranged'

CSCI 1760. Multiprocessor Synchronization.This course examines the theory and practice of multiprocessorsynchronization. Subjects covered include multiprocessor architecture,mutual exclusion, wait-free and lock-free synchronization, spin locks,monitors, load balancing, concurrent data structures, and transactionalsynchronization. Prerequisites: CSCI 0330Fall CSCI1760 S01 16592 TTh 1:00-2:20(08) (M. Herlihy)

CSCI 1780. Parallel and Distributed Programming.Covers the practical aspects involved in designing, writing, tuning, anddebugging software designed to run on parallel and distributed systems.Topics might include client-server computation, threads, networks ofworkstations, message passing, shared memory, partitioning strategies,load balancing, algorithms, remote procedure call, and synchronizationtechniques. Prerequisites: CSCI 0220 and either 0320 or 0360; 0510recommended.

CSCI 1800. Cybersecurity and International Relations.The global Internet shortens distances, makes businesses more efficientand facilitates greater social interaction. At the same time, it exposes vitalnational resources to exploitation and makes it easier for the internationalcriminal element to prey on innocent Internet users. Cybersecurity isconcerned with making the Internet a more secure and trustworthyenvironment. In this course we study this topic from the technologicaland policy points of view. The goal is to facilitate communication acrossthe divide that normally characterizes the technological and policycommunities.Spr CSCI1800 S01 25197 MW 3:00-4:20(10) (J. Savage)

CSCI 1805. Computers, Freedom and Privacy.Who is the Big Brother that we most fear? Is it the NSA -- or is it Googleand Facebook? Rapidly changing social mores and the growing problemof cybersecurity have all contributed to a sense that privacy is dead. Lawsprotecting privacy and civil liberties are stuck in the analog age, whilethe capabilities for mass digital surveillance continue to advance rapidly.This course will examine a variety of informational privacy and technologyissues. A major theme: the historical and contemporary struggle to bringsurveillance under democratic control to protect against abuses of privacy,civil liberties and human rights.Fall CSCI1805 S01 16846 TTh 9:00-10:20(02) (T. Edgar)

CSCI 1810. Computational Molecular Biology.High-throughput experimental approaches now allow molecular biologiststo make large-scale measurements of DNA, RNA, and protein, the threefundamental molecules of the cell. The resulting datasets are often toolarge for manual analysis and demand computational techniques. Thiscourse introduces algorithms for sequence comparison and alignment;molecular evolution and phylogenetics; DNA/RNA sequencing andassembly; recognition of genes and regulatory elements; and RNA andprotein structure. The course demonstrates how to model biologicalproblems in terms of computer science.

Prerequisites: CSCI 0160, CSCI 0180 or CSCI 0190, or consent ofinstructor.Fall CSCI1810 S01 16593 TTh 2:30-3:50(12) (S. Istrail)

CSCI 1820. Algorithmic Foundations of Computational Biology.The course is devoted to computational and statistical methods as wellas software tools for DNA, RNA, and protein sequence analysis. Thefocus is on understanding the algorithmic and mathematical foundationsof the methods, the design of associated genomics software tools, as wellas on their applications. Topics include: sequence alignment, genomeassembly, gene prediction, regulatory genomics, and SNP's variation. Thecourse is open to computer and mathematical sciences students as wellas biological and medical students.

CSCI 1870. Cybersecurity Ethics.This timely, topical course offers a comprehensive examination of ethicalquestions in cybersecurity. These issues pervade numerous, diverseaspects of the economy and society in the Information Age, from humanrights to international trade. Students will learn about these topics,beginning first with acquaintance with the dominant ethical frameworksof the 20th and 21st centuries, then employing these frameworks tounderstand, analyze, and develop solutions for leading ethical problemsin cybersecurity. The things that you learn in this course will stay with youand inform your personal and professional lives.Fall CSCI1870 S01 16594 M 3:00-5:30(05) (D. Hurley)

CSCI 1900. csciStartup.In csciStartup, you will incorporate and run a startup. Apply as a teamto be part of a prototype class to remove the mystery from starting acompany and to focus entirely on a product you're passionate about.Teams will incorporate, build a product for real customers, advertisetheir product, and improve it week after week. We'll spend half our classmeetings with individual attention to each group's progress and how toimprove your offerings. Assignments will be designed to apply to anycompany, with enough flexibility to ensure you're always working on thingsthat make sense for your business.

CSCI 1950A. Computational Modeling and Algorithmic Thinking.In this course you will learn how to apply tools from statistics and computerscience to build computational models of physical and biological systems.Example applications include modeling and then simulating the behaviorof a collection of genes, the spread of disease in a population, a singleneuron in isolation or the complex of neurons comprising the primatevisual cortex.

CSCI 1950B. Computational Topology and Discrete Geometry.This course will investigate (through a mixture od lectures and studentpresentations of recent papers) topics in computational topology, includingMorse theory and discrete differential geometry. Other possible topics areknot polyonmials, simplicial homology, and geometric probability theory.Some mathematical sophistication and programming skills required. Noprerequisites.

CSCI 1950H. Computational Topology.We will study various algorithmic problems that arise in the study oftopological phenomena, such as winding number, turning number,knot polynomials, topology of covering spaces (especially Riemannsurfaces), and discrete Morse theory. The mathematical topics will bebriefly introduced before we move to computations, but some a priorimathematical sophistication will make the course more valuable to thestudent. Prerequisite: CSCI 0160, 0180, or 0190.

Computer Science 15

16 Computer Science

CSCI 1950J. Introduction to Computational Geometry.Geometric algorithms in two and three dimensions. Algorithmic andgeometric fundamentals. Point location, convex hulls, proximity (Voronoidiagrams, Delaunay triangulations), intersections, the geometry ofrectangles. Prerequisites: CSCI 0160, 0170, or 0190; and CSCI 0220.

CSCI 1950K. Innovating Game Development.A project-centered course focused on technological, paradigm, and designinnovations for game development. As teams, students will proposeand implement a project demonstrating a novel technology for gaming.Examines the current state and future of game development through aseminar of speakers active in game development and research. A strongcomputer science or engineering background is recommended.

CSCI 1950M. Advanced Practical Combinatorial Algorithms.We review recent as well as well-established advanced techniques incombinatorial optimization and constraint satisfaction. Students will studyand individually present research papers and work on challenging softwareprojects in small teams. Prerequisites: CSCI 0160, 0180, or 0190; andCSCI 0510; and CSCI 1490 or 2580, or instructor permission.

CSCI 1950N. 2D Game Engines.2D Game Engines covers core techniques used in the development ofthe software that drives computer games and other interactive software.Projects involve building different varieties of 2D game engines as wellas games that require use of the features implemented in the engines.Topics include high-level engine design, vector and raster graphics,animation, collision detection, physics, content management, and gameAI. Prerequisite: CSCI 0160, 0180, or 0190. Instructor override is requiredas a technicality; please apply! This course has also been offered as DISPCSCI1971.Fall CSCI1950N S01 16784 Arranged (J. Tompkin)

CSCI 1950R. Compiler Practice.This class covers the practice of compiler writing, including lexicalanalysis, parsing, semantic analysis, code generation, and codeoptimization. Students design and implement a full compiler modularly fora modern functional language using a modern intermediate representationand modular backend. Instructor permission required.

CSCI 1950T. Advanced Animation Production.Students will apply knowledge and skills gained in previous animationcourses to produce a high quality short animated film as a group.Production will follow the industry standard pipeline that includesmodeling, texturing, lighting, animating, rendering, and post production.Interested students will perform preproduction story and concept designprior to beginning of course. Prerequisite: CSCI 1250. Enrollment limited to15. Instructor permission required.

CSCI 1950U. Topics in 3D Game Engine Development.Covers core techniques in 3D game development with an emphasis onengine architecture. Students independently develop their own enginesusing C++, OpenGL, and the Qt framework, then work in groups tocreate a polished game. Topics include: spatial subdivision, playerrepresentation, collision detection and response, game networking, GPUs,and OpenGL. Prerequisites: CSCI 1230 and one of CSCI 0320 or CSCI1950N. Enrollment limited to 25.Spr CSCI1950U S01 25250 Arranged (D. Ritchie)

CSCI 1950X. Software Foundations.Software Foundations will be a project-based course focusing on thechallenges and techniques involved in proving non-trivial propertiesabout real-world systems. We will base our exploration around formaldevelopment in a proof environment. Roughly half of the course will be aguided tutorial of proof techniques using one or more theorem provers; inthe remainder, students will apply this knowledge to existing systems. Noprior experience with theorem provers or proof assistants is necessary,but familiarity with and aptitude for functional programming will be a hugebonus. Prerequisite: CSCI 1730 or equivalent; mathematical maturity.

CSCI 1950Y. Logic for Systems.The course will focus on proving properties about systems and programs.We will study the distinction between programs and specifications, andcheck for whether the former obey the latter. We will work with tools thathave extensive automation such as model constructors, model checkers,and proof assistants. Problems and projects will apply to real-worldsystems. Prerequisite: CSCI 0160, CSCI 0180, or CSCI 0190. Preferredbut not required: CSCI 0220 and CSCI 0510, or instructor's permission.Spr CSCI1950Y S01 25199 MWF 10:00-10:50(03) (T. Nelson)

CSCI 1950Z. Computational Methods for Biology.This course will introduce algorithms from machine learning andcombinatorial optimization with a focus on their application to biologicaldata. Topics will include problems in phylogenetic inference, populationgenetics, and biological interaction networks.

CSCI 1951A. Data Science.Mastering big data requires skills spanning a variety of disciplines:distributed systems over statistics, machine learning, and a deepunderstanding of a complex ecosystem of tools and platforms. DataScience refers to the intersection of these skills and how to transformdata into actionable knowledge. This course provides an overview oftechniques and tools involved and how they work together: SQL andNoSQL solutions for massive data management, basic algorithms fordata mining and machine learning, information retrieval techniques, andvisualization methods.

Prerequisites: CSCI 0160, CSCI 0180, or CSCI 0190. One of CSCI 0330or CSCI 0320 strongly recommended.Spr CSCI1951A S01 25404 TTh 9:00-10:20(01) (E. Pavlick)

CSCI 1951B. Virtual Citizens or Subjects? The Global Battle OverGoverning Your Internet.The Internet began as a U.S. government research project, progressedto an open network run by free-spirited geeks, and transitioned in thelate 1990’s to a unique governance model in which nations, corporations,and civil society were supposed to all have a voice. Where are the realdecisions being made? Who is making them? How can you and citizensof other nations influence these decisions? The global battle to run theInternet, brewing for years, has broken wide open with revelations ofAmerican spying on a massive scale.

CSCI 1951C. Designing Humanity Centered Robots.Offered by Brown’s Computer Science department under the auspices ofthe Humanity Centered Robotics Initiative. It is focused on the iterativedesign process and how it can be used to develop robots for solvingtasks that help people. It will expose students to a suite of fabricationand prototyping technologies sufficient for creating a functioning roboticsystem.

https://www.youtube.com/watch?v=Dbvis_j_b78

The course has two tracks, one intended for CS concentrators, and oneintended for non-concentrators with previous design experience. The non-concentrator track cannot be used toward fulfilling a Computer Scienceconcentration requirement.Fall CSCI1951C S01 16595 MW 9:00-11:50 (I. Gonsher)

CSCI 1951G. Optimization Methods in Finance.Optimization plays an important role in financial decisions. Manycomputational finance problems ranging from asset allocation to riskmanagement, from option pricing to model calibration can be solvedefficiently using modern optimization techniques. This course discussesseveral classes of optimization problems (including linear, quadratic,integer, dynamic, stochastic, conic, and robust programming) encounteredin financial models. For each problem class, after introducing therelevant theory and efficient solution methods, we discuss problems ofmathematical finance that can be modeled within this problem class.Prerequisites: CSCI 1450 or APMA 1650, and CSCI 1570.

16 Computer Science

Computer Science 17

CSCI 1951I. CS for Social Change.Working in a studio environment to iteratively design, build, and testtechnical projects in partnership with different social change organizations,students will be placed in small teams to collaboratively work on projectsthat will range from developing a chatbot to aid community engagementto conducting geospatial data analytics. We will also reflect on ourpositionality and ethics in engaging in social impact work and what itpractically means to leverage technology to create social change on aneveryday basis. Enrollment limited to 12. Entry to this course is throughapplication only: https://docs.google.com/forms/d/1wmCbmB6dpOI0-FCjHE50IHgxAOO8gCE38m1dD71JtUw/editSpr CSCI1951I S01 25200 MW 3:00-4:20(10) (U. Cetintemel)

CSCI 1951J. Interdisciplinary Scientific Visualization.Students will learn about solving scientific problems using computergraphics and visualization. Projects will involve the solution of scientificproblems using computer graphics, modeling, and visualization. Workingin small groups, students will identify scientific problems, proposesolutions involving computational modeling and visualization, evaluatethe proposals, design and implement the solutions, apply them to theproblems, evaluate their success, and report on results. Example projectsmight include interactive software systems, immersive virtual reality caveapplications, quantitative analysis tools, or new applications of existingvisualizations methods. The focus will be on applications in the new virtualreality cave.

CSCI 1951K. Algorithmic Game Theory.This course examines topics in game theory from a computer scientist'sperspective. Through the lens of computation, this course will focus onthe design and analysis of systems involving self-interested agents,investigating how strategic behavior should influence algorithm design,which game-theoretic solution concepts are practical to implement, andthe ramifications of conflicts of interest between system designers andparticipating agents. Topics include: auctions and mechanism design,equilibria, and learning.

CSCI 1951N. VR+X, The Potential of Virtual Reality to TransformNearly Everything.This course introduces students to the history, present, and futurepossibilities of virtual reality (VR) with a focus on addressing the question:What is the transformative potential of virtual reality? We’ll criticallyevaluate a variety of applications in fields as varied as healthcare,architecture, education, and storytelling. Students will learn discovery anddesign thinking processes of a kind that can lead to the development ofVR solutions. Students will create a design concept for a VR use case in afield of their choosing.

CSCI 1951R. Introduction to Robotics.Each student will learn to program a small quad-rotor helicopter. We willprovide each student with their own robot for the duration of the course.The course will cover PID controllers for stable flight, localization with acamera, mapping, and autonomous planning. At the end of the course, theaim is for students to understand the basic concepts of a mobile robot andaerial vehicle. Enrollment by instructor permission.Fall CSCI1951R S01 16764 TTh 10:30-11:50(13) (S. Tellex)

CSCI 1951T. Surveying VR Data Visualization Software for Research.In a collaborative group effort, this course will search out, install, test,and critically evaluate VR software that supports data visualization forresearchers. We will target several specific types of data, includingvolumetric data, and remote sensing data. We will investigate thecapabilities of software for head-mounted displays (HMDs), big-metaldisplays like caves and the yurt, and, as a baseline, desktop displays.Software evaluation will include web research, hands-on case studies, andsurveying. Results will be documented in a courses wiki.Spr CSCI1951T S01 25202 TTh 10:30-11:50(09) (D. Laidlaw)

CSCI 1951U. Software Engineering of Large Systems.This course is teaches the software engineering techniques used to createmoderate to large sized programs. This includes design methodologiesthat scale and are geared toward larger, long-lifetime systems withmultiple designers. It includes tools and techniques that assist theprogrammer and help manage programmer teams.Fall CSCI1951U S01 16886 TTh 9:00-10:20(02) (S. Reiss)Fall CSCI1951U L01 16887 W 10:00-11:00 (S. Reiss)

CSCI 1951V. Hypertext: The Web Was Not the Beginning and the Webis Not the End.A “hypertext” system is for creating, linking, exploring, annotating, andsearching for information. Designed 30-years ago, the World Wide Webis a hypertext system gone global, but the Web represents only a smallpart of past visions. Students will explore hypertext’s history throughhands-on use of systems from the 1970s onward, identifying featuresstill not in common use. They will study the architecture, design, andfeatures of hypertext systems, examining topics such as permanence,collaboration, searching, content design patterns, and societal impact. Afinal implementation project will explore what hypertext systems might looklike in the 2020s. Prerequisites: an introductory CS sequence or equivalentexperienceFall CSCI1951V S01 16873 W 3:00-5:30(17) (A. van Dam)

CSCI 1970. Individual Independent Study.Independent study in various branches of Computer Science. Sectionnumbers vary by instructor. Please check Banner for the correct sectionnumber and CRN to use when registering for this course.

CSCI 1971. Independent Study in 2D Game Engines.2D Game Engines covers core techniques used in the development 2Dgame engines. Projects involve building different varieties of 2D gameengines as well as games that require use of the features implementedin the engines. Topics include high-level engine design, vector and rastergraphics, animation, collision detection, physics, content management,and game AI. Prerequisite: CSCI 0160, 0180, or 0190.

CSCI 1972. Topics in 3D Game Engine Development.Covers core techniques in 3D game development with an emphasis onengine architecture. Students independently develop their own enginesusing C++, OpenGL, and the Qt framework, then work in groups tocreate a polished game. Topics include: spatial subdivision, playerrepresentation, collision detection and response, game networking, GPUs,and OpenGL. Prerequisite: CSCI 1230 and one of the following CSCI0320, CSCI 0330, CSCI 1950N, OR CSCI 1971.

CSCI 1973. Independent Study.

CSCI 2240. Interactive Computer Graphics.Important current topics in computer graphics. Course includes readingand discussing current research papers, multiple assignments andpreliminary projects in which students implement recent papers, and ademanding final integrative project done in small groups. Prerequisite:Instructor's permission or CSCI 1230.Spr CSCI2240 S01 25204 MWF 11:00-11:50(04) (D. Ritchie)

CSCI 2270. Topics in Database Management.In-depth treatment of advanced issues in database management systems.Topics vary from year to year and may include distributed databases,mobile data management, data stream processing and web-based datamanagement. Prerequisite: CSCI 1270.Spr CSCI2270 S01 25379 M 3:00-5:30(13) (S. Zdonik)

CSCI 2300. Human-Computer Interaction Seminar.Covers methods for conducting research in human-computer interaction(HCI). Topics will be pursued through independent reading, assignments,and class discussion. Comprises four assignments that apply to HCIresearch methods and push the envelope, which are designed to bemeaningful and have the potential to be widely visible or to be published.Students will gain the background necessary to perform research inHCI and the skills to conduct human-centric research. There will be littlecontent about user interfaces, but students will find some topics in CSCI1300 relevant. Students should have taken CSCI 1300 or make a case fortheir interest.

Computer Science 17

18 Computer Science

CSCI 2310. Human Factors and User Interface Design.Covers current research issues involving the implementation, evaluationand design of user interfaces, while also providing a basic backgroundin the fundamentals of user interface evaluation, programming, tools,and techniques. A possible topic is programming and designing device-independent interfaces. Previous topics have included the developmentof pervasive internet-based interfaces and software visualization.Prerequisite: Consent of instructor.

CSCI 2330. Programming Environments.Programming tools; control and data integration; software understandingand debugging; environments for parallel and distributed programming;reverse engineering; configuration management and version control anddebugging. Emphasis on current research areas. Prerequisite: consent ofinstructor.

CSCI 2340. Software Engineering.Topics in the design, specification, construction and validation ofprograms. Focus will be on tools to support each of these stages. Coursewill pay special attention to the concerns raised by the properties ofmodern software systems including distribution, security, component-based decomposition and implicit control. Prerequisite: CSCI 0320 orCSCI 0330

CSCI 2370. Interdisciplinary Scientific Visualization.How to do research on using computer graphics, visualization, andinteraction applied to scientific problems. Working in small multidisciplinarygroups, students identify scientific problems, propose solutions involvingcomputational modeling and visualization, design and implement thesolutions, apply them to the problems, and evaluate their success.Immersive CAVE applications will be a focus, but other interaction orvisualization projects are possibles. Prerequisites: all: programmingexperience; CS students: graphics experience; others: problem ideas.Instructor permission required.Fall CSCI2370 S01 16596 TTh 10:30-11:50(13) (D. Laidlaw)

CSCI 2410. Statistical Models in Natural-Language Understanding.Various topics in computer understanding of natural language, primarilyfrom a statistical point of view. Topics include: hidden Markov models,word-tagging models, probabilistic context-free grammars, syntacticdisambiguation, semantic word clustering, word-sense disambiguation,machine translation and lexical semantics. Prerequisite: CSCI 1410.

CSCI 2420. Probabilistic Graphical Models.Probabilistic graphical models provide a flexible framework for modelinglarge, complex, heterogeneous collections of random variables. Aftera brief introduction to their representational power, we provide acomprehensive survey of state-of-the-art methods for statistical learningand inference in graphical models. We discuss a range of efficientalgorithms for approximate inference, including optimization-basedvariational methods, and simulation-based Monte Carlo methods. Severalapproaches to learning from data are explored, including conditionalmodels for discriminative learning, and Bayesian methods for controllingmodel complexity. Programming experience required for homeworksand projects, which integrate mathematical derivations with algorithmimplementations. PREREQUISITES: CSCI1420 or APMA1690.

CSCI 2430. Topics in Machine Learning.Machine learning from the artificial intelligence perspective, with emphasison empirical validation of learning algorithms. Different learning problemsare considered, including concept learning, clustering, speed-up learning,and behavior learning. For each problem a variety of solutions areinvestigated, including those from symbolic AI, neural and geneticalgorithms, and standard statistical methods. Prerequisite: CSCI 1410 orfamiliarity with basic logic and probability theory.

CSCI 2440. Computation in Economics and Games.This course examines topics in game theory and mechanism design froma computer scientist’s perspective. Through the lens of computation, thefocus is the design and analysis of systems utilized by self-interestedagents. Students will investigate how the potential for strategic agentbehavior can/should influence system design, and the ramifications ofconflicts of interest between system designers and participating agents.Emphasis on computational tractability is paramount, so that simpledesigns are often preferred to optimal. Students will learn to analyzecompeting designs using the tools of theoretical computer science, andempirical tools, such as empirical game-theoretic analysis. Applicationareas include computational advertising, wireless spectrum, and predictionmarkets.Spr CSCI2440 S01 25155 W 3:00-5:30(10) (A. Greenwald)

CSCI 2450. Exchange Scholar Program.Fall CSCI2450 S01 15464 Arranged ’To Be Arranged'

CSCI 2470. Deep Learning.Deep learning is the name for a particular version of neural networks--a version that emphasizes multiple layers of networks. Deep leaning,plus the specialized techniques that it has inspired (e.g. convolutionalfeatures and word embeddings) have lead to rapid improvements in manyapplications such as computer vision, machine translation, and computerGo. This course intends to give students a practical understanding ofdeep learning as applied in these and other areas. It also teaches theTensorflow programming language for the expression of deep leaningalgorithms. A final project will implement an advanced piece of work in oneof these areas. Pre Requisites: A basic programming course: (CSCI 0150,0170 or 0190) A linear algebra course: (CSCI 0530, MATH 0520 or 0540)A stats / probability course: (CSCI 0220, 1450, 0450, MATH 1610, APMA1650 or 1655)Fall CSCI2470 S01 16598 MWF 12:00-12:50(15) (D. Ritchie)

CSCI 2500A. Advanced Algorithms.Typically, an algorithm solves one problem, whereas a well-designed datastructure can help implement algorithms for a wide variety of problems.We will study the design, analysis and implementation of advanced datastructures. Focus is on data structures that are fast, both theoretically andempirically. Prerequisite: CSCI 1570 or the equivalent.

CSCI 2500B. Optimization Algorithms for Planar Graphs.Planar graphs arise in applications such as road map navigation andlogistics, graph drawing and image processing. We will study graphalgorithms and data structures that exploit planarity. Our focus will be onrecent research results in optimization. Prerequisite: CSCI 1570 or theequivalent.

CSCI 2510. Approximation Algorithms.Approximation Algorithms deal with NP-hard combinatorial optimizationproblems by efficiently constructing a suboptimal solution with somespecified quality guarantees. We study techniques such as linearprogramming and semidefinite programming relaxations, and apply themto problems such as facility location, scheduling, bin packing, maximumsatifiability or vertex cover. Prerequisite - one of the following: CSCI 1510,1550, 1810, 1950J, 1950L, any graduate-level course on algorithms(including 2500A, 2500B, 2580).

CSCI 2520. Computational Geometry.Algorithms and data structures for fundamental geometric problemsin two and three dimensions. Topics include point location, rangesearching, convex hull, intersection, Voronoi diagrams, and graph drawing.Applications to computer graphics, circuit layout, information visualization,and computer-aided design are also discussed. Prerequisite: CSCI 1570or instructor permission.

CSCI 2530. Design and Analysis of Communication Networks.A theory seminar focusing on algorithmic and combinatorial issues relatedto the design and analysis of communication networks for parallel anddistributed systems. Topics include packet routing, circuit switching,distributed shared memory, fault tolerance, and more. Prerequisites: CSCI1550, 1570, or equivalent.

18 Computer Science

Computer Science 19

CSCI 2531. Internet and Web Algorithms.This advanced graduate course/seminar focuses on the mathematicalfoundations of algorithms for handling large amounts of data overnetworks. We'll read and discuss recent papers in information retrieval,search engines, link analysis, probabilistic modeling of the web and socialnetworks, and more. Recommended: CSCI 1550 and CSCI 1570, orequivalent courses.

CSCI 2540. Advanced Probabilistic Methods in Computer Science.Advanced topics in applications of probabilistic methods in designand analysis of algorithms, in particular to randomized algorithms andprobabilistic analysis of algorithms. Topics include the Markov chainsMonte Carlo method, martingales, entropy as a measure for informationand randomness, and more. Prerequisite: CSCI 1450. Recommended butnot required: CSCI 1570.Spr CSCI2540 S01 25205 TTh 2:30-3:50(11) (E. Upfal)

CSCI 2550. Parallel Computation: Models, Algorithms, Limits.The theoretical foundations of parallel algorithmics. Analysis of themost important models of parallel computation, such as directed-acycliccomputation graphs, shared memory and networks, and standard data-exchange schemes (common address space and message-passing).Algorithmic techniques with numerous examples are cast mostly inthe data-parallel framework. Finally, limitations to parallelizability (P-completeness) are analyzed. The content of the course is likely to changeas technology evolves.

CSCI 2560. Advanced Complexity.Advanced topics in computational complexity, such as: the polynomialhierarchy, interactive proofs, pseudorandomness, derandomization,probabilistically checkable proofs.

CSCI 2570. Introduction to Nanocomputing.Nanoscale technologies employing materials whose smallest dimensionis on the order of a few nanometers are expected to replace lithographyin the design of chips. We give an introduction to computationalnanotechnologies and explore problems presented by their stochasticnature. Nanotechnologies based on the use of DNA and semiconductingmaterials will be explored. Prerequisite: CSCI 0510.

CSCI 2580. Solving Hard Problems in Combinatorial Optimization:Theory and Systems.The theory of combinatorial optimization and how it is embodied inpractical systems. Explores issues encountered in implementing suchsystems. Emphasizes the wide variety of techniques and methodologiesavailable, including integer programming, local search, constraintprogramming, and approximation algorithms. Problems addressed mayinclude: scheduling, coloring, traveling salesman tours, and resourceallocation. Prerequisites: CSCI 0320 and basic knowledge of linearalgebra.

CSCI 2590. Advanced Topics in Cryptography.Seminar-style course on advanced topics in cryptography. Exampletopics are zero-knowledge proofs, multi-party computation, extractors incryptography, universal composability, anonymous credentials and ecash,interplay of cryptography and game theory. May be repeated for credit.Prerequisite: CSCI 1510 or permission of the instructor.

CSCI 2730. Programming Language Theory.Theoretical models for the semantics of programming languages and theverification of programs. Topics will be drawn from operational semantics,denotational semantics, type theory and static analyses. Recommendedprerequisite: CSCI 1730, CSCI 1950Y or instructor permission.

CSCI 2750. Topics in Parallel and Distributed Computing.CSCI 2750 is a graduate seminar that will consider an advanced topic (tobe determined) in distributed computing. May be repeated for credit.

CSCI 2820. Advanced Algorithms in Computational Biology andMedical Bioinformatics.Devoted to computational problems and methods in the emerging fieldof Medical Bioinformatics where genomics, computational biology andbioinformatics impact medical research. We will present challengingproblems and solutions in three areas: Disease Associations, ProteinFolding and Immunogenomics. This course is open to graduate studentsand advanced undergraduates with Computational or Life Sciencebackgrounds. Prior background in Biology is not required.Spr CSCI2820 S01 25206 TTh 2:30-3:50(11) (S. Istrail)

CSCI 2890. Comprehensive Examination Preparation.For graduate students who have met the tuition requirement and arepaying the registration fee to continue active enrollment while preparing fora preliminary examination.Fall CSCI2890 S01 15465 Arranged ’To Be Arranged'Spr CSCI2890 S01 24269 Arranged ’To Be Arranged'

CSCI 2950C. Topics in Computational Biology.This course will investigate active and emerging research areas incomputational biology. Topics include cancer genomics; genomerearrangements and assembly; and protein and regulatory interactionnetworks. The course will be a mixture of lectures and studentpresentations of recent conference and journal papers.

CSCI 2950D. Sensor Data Management.Sensor networks combine sensing, computing, actuation, andcommunication in a single infrastructure that allows us to observe andrespond to phenomena in the physical and cyber world. The sensorsrange from tiny "smart dusts" to dime-sized RFID tags and large-scaleweather sensors. This course will cover the state-of-the art in designingand building sensor networks, focusing on issues that revolve around dataand resource management. No prerequisites.

CSCI 2950E. Stochastic Optimization.This advanced graduate course/seminar will focus on optimization underuncertainty, or optimization problems where some of the constrainsinclude random (stochastic) components. Most practical optimizationproblems are stochastic (subject to future market conditions, weather,faults, etc.), and there has been substantial research (both theoreticaland experimental) in efficient solution for such problems. We'll read anddiscuss some of the recent works in this area.

CSCI 2950F. Implementing Web-Based Software Systems.

CSCI 2950G. Large-Scale Networked Systems.Explores widely-distributed systems that take advantage of resourcesthroughtout the Internet. The systems leverage their large size andgeographic diversity to provide bandwidth scalability, rapid responses,fault-tolerance, high-availability and diverse data collection. Topics includeoverlay networks, peer-to-peer systems, content distribution networks,distributed file systems and wide-scale measurement systems.

CSCI 2950H. Advanced Cryptography.

CSCI 2950I. Computational Models of the Neocortex.This course addresses the problem of modeling the perceptual neocortexusing probabilistic graphical models, including Bayesian and Markovnetworks, and extensions to model time and change such as hiddenMarkov models and dynamic Bayesian networks. The emphasis is onproblems of learning, inference, and attention. Sources include theliterature in computational and cognitive neuroscience, machine learning,and other fields that bear on how biological and engineered systems makesense of the world. Prerequisites: basic probability theory, algorithms andstatistics.

CSCI 2950J. Cognition, Human-Computer Interaction and VisualAnalysis.In this graduate seminar we will learn about models of human cognitionand perception, and explore potential implications of the models on howcomputers and humans can interact effectively when performing scientificanalyses. Participants will be responsible for reading assigned materials,taking turns guiding discussions of the readings, and preparing a finalpaper and presentation. It is recommended that participants have somebackground in at least one of the areas of study.

Computer Science 19

20 Computer Science

CSCI 2950K. Special Topics in Computational Linguistics.Every year will cover a different topic in computational linguistics, from astatistical point of view, including parsing, machine translation, conference,summarization, etc. Prerequisites: CSCI 1460 or permission of theinstructor.Fall CSCI2950K S01 16888 MWF 2:00-2:50(07) (E. Charniak)

CSCI 2950M. Computer Science, Algorithms and Economics.Course investigates the interplay of economic theory and computerscience. It is suitable for advanced senior undergraduates and forgraduate students. We will study topics such as: algorithms for selfishrouting; competitive combinatorial auctions; Multicast cost sharing andcooperative games; graphical models for games; and related topics.This course will be organized around the presentation of recent researchpapers. Prerequisite: CSCI 1570 or equivalent.

CSCI 2950N. Special Topics in Autonomous Robotics.No description available.

CSCI 2950O. Topics in Brain-Computer Interfaces.Introduces the mathematical and computational foundations ofbrain-computer interfaces. Statistical learning, Bayesian inference,dimensionality reduction, information theory, and other topics arepresented in the context of brain interfaces based on neural implants andEEG recordings. Prerequisites: Basic knowledge of probability, statisticsand linear algebra (e.g., CSCI 1550, APMA 1650, APMA 1690, or APMA2640). Enrollment limited to 20 students.

CSCI 2950P. Special Topics in Machine Learning.This seminar course explores current research topics in statistical machinelearning. Focus varies by year, and may include Bayesian nonparametrics;models for spatial, temporal, or structured data; and variational orMonte Carlo approximations. Course meetings combine lectures withpresentation and discussion of classical and contemporary researchpapers. Students will apply some this material to a project, ideally drawnfrom their own research interests.

CSCI 2950Q. Topics in Computer Vision.This course will cover current topics in computer vision by focusing ona single real problem in computer vision. Recent courses have focusedon forensic video analysis of an unsolved murder and three-dimensionalobject recognition for a mobile robot. Readings from the literature areintegrated with group projects to solve problems beyond the state of theart. Strong mathematical skills (probability, linear algebra, calculus) andprevious exposure to computer vision (e.g. CSCI 1430) are essential.

CSCI 2950R. Special Topics in Advanced Algorithms.We will study an advanced topic in the design and analysis of algorithms.Prerequisite: CSCI 1570 or the equivalent.

CSCI 2950S. Advanced Practical Combinatorial Algorithms.We review recent as well as well-established advanced techniques incombinatorial optimization and constraint satisfaction. Students will studyand individually present research papers and work on challenging softwareprojects in small teams. Prerequisites: CSCI 0160, 0180, or 0190; andCSCI 0510; and CSCI 1490 or 2580, or instructor permission.

CSCI 2950T. Topics in Distributed Databases and Systems.This course explores data and resource management issues that arisein the design, implementation, and deployment of distributed computingsystems by covering the state of the art in research and industry.Typical topics include cloud computing and sensor networks. Stronglyrecommended: CSCI 0320, CSCI 1270, or CSCI 1951A.

CSCI 2950U. Special Topics on Networking and Distributed Systems.Explores current research topics in networking, distributed and operatingsystems. Specific topics may include wireless and sensor networking,Internet-scale distributed systems, cloud computing, as well as the coreproblems, concepts, and techniques underlying these systems. Thecourse has two components: reading and discussion of current andclassical research papers, and a research project related to the topic butideally drawn from students' own research interests. This is a graduate-level course, undergrads can join with the consent of the instructor.

CSCI 2950V. Topics in Applied Cryptography.This course surveys recent developments in applied cryptography.Research in this field is motivated by privacy and security issues thatarise in practice from areas like cloud computing, databases, surveillanceand finance. Topics will vary each year. Pre Requisites: CSCI 1660 andCSCI 1510 recommended or instructor permission. This year's theme iscryptography for social good.Fall CSCI2950V S01 16599 TTh 10:30-11:50(13) (S. Kamara)

CSCI 2950W. Online Algorithms.Decisions must often be made before the entire data is available. Onlinealgorithms solve problems in which commitments must be made asthe data is arriving. Choosing which items to evict from a cache beforeknowing future requests, which advertisers to consider for displaying adsalongside the result of a search, or which most representative data to storewhen computing statistics about a huge stream of information. We willdiscuss the worst-case model, which hinges against the worst possiblefuture data, and some stochastic and game-theoretic models.

CSCI 2950X. Topics in Programming Languages and Systems.Examines contemporary research topics in software construction fromthe perspectives of programming languages, software engineering andcomputer-aided verification. The primary goals are to understand whichtheory applies to which problems and to convert that theory into tools.Topics include security, modularity, and new paradigms in softwarecomposition. Prerequisite: CSCI 1730 or written permission of theinstructor.

CSCI 2950Y. Theorem Proving.This course explores computer-assisted theorem proving with the CoqProof Assistant. The course will teach students to formally specify softwareand model mathematical theories. We will then study techniques formechanically proving theorems about these Coq. Prerequisites: CSCI1730 or CSCI 0170 and permission of the instructor.

CSCI 2950Z. Robot Learning and Autonomy.This seminar course will cover current research topics relatedto perceiving and acting in the real world. These topics will bepursued through independent reading, class discussion, and projectimplementations. Papers covered will be drawn from robotics, computervision, animation, machine learning, and neuroscience. Special emphasiswill be given to developing autonomous control from human performance.No prerequisites.

CSCI 2951A. Robots for Education.This seminar will explore the potential for robotics to engage futuregenerations of scientists and engineers, with a particular focus onbroadening participation in computing across society. Academic papersdescribing existing models, systems, courses, and evaluation for teachingrobotics at undergraduate and secondary levels will be covered throughstudents presentations. A group project will be conducted to find viableand accessible "off-the-shelf" technology solutions suited to teachingrobotics without requiring a technical background. Instructor permissionrequired.

CSCI 2951B. Data-Driven Vision and Graphics.Investigates current research topics in image-based graphics and vision.We will examine data sources, features, and algorithms for understandingand manipulating visual data. We will pay special attention to methods thatuse crowd-sourcing or Internet-derived data. Vision topics such as sceneunderstanding and object detection will be linked to graphics applicationssuch as photo editing and image-based rendering. These topics will bepursued through independent reading, class discussion and presentations,and a semester long research project. Strong mathematical skills andprevious imaging (vision or computational photography) courses areessential.

20 Computer Science

Computer Science 21

CSCI 2951C. Autonomous Agents and Computational Market Design.An important area of research in artificial intelligence is how to effectivelyautomate decision making in time-critical, information-rich environments.Electronic markets are a prime example of such environments. In thiscourse students will create their own simulated electronic market as wellas autonomous agents that trade in their market simulation. Applicationdomains will include supply chain management, the Dutch flower auctions,and ad auctions, such as those run by Google and Facebook. Enrollmentlimited to 40 graduate students.

CSCI 2951E. Topics in Computer Systems Security.This course explores advanced topics and highlights current researchin computer security from a systems perspective. Topics includevulnerabilities and defenses for automotive, computing, medical, andindustrial control devices, intrusion detection, botnets, secure networkprotocols, web spam, tracking of web users, JavaScript sandboxing,attacks and defenses for web applications, and security and privacyissues in cloud computing. Research papers and industry reports willbe presented and discussed. Also, hands-on experiments and systemdemonstrations will be performed. CSCI 1660 or equivalent background isessential. Enrollment limited to 12. Instructor permission required.Fall CSCI2951E S01 16600 T 2:30-5:00 (R. Tamassia)

CSCI 2951F. Learning and Sequential Decision Making.The course explores automated decision making from a computer-scienceperspective. It examines efficient algorithms, where they exist, for singleagent and multiagent planning as well as approaches to learning near-optimal decisions from experience. Topics will include Markov decisionprocesses, stochastic and repeated games, partially observable Markovdecision processes, and reinforcement learning. Of particular interestwill be issues of generalization, exploration, and representation. Eachstudent will be expected to present a published research paper and willparticipate in a group programming project. Prerequisite: a graduate-levelcomputer science course and some exposure to reinforcement learningfrom a previous computer-science class or seminar.

CSCI 2951I. Computer Vision for Graphics and Interaction.Computer vision reconstructs real world information from image andvideo data; computer graphics synthesizes dynamic virtual worlds;interaction lets us explore these worlds; and machine learning allowsus to map between domains across vision, graphics, and interaction.In visual computing, these fields converge to exploit both models ofvisual appearance and databases of examples to generate and interactwith new images. This enables applications from the seemingly simple,like semantic photo editing, to the seemingly science fiction, like mixedreality. In this seminar, we will discover the state-of-the-art algorithmiccontributions in computer vision which make this possible. Please join us!

CSCI 2951K. Topics in Collaborative Robotics.Practical approaches to designing intelligent systems. Topics includesearch and optimization, uncertainty, learning, and decision making.Application areas include natural language processing, machine vision,machine learning, and robotics. Prerequisite: CSCI 1410, 1420, 1460,1480, or 1950F; or instructor permission.Spr CSCI2951K S01 25251 TTh 10:30-11:50(09) (S. Tellex)

CSCI 2951M. Advanced Algorithms Seminar.Students in this course will read, present, and discuss recent breakthroughpapers on the topic of algorithms, and the related areas needed toanalyze algorithms. This course is aimed at current and potential futuregraduate students who want to gain technical depth and perspective onthe field of algorithms. Topics will roughly alternate by year, with evenyears emphasizing fundamental techniques, and odd years emphasizingapplications such as machine learning. Suggested prerequisites:CSCI 1570 and mathematical maturity. Instructor permission required.Enrollment will be limited to 24 students, based on an application that willbe described on the first day of class. Ideal students will have a mix of thefollowing: 1) motivation to learn how to read papers, 2) technical skills andbackground, 3) willingness to participate and contribute to discussions.

CSCI 2951N. Advanced Algorithms in Computational Biology.This is a full-lecture, graduate course on algorithms and biomedicalapplications. The Foundations lectures are an introduction to thebiological and medical genomics application areas. Each Algorithmsection is devoted to an algorithmic method presented in rigorous depth,followed by an important open problem in the application area, togetherwith the current most effective algorithmic solutions to the problem.Graduate students and advanced undergraduates in computational andmathematical sciences and engineering are welcome. Biological, lifesciences and medical students and faculty are welcome as well and will beable to participate more in the applications areas.

CSCI 2951O. Foundations of Prescriptive Analytics.We are undoubtedly in the middle of an Analytics Revolution that enabledturning huge amounts data into insights, and insights into predictionsabout the future. At its final frontiers, Prescriptive Analytics is aimed atidentifying the best possible action to take given the constraints and theobjective. To that end, this course provides students with a comprehensiveoverview of the theory and practice of how to apply Prescriptive Analyticsthrough optimization technology. A wide variety of state-of-the-arttechniques are studied including: Boolean Satisfiability, ConstraintProgramming, Linear Programming, Integer Programming, Local SearchMeta-Heuristics, and Large-Scale Optimization. Pre Requisites: One ofCSCI 0320 or CSCI 0330 and recommended: one of CSCI 0530, CSCI1570, MATH 0520 or MATH 0540.Spr CSCI2951O S01 25381 F 3:00-5:30(15) (S. Kadioglu)

CSCI 2951S. Distributed Computing through Combinatorial Topology.Although computer science itself is based on discrete mathematics,combinatorial topology and its applications may still be unfamiliar to manycomputer scientists. For this reason, this course provides a self-contained,elementary introduction to the concepts from combinatorial topologyneeded to analyze distributed computing. Conversely, while the systemsand models used here are standard in computer science, they may beunfamiliar to students with a background in pure or applied mathematics.For this reason, this course also provides a self-contained, elementarydescription of standard notions of distributed computing. CSCI 0220required, CSCI 1760 recommended

CSCI 2951T. Data-Driven Computer Vision.Investigates current research topics in data-driven object detection, scenerecognition, and image-based graphics. We will examine data sources,features, and algorithms useful for understanding and manipulatingvisual data. We will pay special attention to methods that harness large-scale or Internet-derived data. There will be an overview of the currentcrowdsourcing techniques used to acquire massive image datasets. Visiontopics such as scene understanding and object detection will be linked tographics applications such as photo editing. These topics will be pursuedthrough independent reading, class discussion and presentations, andprojects involving current research problems in Computer Vision.

CSCI 2951U. Topics in Software Security.This course investigates the state-of-the-art in software exploitationand defense. Specifically, the course is structured as a seminar wherestudents present research papers to their peers. We will begin with asummary of prevalent software defects, typically found in applicationswritten in memory unsafe languages, and proceed to surveying what weare up against: traditional and modern exploitation techniques, rangingfrom classical code injection and code reuse up to the newest goodies(JIT-ROP, Blind ROP). For the bulk part, we will focus on the latestadvances in protection mechanisms, mitigation techniques, and toolsagainst modern vulnerability classes and exploitation methods.Spr CSCI2951U S01 25380 M 3:00-5:30(13) (V. Kemerlis)

Computer Science 21

22 Computer Science

CSCI 2951X. Reintegrating AI.The goal of AI has been to build complete intelligent agents, yet the fieldhas been fragmented into a collection of problem-specific areas of study.We will first spend a few weeks in lecture covering a new approach tointegrating existing AI subfields into a single agent architecture, andremainder of the semester on self-directed, semester-long researchprojects.Grading based on a mid-semester project proposal, and a substantialopen-ended final project. The projects will be multi-disciplinary in naturebut students will have the opportunity to work in small groups, so theyneed not necessarily have expertise in the relevant areas. Graduatestudents welcome; undergraduates need instructor permission to enroll.

CSCI 2951Z. Advanced Algorithmic Game Theory.This course examines topics in game theory from a computer scientist'sperspective. Through the lens of computation, it will focus on the designand analysis of systems involving self-interested agents, investigating howstrategic behavior should influence algorithm design, which game-theoreticsolution concepts are practical to implement, and the ramifications ofconflicts of interest between system designers and participating agents.Students will create their own automated trading agents for varioussimulated market games. Topics include: auctions and mechanismdesign, equilibria, and learning. For graduate credit, students will completeadditional homework exercises, and a significant programming project.

CSCI 2952C. Learning with Limited Labeled Data.As machine learning is deployed more widely, researchers andpractitioners keep running into a fundamental problem: how do we getenough labeled data? This seminar course will survey research onlearning when only limited labeled data is available. Topics coveredinclude weak supervision, semi-supervised learning, active learning,transfer learning, and few-shot learning. Students will lead discussions onclassic and recent research papers, and work in teams on final researchprojects.Previous experience in machine learning is required through CSCI 1420 orequivalent research experience.Fall CSCI2952C S01 16920 TTh 1:00-2:20(08) (S. Bach)

CSCI 2952G. Deep Learning in Genomics.Deep learning models have achieved impressive performance infields like computer vision and NLP. Given an adequate amount ofdata, these models can extract meaningful representations to performaccurate predictions. The collection of vast quantities of biological datanaturally leads to the question -- can deep learning help us understandgenomics? In this seminar-style class, we will cover the recent researchliterature trying to answer this question. We will learn how state-of-the-art models like CNNs, RNNs, GCNs, GANs, etc. have been applied tosolve significant problems in genomics and what unique challenges arepresented by the data in this field.Fall CSCI2952G S01 16919 TTh 1:00-2:20(08) (R. Singh)

CSCI 2952H. Recent Progress in Reinforcement Learning.Reinforcement learning is a framework for studying machines that interactwith a sequential environment to achieve a goal. In the past decade, theRL framework has gained a lot of attention owing to its intriguing successin solving problems in complicated domains such as games, robotics, anddialog systems. We observe continual growth in the number of RL paperspublished in major machine-learning conferences. This growth calls fora careful investigation of the recent progress in the field. By readingselections of the current RL literature, this graduate-level course examinessome of the latest theoretical and empirical progress in the field.

CSCI 2955. The Design and Analysis of Trading Agents.The Dutch Flower Auctions (DFA) clear over 100,000 auctions per day,each lasting on average between 3 and 5 seconds! This semester,we'll study the mechanism through which the DFA distribute 2/3 of theworld's flowers, focusing on both the sellers' and buyers' decision-makingprocesses. More generally, we'll research ways to automate and optimizedecision-making in time-critical, information-rich environments, like theDFA. Undergraduate students require instructor permission, and shouldhave already completed CSCI 0190, or CSCI 0150 and CSCI 0160, orCSCI 0170 and CSCI 0180.

CSCI 2956A. Design of Agents for Bidding in Sponsored SearchAutions.This course investigates the new field of sponsored search auctions.Although students will be exposed to the field from the point of viewof both the search engine and the advertiser, the course's focus is onadvertiser's bidding algorithms. The students will implement novel biddingagents, and the course will culminate in a competition among the students'agents. Undergraduate students who obtained permission from theinstructor or completed CSCI 0910, or CSCI 0150 and CSCI 0160, orCSCI 0170 and CSCI 0180 can register for the course. CSCI 1410 is a co-requisite.

CSCI 2956R. Multiplicative-Weights/Packing-Covering Method forApproximating Linear and Semidefinite Programs.We will study the method called, variously, multiplicative weightsand packing-covering. We will in particular investigate the use of thismethod for finding approximately optimal solutions to linear programsand semidefinite programs. Prerequisite: A graduate-level course onalgorithms. Enrollment limited to 10. Instructor permission required.

CSCI 2980. Reading and Research.Section numbers vary by instructor. Please check Banner for the correctsection number and CRN to use when registering for this course.

CSCI 2990. Thesis Preparation.For graduate students who have met the residency requirement and arecontinuing research on a full time basis.Fall CSCI2990 S01 15466 Arranged ’To Be Arranged'Spr CSCI2990 S01 24270 Arranged ’To Be Arranged'

CSCI XLIST. Courses of Interest to Concentrators in ComputerScience.

22 Computer Science

Computer Science 23

Font NoticeThis document should contain certain fonts with restrictive licenses. For this draft, substitutions were made using less legally restrictive fonts.Specifically:

Helvetica was used instead of Arial.

The editor may contact Leepfrog for a draft with the correct fonts in place.

Computer Science 23

computer science - 2020-21 bulletin · or csci 0530 coding the matrix: an introduction to linear...

Documents