Since our inception in 1979, the Computer Science Department at Brown has forged a path of innovative information technology research and teaching at both the undergraduate and graduate levels. From our modest beginnings as an interest group within the Divisions of Applied Mathematics and Engineering in the 1960s to its current stature as one of the nation's leading computer science programs, the Computer Science Department has continuously produced prominent contributors in the field. Computer Science combines the intellectual challenge of a new discipline with the excitement of an innovative and rapidly expanding technology. The department resides in Brown’s Center for Information Technology; this striking building houses many of the university’s computing activities, as well as the department’s instructional computing facilities and research labs. Faculty, staff and students are provided stateoftheart computing facilities.
We are a diverse community of scholars engaged in all aspects of research, teaching and mentoring in computer science and its related interdisciplinary disciplines. Realizing the importance of computing and algorithmic thinking in so many scientific, social and technological endeavors, we collaborate extensively with colleagues in archaeology, applied mathematics, biology, cognitive and linguistic sciences, economics, engineering, mathematics, medicine, physics and neuroscience.
Our undergraduate offerings reflect the department's multidisciplinary orientations, with joint concentrations in mathematics, applied mathematics, computational biology and economics. We have strong undergraduate research groups and a long history of involving undergraduates in projects that span disciplinary boundaries.
For additional information, please visit the department's website: http://www.cs.brown.edu/
CSCI 0020. The Digital World.
Removes the mystery surrounding computers and the evergrowing digital world. Introduces a range of topics and many aspects of multimedia, along with explanations of the underlying digital technology and its relevance to our society. Other topics include artificial intelligence, IT security, ethics and the economics of computing as well as the effects of its pervasiveness in today's world. Introductory programming and analytic skills are developed through Excel, HTML, CSS, Javascript, and Python assignments. CSCI0020 is a good introduction to a wide range of CS topics that have broad relevance in our society. No prerequisites. Cannot be taken to fulfill CS Concentration.
Fall  CSCI0020  S01  17412  TTh  9:0010:20(05)  (D. Stanford) 
CSCI 0030. Introduction to Computation for the Humanities and Social Sciences.
Introduces students to the use of computation for solving problems in the social sciences and the humanities. We will investigate a series of realworld problems taken from the news, from books such as Freakonomics, and from current research. Topics covered include data gathering, analysis, and visualization; webbased interfaces; algorithms; and scripting. Enrollment limited to 20. Instructor permission required.
CSCI 0040. Introduction to Scientific Computing and Problem Solving.
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 while becoming fluent MATLAB programmers. Other tools utilized may include Excel, Wolframalpha and Python.
By course end, students should be able to use MATLAB to solve a large variety of scientific data analysis, visualization and simulation problems.
No prior programming experience is required (MATLAB is easy and fun to use).
CSCI 0050. A DataCentric Introduction to Programming.
An introduction to computer programming with a focus on skills needed for dataintensive applications. Topics include core constructs for processing both tabular and structured data; decomposing problems into programming tasks; data structures; algorithms; and testing programs for correct behavior.
CSCI 0060. Practical System Skills.
An introduction to develop handsoncomputing skills necessary to comfortably work within a UNIXlike operating system. Topics include the shell, its filesystem, bash scripting, SSH, version control, as well as how to locally develop, deploy and publish a website. https://cs.brown.edu/courses/csci0060/
CSCI 0080. A First Byte of Computer Science.
Introduces nonCS concentrators to the academic discipline of computer science, its thought processes, and its relevance to other fields and modern life more generally. The target audience is students who are interested in learning more about what computer science is about and the ideas it has to offer tomorrow's citizens and scholars. Topics include the basics of computation and programming, a taste of theoretical computer science and algorithms, and an introduction to codes and artificial intelligence. Although students will learn to read and understand short programs, the course will not teach or require advanced programming skills.
CSCI 0081. TA Apprenticeship: Full Credit.
Being an undergraduate TA is a learning experience: one not only gets a deeper understanding of the course material, but gains management and social skills that are invaluable for one's future. Students taking this course must first be selected as an undergraduate TA for a Computer Science course, a course the student has taken and done well in. Students will work with the course's instructor on a variety of courserelated topics, including preparation of material and development of assignments. Whether CSCI 0081 or its halfcredit version (CSCI 0082) is taken is up to the professor of the course being TA'd. Instructor permission required.
Fall  CSCI0081  S01  17414  Arranged  (T. Doeppner)  
Spr  CSCI0081  S01  25973  Arranged  (T. Doeppner) 
CSCI 0082. TA Apprenticeship: Half Credit.
Being an undergraduate TA is a learning experience: one not only gets a deeper understanding of the course material, but gains management and social skills that are invaluable for one's future. Students taking this course must first be selected as an undergraduate TA for a Computer Science course, a course the student has taken and done well in. Students will work with the course's instructor on a variety of courserelated topics, including preparation of material and development of assignments. Whether CSCI 0082 or its fullcredit version (CSCI 0081) is taken is up to the professor of the course being TA'd. Instructor permission required.
Fall  CSCI0082  S01  17415  Arranged  (T. Doeppner)  
Spr  CSCI0082  S01  25974  Arranged  (T. Doeppner) 
CSCI 0100. Data Fluency for All.
This course is intended to introduce Brown students to computational techniques that data scientists use to tell stories. Data fluency encompasses both data literacy, the basics of statistics and machine learning, and data communication, which relies heavily on principles of design. Students will gain hands on experience using statistical tools such as 'R' to analyze real world data sets, and 'ggplot' to visualize them. Sample application domains include just about every field, since the only requirement is data, which there almost always are (e.g., the complete works of Shakespeare is a sample data set).
CSCI 0111. Computing Foundations: Data.
An introduction to computing and programming that focuses on understanding and manipulating data. Students will learn to write programs to process both tabular and structured data, to assess programs both experimentally and theoretically, to apply basic data science concepts, and to discuss big ideas around the communication, use, and social impacts of digital information. Designed for both concentrators and nonconcentrators, this is the first course in either a two or threecourse introductory sequence leading into advanced CS courses. Programming assignments will be smaller scale than in CSCI 0150/0170, thus allowing students time to practice programming and discuss computational ideas in a broader context.
Fall  CSCI0111  S01  17625  MWF  10:0010:50(14)  (M. Zizyte) 
Fall  CSCI0111  S02  17626  Arranged  (M. Zizyte)  
Spr  CSCI0111  S01  25975  MWF  2:002:50(07)  (M. Zizyte) 
Spr  CSCI0111  S02  25977  Arranged  (M. Zizyte) 
CSCI 0112. Computing Foundations: Program Organization.
Explores how organization of programs, data, and algorithms affects metrics such as time performance, space usage, social impacts, and data privacy. Students will learn how to choose between candidate data structures for a problem, how to write programs over several standard data structures, how to assess the quality of programs (from theoretical, practical, and social perspectives), and how to apply their skills to computational problems that could arise in a variety of fields. The course will teach objectoriented programming, in combination with basic functional and imperative programming concepts. The course is designed for both concentrators and nonconcentrators. Prerequisite: CSCI 0111
Fall  CSCI0112  S01  17465  MWF  1:001:50(08)  (T. Nelson) 
CSCI 0130. User Interfaces and User Experience.
Have you ever had trouble using someone else’s microwave? Have you ever wondered why keyboards are ordered “qwertyuiop”? We will focus on handson experience to learn when to use different interfaces, how to model and represent user interaction, how to elicit requirements and feedback from users, as well as the principles of user experience design, methods for designing and prototyping interfaces, and user interface evaluation. Students interested in gaining handson experience designing a user interface as well as learning the process behind building an effective interface should take this course. There will be assignments, readings, and workshop time, where students will have the opportunity to work alongside each other as they learn critical tools for interface and web design. This course is open to students that have not taken CSCI 1300 or CSCI 0130 in the past.
CSCI 0150. Introduction to ObjectOriented Programming and Computer Science.
Introduces programming in Java (a modern, widelyused programming language), interactive 2D computer graphics, and some fundamental data structures and algorithms. Students learn by programming a sequence of interactive graphics programs which gradually increase in complexity, including Doodle Jump, Tetris (http://bastilleweb.techhouse.org/), and a significant final project. Lectures are supplemented by skits performed by the UTAs (Undergraduate Teaching Assistants) to teach course concepts and for a bit of added entertainment! This course is intended for both potential concentrators and those who may take only a single course. There are NO prerequisites, and no prior knowledge of programming is required, though students who do have prior programming experience are also encouraged to take the course!
Fall  CSCI0150  S01  17416  TTh  2:303:50(12)  (A. van Dam) 
Fall  CSCI0150  C01  17417  W  9:0010:50  'To Be Arranged' 
Fall  CSCI0150  C02  17418  W  9:0010:50  'To Be Arranged' 
Fall  CSCI0150  C03  17419  W  9:0010:50  'To Be Arranged' 
Fall  CSCI0150  C04  17420  Arranged  'To Be Arranged'  
Fall  CSCI0150  C05  17421  T  10:3011:50  'To Be Arranged' 
Fall  CSCI0150  C06  17422  T  10:3011:50  'To Be Arranged' 
Fall  CSCI0150  C07  17423  Th  10:3012:20  'To Be Arranged' 
Fall  CSCI0150  C08  17424  Th  10:3012:20  'To Be Arranged' 
Fall  CSCI0150  C09  17425  T  4:005:50  'To Be Arranged' 
Fall  CSCI0150  C10  17426  T  4:005:50  'To Be Arranged' 
Fall  CSCI0150  C11  17427  Th  10:3012:20  'To Be Arranged' 
Fall  CSCI0150  C12  17428  Th  10:3012:20  'To Be Arranged' 
Fall  CSCI0150  C13  17429  Th  5:006:50  'To Be Arranged' 
Fall  CSCI0150  C14  17430  W  11:0012:50  'To Be Arranged' 
Fall  CSCI0150  C15  17431  T  4:005:50  'To Be Arranged' 
Fall  CSCI0150  C16  17432  T  5:006:50  'To Be Arranged' 
Fall  CSCI0150  C17  17433  W  6:007:50  'To Be Arranged' 
Fall  CSCI0150  C18  17434  T  7:008:50PM  'To Be Arranged' 
Fall  CSCI0150  C19  17435  T  7:008:50PM  'To Be Arranged' 
Fall  CSCI0150  C20  17436  T  7:008:50PM  'To Be Arranged' 
Fall  CSCI0150  C21  17437  T  10:3011:50  'To Be Arranged' 
Fall  CSCI0150  C22  17438  T  10:3011:50  'To Be Arranged' 
Fall  CSCI0150  C23  17439  Th  10:3011:50  'To Be Arranged' 
Fall  CSCI0150  C24  17440  Th  10:3011:50  'To Be Arranged' 
Fall  CSCI0150  C25  17441  T  6:408:30PM  'To Be Arranged' 
Fall  CSCI0150  C26  17442  T  6:408:30PM  'To Be Arranged' 
Fall  CSCI0150  C27  17443  W  7:008:50PM  'To Be Arranged' 
Fall  CSCI0150  C28  17444  W  7:008:50PM  'To Be Arranged' 
Fall  CSCI0150  C29  17445  W  7:008:50PM  'To Be Arranged' 
Fall  CSCI0150  C30  17446  W  6:007:50  'To Be Arranged' 
CSCI 0160. Introduction to Algorithms and Data Structures.
Introduces fundamental techniques for problem solving by computer that are relevant to most areas of computer science, both theoretical and applied. Algorithms and data structures for sorting, searching, graph problems, and geometric problems are covered. Programming assignments conform with the objectoriented methodology introduced in CSCI 0150. Prerequisite: CSCI 0150 or written permission.
CSCI 0170. Computer Science: An Integrated Introduction.
CSCI0170/0180 is an introductory sequence that helps students begin to develop the skills, knowledge, and confidence to solve computational problems elegantly, correctly, efficiently, and with ease. The sequence is unique in teaching both the functional and imperative programming paradigmsthe first through the languages Scheme and ML in CSCI0170; the second through Java in CSCI0180. The sequence requires no previous programming experience. Indeed, few high school students are exposed to functional programming; hence even students with previous programming experience often find this sequence an invaluable part of their education.
Although students are taught to use programming languages as tools, the goal of CSCI0170/0180 is not merely to teach programming. On the contrary, the goal is to convey to students that computer science is much more than programming! All of the following fundamental computer science techniques are integrated into the course material: algorithms, data structures, analysis, problem solving, abstract reasoning, and collaboration. Concrete examples are drawn from different subareas of computer science: in 0170, from arbitraryprecision arithmetic, natural language processing, databases, and strategic games; in 0180, from discreteevent simulation, data compression, and client/server architectures.
Fall  CSCI0170  S01  17455  MWF  11:0011:50(16)  (J. Hughes) 
CSCI 0180. Computer Science: An Integrated Introduction.
A continuation of CSCI 0170. Students learn to program in Java while continuing to develop their algorithmic and analytic skills. Emphasis is placed on objectoriented design, imperative programming, and the implementation and use of data structures. Examples are drawn from such areas as databases, strategy games, web programming, graphical user interfaces, route finding, and data compression. Lab work done with the assistance of TAs. Prerequisite: CSCI 0112, 0170, or CSCI 0190. CSCI 0111 can be used if additional work is done and with the instructor's permission.
CSCI 0190. Accelerated Introduction to Computer Science.
A onesemester introduction to CS covering programming integrated with core data structures, algorithms, and analysis techniques, similar to the twocourse introductory sequences (CSCI 01500200 and CSCI 01700200).
All students wishing to take CSCI 0190, irrespective of prior preparation, must pass a sequence of online placement assignments during the summer. Though the placement process is most appropriate for students who have had some prior programming experience, it is selfcontained so all are welcome to try learning the provided material and attempting placement. Placement information will be available by June 1st at http://cs.brown.edu/courses/csci0190/.
Please do not request override codes. The only way to get into the class is through placement. Students who do not successfully pass the placement process won't be allowed to register.
Fall  CSCI0190  S01  17457  MWF  9:009:50(09)  (S. Krishnamurthi) 
Fall  CSCI0190  L01  19430  M  3:005:00  (S. Krishnamurthi) 
Fall  CSCI0190  L03  19432  W  3:005:00  (S. Krishnamurthi) 
Fall  CSCI0190  L04  19433  Th  4:006:00  (S. Krishnamurthi) 
Fall  CSCI0190  L05  19434  F  1:003:00  (S. Krishnamurthi) 
CSCI 0200. Program Design with Data Structures and Algorithms.
Students extend their programdesign skills while learning multiple data structures, common graph algorithms, different forms of societal impacts from programs, how to analyze programs for performance, and how to work effectively with multiple styles of programming languages. Examples and course projects draw from several areas of computer science to help students identify their broader interests within the field. There will be a required weekly lab session involving handson work with course material.
Prerequisite: CSCI 0112, CSCI 0150, 0170, or CSCI 0190. In addition, CSCI 0111 can be used with both additional work and the instructor's permission. The first two weeks of the course will be taught as at least two parallel tracks based on which prerequisite course a student has taken.
CSCI 0200 will be offered every semester (fall and spring).
Fall  CSCI0200  S01  17458  MWF  2:002:50(01)  (N. DeMarinis) 
Fall  CSCI0200  S02  17459  Arranged  (N. DeMarinis)  
Spr  CSCI0200  S01  25978  MWF  11:0011:50(04)  (K. Fisler) 
Spr  CSCI0200  S02  25979  Arranged  (K. Fisler) 
CSCI 0220. Introduction to Discrete Structures and Probability.
Seeks to place on solid foundations the most common structures of computer science, to illustrate proof techniques, to provide the background for an introductory course in computational theory, and to introduce basic concepts of probability theory. Introduces Boolean algebras, logic, set theory, elements of algebraic structures, graph theory, combinatorics, and probability. No prerequisites.
Spr  CSCI0220  S01  25980  MWF  1:001:50(06)  (R. Lewis) 
CSCI 0300. Fundamentals of Computer Systems.
Covers fundamental concepts, principles, and abstractions that underlie the design and engineering of computer systems. Students will learn how a computer works, how to write safe and performant systems software, and what systems abstractions support today’s complex, highperformance systems developed in industry. Specific topics include machine organization, systems programming and performance, key concepts of operating systems, isolation, security, virtualization, concurrent programming, and the basics of distributed systems. Combined lectures, labs, and several handson projects involving programming exercises in C/C++. Prerequisites: CSCI 0160, 0180, 0190, or 0200; or permission of the instructor.
Spr  CSCI0300  S01  25981  TTh  1:002:20(08)  (N. DeMarinis) 
Spr  CSCI0300  S02  25982  Arranged  (M. Schwarzkopf) 
CSCI 0310. Introduction to Computer Systems.
Basic principles of computer organization. Begins with machine representation of data types and logic design, then explores architecture and operations of computer systems, including I/O, pipelining, and memory hierarchies. Uses assembly language as an intermediate abstraction to study introductory operating system and compiler concepts. Prerequisite: CSCI 0150 or CSCI 0180 or CSCI 0190.
CSCI 0320. Introduction to Software Engineering.
Focuses on designing, building, testing, and maintaining systems collaboratively. It covers programming techniques (using Java and TypeScript with various frameworks), objectoriented design, advanced testing (e.g., fuzz testing), debugging approaches, and tools such as source control systems. The course concludes with a major group project that students gather requirements for, then design and implement themselves. Prerequisite: CSCI 0160, 0180, CSCI 0190 or CSCI 0200; CSCI 0220 is recommended.
Fall  CSCI0320  S01  17460  TTh  1:002:20(06)  (T. Nelson) 
Fall  CSCI0320  S02  17461  Arranged  (T. Nelson)  
Fall  CSCI0320  C01  19123  F  9:0011:00  'To Be Arranged' 
Fall  CSCI0320  C02  19124  Th  4:006:00  'To Be Arranged' 
Fall  CSCI0320  C03  19125  Th  6:008:00PM  'To Be Arranged' 
Fall  CSCI0320  C04  19126  Th  7:009:00PM  'To Be Arranged' 
Fall  CSCI0320  C05  19127  F  2:304:30  'To Be Arranged' 
Fall  CSCI0320  C06  19128  F  1:003:00  'To Be Arranged' 
Spr  CSCI0320  S01  25983  TTh  1:002:20(08)  (T. Nelson) 
Spr  CSCI0320  S02  25984  Arranged  (T. Nelson) 
CSCI 0330. Introduction to Computer Systems.
Highlevel computer architecture and systems programming. The course covers the organization of computer systems (in terms of storage units, caches, processors, and I/O controllers) and teaches students assemblylanguage programming and Clanguage programming. Extensive programming exercises introduce students to systemslevel programming on Unix systems, as well as to multithreaded programming with POSIX threads. Students will be introduced to the functions of operating systems. Prerequisite: CSCI 0160, 0180, 0190, or 0200.
Fall  CSCI0330  S01  17462  MWF  2:002:50(01)  (T. Doeppner) 
Fall  CSCI0330  S02  17463  Arranged  (T. Doeppner) 
CSCI 0500. Data Structures, Algorithms, and Intractability: An Introduction.
This course will cover the basics of how to design and analyze data structures and algorithms. We will develop algorithmic intuition through rigorous analysis of algorithmic correctness and performance. We will also study the theory of NPcompleteness, which helps us understand which problems are computationally intractable.
Spr  CSCI0500  S01  27254  MW  3:004:20(10)  (P. Klein) 
Spr  CSCI0500  L01  27255  F  3:004:30  (P. Klein) 
CSCI 0530. Coding the Matrix: An Introduction to Linear Algebra for Computer Science.
Introduces vectors, matrices and their role in computer science in three components: (1) concepts, theorems, and proofs, (2) procedures and programs, (3) applications and working with data. Weekly lab sessions where students apply concepts to a real task with real data. Example labs: transformations in 2d graphics, errorcorrecting codes, image compression using wavelets, synthesizing a new perspective in a photo, face recognition, news story categorization, cancer diagnosis using machine learning, matching airplanes to destinations, Google's PageRank method. Other topics as time allows. Skills in programming and prior exposure to reading and writing mathematical proofs required.
CSCI 0535. Linear Algebra for Machine Learning.
The goal of this course is to provide firm foundations in linear algebra and optimization techniques that will enable students to analyze and solve problems arising in various areas of data science, especially machine learning and data analysis. The students will acquire a firm theoretical knowledge of these concepts and tools. You will also learn how to use these tools in practice by tackling various judiciously chosen projects (from Machine Learning, etc.).
CSCI 1010. Theory of Computation.
The course introduces basic models of computation including languages, finitestate automata and Turing machines. Proves fundamental limits on computation (incomputability, the halting problem). Provides the tools to compare the hardness of computational problems (reductions). Introduces computational complexity classes (P, NP, PSPACE and others). Prerequisite: CSCI0220 or CSCI1450 or CSCI1550 or APMA1650/1655 or CSCI1570
Fall  CSCI1010  S01  17464  TTh  10:3011:50(13)  (L. De Stefani) 
Fall  CSCI1010  S02  19266  Arranged  (L. De Stefani) 
CSCI 1040. The Basics of Cryptographic Systems.
This course will cover cryptographic concepts such as data privacy, encryption, authentication, digital signatures, differential privacy, privacyenhancing technologies, secure computation, and electronic money. The emphasis will be on how to use cryptographic systems correctly in a larger context, rather than on the mathematical details of how they work; although we will cover some of those details too, on a high level. This course will be aimed at practicing and aspiring poets, economists, software engineers, law and policy wonks, and business tycoons. No prerequisites.
Spr  CSCI1040  S01  26700  Arranged  (A. Lysyanskaya)  
Spr  CSCI1040  L01  26701  M  3:005:20  (A. Lysyanskaya) 
Spr  CSCI1040  L02  26702  M  3:005:20  (A. Lysyanskaya) 
CSCI 1230. Introduction to Computer Graphics.
Fundamental concepts in 2D and 3D computer graphics, e.g., 2D raster graphics techniques and simple image processing. Focuses on geometric transformations, and 3D modeling, viewing and rendering. A sequence of assignments in C++ culminates in a simple geometric modeler and ray tracer. Prerequisite: CSCI 0160, CSCI 0180, CSCI 0190, or CSCI 0200. Some knowledge of basic linear algebra is helpful but not required. Strong objectoriented programming ability (e.g., in C++, Java or Python) is required.
Fall  CSCI1230  S01  17466  TTh  10:3011:50(13)  (D. Ritchie) 
Fall  CSCI1230  S02  17467  Arranged  (D. Ritchie) 
CSCI 1234. Computer Graphics Lab.
CSCI 1234 is a halfcredit course intended to be taken concurrently with CSCI 1230 and provides students with a greater understanding of the material by having them extend each of 1230's assignments to greater depth.
Fall  CSCI1234  S01  17468  Arranged  (D. Ritchie) 
CSCI 1250. Introduction to Computer Animation.
Introduction to 3D computer animation production including story writing, production planning, modeling, shading, animation, lighting, and compositing. The first part of the course leads students through progressive exercises that build on each other to learn basic skills in 2D and 3D animation. At each step, student work is evaluated for expressiveness, technical correctness and aesthetic qualities. Students then work in groups creating a polished short animation. Emphasis on inclass critique of ongoing work which is essential to the cycle of visually evaluating work in progress, determining improvements, and implementing them for further evaluation.
Please see course website for application procedure.
CSCI 1260. Compilers and Program Analysis.
Lexical analysis, syntactic analysis, semantic analysis, code generation, code optimization, translator writing systems. Prerequisites: CSCI 0220, or CSCI 0320, or CSCI 0300, or CSCI 0330, or CSCI 1310, or CSCI 1330.
Fall  CSCI1260  S01  17469  MW  9:3010:50(09)  (R. Lewis) 
Fall  CSCI1260  S02  17476  Arranged  (R. Lewis) 
CSCI 1270. Database Management Systems.
Introduction to database systems internals, design and implementation. Includes data models and structures, languages, query processing and optimization, concurrency control and recovery algorithms. Coverage of relational distributed and parallel databases as well as noSQL big data systems. Prerequisites: One of CSCI 0300, 0330 (or equivalent coursework).
Fall  CSCI1270  S01  17477  TTh  9:0010:20(05)  (U. Cetintemel) 
Fall  CSCI1270  S02  18957  Arranged  (U. Cetintemel) 
CSCI 1280. Intermediate 3D Computer Animation.
Continues work begun in CSCI 1250 with deeper exploration of technical and artistic aspects of 3D computer animation including more sophisticated 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 in pairs, create a polished demonstration. Emphasis is on inclass critique of ongoing work. Prerequisite: CSCI 1250. Students may contact the instructor in December for permission.
CSCI 1290. Computational Photography.
Describes the convergence of computer graphics and computer vision with photography. Its goal is to overcome the limitations of traditional photography using computational techniques to enhance the way we capture, manipulate, and interact with visual media. Topics covered: cameras, human visual perception, image processing and manipulation, image based lighting and rendering, high dynamic range, single view reconstruction, photo quality assessment, non photorealistic rendering, the use of Internetscale data, and more. Students are encouraged to capture and process their own data. Prerequisites: previous programming experience, calculus, and probability; previous knowledge of computer graphics or computer vision. Any full intro sequence and linear algebra are required. Strongly recommended: CSCI 1230, CSCI 1430, CSCI 1470, ENGN 1610.
Fall  CSCI1290  S01  19267  TTh  1:002:20(06)  (J. Tompkin) 
CSCI 1300. User Interfaces and User Experience.
Have you ever walked into a door thinking that you were supposed to pull instead of push? Have you ever been stuck on a website, not sure how to proceed next? Learn when to use different interfaces, how to model and represent user interaction, how to elicit requirements and feedback from users, as well as the principles of user experience design, methods for designing and prototyping interfaces, and user interface evaluation. Students interested in both learning the process behind building an effective interface and gaining handson experience designing a user interface should take this course. There will be assignments, readings, and studios, where students will have the opportunity to work alongside TAs and interact with industry guests as they learn critical tools for interface and web design.
Website: http://cs.brown.edu/courses/csci1300/
Spr  CSCI1300  S01  26785  TTh  1:002:20(08)  (V. Cho) 
CSCI 1310. Fundamentals of Computer Systems.
Covers fundamental concepts, principles, and abstractions that underlie the design and engineering of computer systems, with reference to applications of these concepts in industry. Topics include machine organization, systems programming and performance, key concepts of operating systems, isolation, security, virtualization, concurrent programming, and the basics of distributed systems. Combined lectures, case studies, labs, and several handson projects involving programming exercises. This course is intended for Computer Science Master's students only. Anyone else wanting to take the course should contact the instructor.
Spr  CSCI1310  S01  25988  TTh  1:002:20(08)  (M. Schwarzkopf) 
Spr  CSCI1310  S02  25990  Arranged  (M. Schwarzkopf) 
CSCI 1320. Creating Modern Web & Mobile Applications.
This course covers all aspects of web application development, including initial concept, usercentric design, development methodologies, front and 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/CSCI 0300) who want to learn how to build web applications, and for students with a background in web design, including HTML and Javascript, who are interested in learning how to extend design techniques to incorporate the technologies needed in modern web applications. Project teams will consist of students with both backgrounds.
CSCI 1330. Computer Systems.
Highlevel computer architecture and systems programming. The course covers the organization of computer systems (in terms of storage units, caches, processors, and I/O controllers) and teaches students assemblylanguage programming and Clanguage programming. Extensive programming exercises introduce students to systemslevel programming on Linux systems, as well as to multithreaded programming with POSIX threads. Students will be introduced to the functions of operating systems.
Enrollment limited to Master's students only.
Fall  CSCI1330  S01  17478  MWF  2:002:50(01)  (T. Doeppner) 
Fall  CSCI1330  S02  17479  Arranged  (T. Doeppner) 
CSCI 1340. Introduction to Software Engineering.
CSCI 1340 focuses on designing, building, testing, and maintaining systems collaboratively. It covers programming techniques (using Java and TypeScript with various frameworks), objectoriented design, advanced testing (e.g., fuzz testing), debugging approaches, and tools such as source control systems. The course concludes with a major group project that students gather requirements for, then design and implement themselves.
Note: CSCI 1340 is for Master’s students only (they may not register for CSCI 0320). It is identical to 0320 but with the addition of supplemental work for each sprint. Prerequisite: CSCI 0160, CSCI 0180, CSCI 0190 or CSCI 0200; CSCI 0220 is recommended.
Fall  CSCI1340  S01  18966  TTh  1:002:20(06)  (T. Nelson) 
Fall  CSCI1340  S02  18967  Arranged  (T. Nelson)  
Spr  CSCI1340  S01  25971  TTh  1:002:20(08)  (T. Nelson) 
Spr  CSCI1340  S02  25972  Arranged  (T. Nelson) 
CSCI 1360. Human Factors in Cybersecurity.
This course is designed to push you to think about cybersecurity as an idea with both physical and virtual elements. Throughout the course, we will examine the value of information, the importance of users, and the difficult balance between security and usability. The ultimate goal of this course is to give you the intellectual and scientific framework you need to create systems that are both secure and efficient to use. The course focuses on usable security practices, but also looks deeply at the way our society influences security.
Fall  CSCI1360  S01  17480  W  3:005:30  (E. Zaldivar) 
Fall  CSCI1360  S02  18502  Arranged  (E. Zaldivar) 
CSCI 1370. Virtual Reality Design for Science.
Explores the visual and humancomputer interaction design process for scientific applications in Brown's immersive virtual reality Cave. Joint with RISD. Computer Science and design students learn how to work together effectively; 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 networked information systems, first we cover basic distributed computing mechanisms (e.g., naming, replication, security, etc.) and enabling middleware technologies. We then discuss how these mechanisms and technologies fit together to realize distributed databases and file systems, webbased and mobile information systems. Prerequisite: CSCI 0300, CSCI 0320, CSCI 0330, CSCI 1310 or CSCI 1330.
Spr  CSCI1380  S01  26205  TTh  10:3011:50(09)  (N. Vasilakis) 
CSCI 1410. Artificial Intelligence.
Algorithms and representations used in artificial intelligence. Introduction and implementation of algorithms for search, planning, perception, knowledge representation, logic, probabilistic representation and reasoning, robotics and machine learning.
Fall  CSCI1410  S02  18821  TTh  9:0010:20(05)  (S. Tellex) 
CSCI 1420. Machine Learning.
How can artificial systems learn from examples and discover information buried in data? We explore the theory and practice of statistical machine learning, focusing on computational methods for supervised and unsupervised 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 expose students to relevant ethical and societal considerations related to machine learning that may arise in practice. Please contact the instructor for information about the waitlist.
Spr  CSCI1420  S01  26206  TTh  2:303:50(11)  (S. Bach) 
CSCI 1430. Computer Vision.
How can we program computers to understand the visual world? This course treats vision as inference from noisy and uncertain data and emphasizes probabilistic and statistical approaches. Topics may include perception of 3D scene structure from stereo, motion, and shading; segmentation and grouping; texture analysis; learning, object recognition; tracking and motion estimation. Strongly recommended: basic linear algebra, calculus, and probability.
Spr  CSCI1430  S01  26699  TTh  10:3011:50(09)  (S. Sridhar) 
CSCI 1440. Algorithmic Game Theory.
This course examines topics in game theory and mechanism design from a computer scientist's perspective. Through the lens of computation, the focus is the design and analysis of systems utilized by selfinterested agents. Students will investigate how the potential for strategic agent behavior can/should influence system design, and the ramifications of conflicts of interest between system designers and participating agents. Emphasis on computational tractability is paramount, so that simple designs are often preferred to optimal. Students will learn to analyze competing designs using the tools of theoretical computer science, and empirical tools, such as empirical gametheoretic analysis. Application areas include computational advertising, wireless spectrum, and prediction markets.
Spr  CSCI1440  S01  26207  W  3:005:30(10)  (A. Greenwald) 
CSCI 1450. Advanced Introduction to Probability for Computing and Data Science.
Probability and statistics have become indispensable tools in computer science. Probabilistic methods and statistical reasoning play major roles in machine learning, cryptography, network security, communication protocols, 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, Markov processes, limit theorems, and basic elements of Bayesian and frequentist statistical inference. Basic programming experience required for optional homework assignments.
Students cannot get concentration credit for both CSCI 1450 and APMA 1650/ APMA 1655
Fall  CSCI1450  S01  17482  TTh  2:303:50(12)  (E. Upfal) 
CSCI 1460. Computational Linguistics.
The application of computational methods to problems in naturallanguage processing. In particular we examine techniques due to recent advances in deep learning: word embeddings, recurrent neural networks (e.g., LSTMs), sequencetosequence models, and generative adversarial networks (GANs). Programming projects include parsing, machine translation, question answering, and chatbots.
Fall  CSCI1460  S01  17580  TTh  2:303:50(12)  (E. Pavlick) 
CSCI 1470. Deep Learning.
What is deep learning? How is it related to machine learning? How is it applied to perform tasks like classifying images or translating languages? Deep Learning belongs to a broader family of machine learning methods. Deep learningbased methods (e.g., convolutional neural networks, recurrent neural networks, autoencoders) have led to rapid improvements in applications like computer vision, natural language processing, robotics, and even genomics and health. In this course, you will get an overview of the prominent techniques of deep learning and their applications. This course is designed to help you understand the underlying concepts as well as the promise and pitfalls of deep learning. It also aims at providing handson practice of implementing and applying deep learning methods in Python.
Spr  CSCI1470  S01  26208  MWF  12:0012:50(01)  (R. Singh) 
CSCI 1480. Building Intelligent Robots.
How do robots function autonomously in dynamic, unpredictable environments? This course focuses on programming mobile robots, such as the iRobot Roomba, to perceive and act autonomously in realworld environments. The major paradigms for autonomous control and robot perception are examined and compared with robotic notions in science 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 in fully observable, nonchanging environments. Students are introduced to stateoftheart optimization methods such as linear programming, integer programming, local search, and constraint programming. Strongly recommended: CSCI 0160, CSCI 0180 or CSCI 0190; CSCI 0510; and CSCI 0530 or MATH 0520 or MATH 0540.
CSCI 1510. Introduction to Cryptography and Computer Security.
This course studies the tools for guaranteeing safe communication and computation in an adversarial setting. We develop notions of security and give provably secure constructions for such cryptographic objects as cryptosystems, signature schemes and pseudorandom generators. We also review the principles for secure system design. Prerequisites: CSCI 0220, and either CSCI 0510 or CSCI 1010.
Fall  CSCI1510  S01  17483  TTh  10:3011:50(13)  (P. Miao) 
CSCI 1550. Probabilistic Methods in Computer Science.
Randomization and probabilistic techniques play an important role in modern computer science, with applications ranging from combinatorial optimization and machine learning to communications networks and secure protocols. This course introduces the most fundamental probabilistic techniques used in computer science applications, in particular in randomized algorithms, probabilistic analysis of algorithms and machine learning.
Prerequisite: Basic background in probability theory course such as CSCI 1450.
Spr  CSCI1550  S01  26703  TTh  2:303:50(11)  (E. Upfal) 
CSCI 1570. Design and Analysis of Algorithms.
A single algorithmic improvement can have a greater impact on our ability to solve a problem than ten years of incremental improvements in CPU speed. We study techniques for designing and analyzing algorithms. Typical problem areas addressed include hashing, searching, dynamic programming, graph algorithms, network flow, and optimization algorithms including linear programming. Prerequisites: CSCI 0160, CSCI 0180, or CSCI 0190, and one of CSCI 0220, CSCI 1010, CSCI 1450, MATH 0750, MATH 1010, MATH 1530.
Fall  CSCI1570  S01  17484  TTh  2:303:50(12)  (L. De Stefani) 
CSCI 1575. Algorithms: in Depth.
Halfcredit course intended to be taken with CSCI 1570. Students will explore each topic in greater depth by collaboratively solving homework problems 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 information retrieval (IR), the study of indexing, processing, and querying of textual data. The focus will be on newer techniques geared to hypertext documents available on the World Wide Web. Topics include efficient text indexing; Boolean and vector space retrieval models; evaluation and interface issues; Web crawling, linkbased 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 space complexity classes on these models; the circuit model of computation and its relation to serial and parallel time complexity; spacetime tradeoffs on serial computers; areatime tradeoffs on the VLSI computational model; interactive and probabilistically checkable proofs; the definition of NP in terms of probabilistically checkable proofs; hardness of approximations to solutions to NPhard problems. Prerequisite: CSCI 0510.
CSCI 1600. RealTime and Embedded Software.
Comprehensive introduction to the design and implementation of software for programmable embedded computing systems, in applications such as Internet of Things, transportation, and mobile. Includes the overall embedded realtime software design and development processes, with a focus on engineering for reliability. Major project component. Prerequisites: one of CSCI 0300, CSCI 0320, CSCI 0330, CSCI 1310, or CSCI 1330
Fall  CSCI1600  S01  17486  MWF  12:0012:50(15)  (M. Zizyte) 
Fall  CSCI1600  L01  17487  T  4:007:00  (M. Zizyte) 
Fall  CSCI1600  L02  17488  M  5:308:30PM  (M. Zizyte) 
CSCI 1610. Building HighPerformance Servers.
In depth study of modern server design. Considers architectures for building highperformance, robust, scalable, and secure network servers. We will consider all aspects of "missioncritical" servers. Topics include multithreaded and asynchronous programming techniques, database access, performance profiling, security, and redundancy. Teams will build significant projects. Prerequisite: CSCI 0320 or 0360. CSCI 1670 or 1680 is recommended.
CSCI 1620. Computer Systems Security Lab.
This course is a halfcredit lab intended to be taken concurrently with CS1660 and provides students with a deeper understanding of the material by doing advanced versions of the cs1660’s projects. These advanced versions focus on realworld skills: performing attacks that are more difficult and rely on less serious vulnerabilities, performing attacks against systems with more realworld constraints, and creating attacks that achieve a higher standard of quality than a mere “proof of concept.”
Instructor permission required.
Spr  CSCI1620  S01  26696  Arranged  (N. DeMarinis)  
Spr  CSCI1620  S02  26697  Arranged  (N. DeMarinis) 
CSCI 1650. Software Security and Exploitation.
CSCI 1650 covers software exploitation techniques and stateoftheart mechanisms for hardening software. The course begins with a summary of prevalent software defects, typically found in applications written in memory unsafe languages, like C/C++, and proceeds with studying traditional and modern exploitation techniques, ranging from classical code injection and code reuse up to the latest goodies (e.g., JITROP). For the most part, it focuses on defenses against certain vulnerability classes and the way(s) to bypass them. Students will be introduced to advanced software exploitation techniques and countermeasures, and study (in depth) the boundaries and effectiveness of standard hardening mechanisms, such as address space randomization and stack and heap protections.
Fall  CSCI1650  S01  17489  MW  3:004:20(10)  (V. Kemerlis) 
CSCI 1660. Introduction to Computer Systems Security.
This course teaches principles of computer security from an applied viewpoint and provides handson experience on security threats and countermeasures. Topics include code execution vulnerabilities (buffer overflow, sandboxing, mobile code), malware (trojans, viruses, and worms), access control (users, roles, policies), cryptosystems (hashing, signatures, certificates), network security (firewalls, TLS, intrusion detection, VPN), and human and social issues. Prerequisites: one of (CSCI 0160, 0180, or 0190) and (CSCI 0300, 0330, 1310, or 1330). To be added to the course waitlist, please fill out this form: https://forms.gle/pHPAy9ntQkAQ7xLD9
Spr  CSCI1660  S01  26694  TTh  2:303:50(11)  (N. DeMarinis) 
Spr  CSCI1660  S02  26695  Arranged  (N. DeMarinis) 
CSCI 1670. Operating Systems.
Covers not just the principles of operating systems but the intricacies of how they work. Topics include multithreaded programming, managing threads and interrupts, managing storage, processor scheduling, operatingsystem structure, virtualization, security, and the design of file systems (both local and distributed). Extensive examples are taken from actual systems, including Linux and Windows. Students are expected to complete both problem sets and programming assignments (in C). Prerequisite: CSCI 0300, 0330, 1310, or 1330.
Spr  CSCI1670  S01  26210  MWF  2:002:50(07)  (T. Doeppner) 
Spr  CSCI1670  S02  26211  Arranged  (T. Doeppner) 
CSCI 1680. Computer Networks.
Covers the technologies supporting the Internet, from Ethernet and WiFi through the routing protocols that govern the flow of traffic and the web technologies that are generating most of it. A major concern is understanding the protocols used on the Internet: what the issues are, how they work, their shortcomings, and what improvements are on the horizon. Prerequisite: CSCI 0300, 0330,1310,1330 or consent of instructor.
Fall  CSCI1680  S01  17490  TTh  9:0010:20(05)  (N. DeMarinis) 
Fall  CSCI1680  S02  19265  Arranged  (N. DeMarinis) 
CSCI 1690. Operating Systems Laboratory.
Halfcredit course intended to be taken with CSCI 1670. Students individually write a simple operating system in C. Serves to reinforce the concepts learned in 1670 and provides valuable experience in systems programming. Corequisite: CSCI 1670.
Spr  CSCI1690  S01  26212  Arranged  (T. Doeppner) 
CSCI 1710. Logic for Systems.
The course will focus on proving properties about systems and programs. We will study the distinction between programs and specifications, and check for whether the former obey the latter. We will work with tools that have extensive automation such as model constructors, model checkers, and proof assistants. Problems and projects will apply to realworld systems. Prerequisite: CSCI 0160, CSCI 0180, CSCI 0190, or CSCI 0200. Preferred but not required: CSCI 0220
Spr  CSCI1710  S01  26213  MWF  10:0010:50(03)  (T. Nelson) 
Spr  CSCI1710  S02  26214  Arranged  (T. Nelson) 
CSCI 1729. Programming Languages Lab.
Halfcredit course intended to be taken concurrently with CSCI 1730. Students individually implement a full programming language chosen by the course. Reinforces the concepts learned in CSCI 1730 and provides valuable experience in implementing programming languages. Corequisite: CSCI 1730
CSCI 1730. Design and Implementation of Programming Languages.
Explores the design principles of modern programming languages through implementation, comparison, and reflection. Examines a variety of linguistic features that impact both control and data. Topics vary by year; more information on the course home page. Prerequisite: CSCI 0160, CSCI 0180 or CSCI 0190.
Fall  CSCI1730  S01  17622  MWF  11:0011:50(16)  (S. Krishnamurthi) 
CSCI 1760. Multiprocessor Synchronization.
This course examines the theory and practice of multiprocessor synchronization. Subjects covered include multiprocessor architecture, mutual exclusion, waitfree and lockfree synchronization, spin locks, monitors, load balancing, concurrent data structures, and transactional synchronization. Prerequisites: CSCI 0330
Fall  CSCI1760  S01  17491  TTh  1:002:20(06)  (M. Herlihy) 
CSCI 1780. Parallel and Distributed Programming.
Covers the practical aspects involved in designing, writing, tuning, and debugging software designed to run on parallel and distributed systems. Topics might include clientserver computation, threads, networks of workstations, message passing, shared memory, partitioning strategies, load balancing, algorithms, remote procedure call, and synchronization techniques. Prerequisites: CSCI 0220 and either 0320 or 0360; 0510 recommended.
CSCI 1800. Cybersecurity and International Relations.
The global Internet shortens distances, makes businesses more efficient and facilitates greater social interaction. At the same time, it exposes vital national resources to exploitation and makes it easier for the international criminal element to prey on innocent Internet users. Cybersecurity is concerned with making the Internet a more secure and trustworthy environment. In this course we study this topic from the technological and policy points of view. The goal is to facilitate communication across the divide that normally characterizes the technological and policy communities.
Spr  CSCI1800  S01  26215  W  5:007:00(10)  (E. Zaldivar) 
Spr  CSCI1800  S02  26216  Arranged  (E. Zaldivar) 
CSCI 1805. Computers, Freedom and Privacy.
Who is the Big Brother that we most fear? Is it the NSA  or is it Google and Facebook? Rapidly changing social mores and the growing problem of cybersecurity have all contributed to a sense that privacy is dead. Laws protecting privacy and civil liberties are stuck in the analog age, while the capabilities for mass digital surveillance continue to advance rapidly. This course will examine a variety of informational privacy and technology issues. A major theme: the historical and contemporary struggle to bring surveillance under democratic control to protect against abuses of privacy, civil liberties and human rights.
Fall  CSCI1805  S01  17492  TTh  9:0010:20(05)  (T. Edgar) 
Fall  CSCI1805  S02  17493  Arranged  (T. Edgar) 
CSCI 1810. Computational Molecular Biology.
Highthroughput experimental approaches now allow molecular biologists to make largescale measurements of DNA, RNA, and protein, the three fundamental molecules of the cell. The resulting datasets are often too large for manual analysis and demand computational techniques. This course introduces algorithms for sequence comparison and alignment; molecular evolution and phylogenetics; DNA/RNA sequencing and assembly; recognition of genes and regulatory elements; and RNA and protein structure. The course demonstrates how to model biological problems in terms of computer science.
Prerequisites: CSCI 0160, CSCI 0180 or CSCI 0190, or consent of instructor.
Fall  CSCI1810  S01  17494  TTh  2:303:50(12)  (S. Istrail) 
CSCI 1820. Algorithmic Foundations of Computational Biology.
The course is devoted to computational and statistical methods as well as software tools for DNA, RNA, and protein sequence analysis. The focus is on understanding the algorithmic and mathematical foundations of the methods, the design of associated genomics software tools, as well as on their applications. Topics include: sequence alignment, genome assembly, gene prediction, regulatory genomics, and SNP's variation. The course is open to computer and mathematical sciences students as well as biological and medical students.
Spr  CSCI1820  S01  26692  TTh  2:303:50(11)  (S. Istrail) 
CSCI 1850. Deep Learning in Genomics.
Deep learning models have achieved impressive performance in fields like computer vision and NLP. The collection of vast quantities of biological data naturally leads to the question  can deep learning help us understand genomics? We will cover deep learning models like Autoencoders and Convolutional Neural Networks and how have they been applied to solve problems in genomics. We will learn about different biological datasets, interpretation methods that help explain predictions, and what unique challenges are presented by the data in this field. Critical thinking and learning from the practical application of models to data are expected outcomes.
CSCI 1860. Cybersecurity Law and Policy.
Course description: Cybersecurity and cyber conflict pose unique legal and policy challenges for governments, companies and citizens. The way those problems are resolved will shape the future of the internet. This course will examine cybersecurity as a legal and policy problem. How can government and society address network and computer insecurity while upholding privacy, civil liberties and other fundamental values?
Fall  CSCI1860  S01  17495  Arranged  (T. Edgar) 
CSCI 1870. Cybersecurity Ethics.
This timely, topical course offers a comprehensive examination of ethical questions in cybersecurity. These issues pervade numerous, diverse aspects of the economy and society in the Information Age, from human rights to international trade. Students will learn about these topics, beginning first with acquaintance with the dominant ethical frameworks of the 20th and 21st centuries, then employing these frameworks to understand, analyze, and develop solutions for leading ethical problems in cybersecurity. The things that you learn in this course will stay with you and inform your personal and professional lives.
Fall  CSCI1870  S01  17496  M  3:005:30(03)  (D. Hurley) 
Fall  CSCI1870  S02  17497  Arranged  (D. Hurley) 
CSCI 1880. Introduction to Computer Security.
This course examines the basic principles of computer security for an organization, recognizing which system components relate to which principles. Additionally, the course covers methodologies and skills for making informed security decisions and understanding how to apply security principles to design security mechanisms while considering tradeoffs. Topics include general security principles, cryptography, authentication authorization, identity, and access management, operating systems security, network security, web security, and applications security. Throughout the course, you will develop a preliminary cybersecurity plan for an organization
Spr  CSCI1880  S01  26217  Arranged  (B. Palazzi) 
CSCI 1900. csciStartup.
In csciStartup, you will incorporate and run a startup. Apply as a team to be part of a prototype class to remove the mystery from starting a company and to focus entirely on a product you're passionate about. Teams will incorporate, build a product for real customers, advertise their product, and improve it week after week. We'll spend half our class meetings with individual attention to each group's progress and how to improve your offerings. Assignments will be designed to apply to any company, with enough flexibility to ensure you're always working on things that 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 computer science to build computational models of physical and biological systems. Example applications include modeling and then simulating the behavior of a collection of genes, the spread of disease in a population, a single neuron in isolation or the complex of neurons comprising the primate visual cortex.
CSCI 1950B. Computational Topology and Discrete Geometry.
This course will investigate (through a mixture od lectures and student presentations of recent papers) topics in computational topology, including Morse theory and discrete differential geometry. Other possible topics are knot polyonmials, simplicial homology, and geometric probability theory. Some mathematical sophistication and programming skills required. No prerequisites.
CSCI 1950H. Computational Topology.
We will study various algorithmic problems that arise in the study of topological phenomena, such as winding number, turning number, knot polynomials, topology of covering spaces (especially Riemann surfaces), and discrete Morse theory. The mathematical topics will be briefly introduced before we move to computations, but some a priori mathematical sophistication will make the course more valuable to the student. Prerequisite: CSCI 0160, 0180, or 0190.
CSCI 1950J. Introduction to Computational Geometry.
Geometric algorithms in two and three dimensions. Algorithmic and geometric fundamentals. Point location, convex hulls, proximity (Voronoi diagrams, Delaunay triangulations), intersections, the geometry of rectangles. Prerequisites: CSCI 0160, 0170, or 0190; and CSCI 0220.
CSCI 1950K. Innovating Game Development.
A projectcentered course focused on technological, paradigm, and design innovations for game development. As teams, students will propose and implement a project demonstrating a novel technology for gaming. Examines the current state and future of game development through a seminar of speakers active in game development and research. A strong computer science or engineering background is recommended.
CSCI 1950M. Advanced Practical Combinatorial Algorithms.
We review recent as well as wellestablished advanced techniques in combinatorial optimization and constraint satisfaction. Students will study and individually present research papers and work on challenging software projects in small teams. Prerequisites: CSCI 0160, 0180, or 0190; and CSCI 0510; and CSCI 1490 or 2580, or instructor permission.
CSCI 1950N. 2D Game Engines.
2D Game Engines covers core techniques used in the development of the software that drives computer games and other interactive software. Projects involve building different varieties of 2D game engines as well as games that require use of the features implemented in the engines. Topics include highlevel engine design, vector and raster graphics, animation, collision detection, physics, content management, and game AI. Prerequisite: CSCI 0160, 0180, or 0190. This course has also been offered as DISP CSCI1971. Students interested in an override should request on through Courses@Brown. Priority will be given to both seniors and juniors.
Fall  CSCI1950N  S01  17498  TTh  6:408:00PM(02)  (J. Tompkin) 
CSCI 1950T. Advanced Animation Production.
Students will apply knowledge and skills gained in previous animation courses to produce a high quality short animated film as a group. Production will follow the industry standard pipeline that includes modeling, texturing, lighting, animating, rendering, and post production. Interested students will perform preproduction story and concept design prior to beginning of course. Prerequisite: CSCI 1250. Enrollment limited to 15. Instructor permission required.
Fall  CSCI1950T  S01  17579  M  3:005:30(03)  (B. Meier) 
CSCI 1950U. Topics in 3D Game Engine Development.
Covers core techniques in 3D game development with an emphasis on engine architecture. Students independently develop their own engines using C++, OpenGL, and the Qt framework, then work in groups to create a polished game. Topics include: spatial subdivision, player representation, collision detection and response, game networking, GPUs, and OpenGL. Prerequisites: CSCI 1230 or knowledge of C++ and one of CSCI0300, CSCI0320, or CSCI0330 or equivalent experience. Enrollment limited to 25.
Spr  CSCI1950U  S01  26218  W  3:005:30(10)  (D. Ritchie) 
CSCI 1950X. Software Foundations.
Software Foundations will be a projectbased course focusing on the challenges and techniques involved in proving nontrivial properties about realworld systems. We will base our exploration around formal development in a proof environment. Roughly half of the course will be a guided tutorial of proof techniques using one or more theorem provers; in the remainder, students will apply this knowledge to existing systems. No prior experience with theorem provers or proof assistants is necessary, but familiarity with and aptitude for functional programming will be a huge bonus. Prerequisite: CSCI 1730 or equivalent; mathematical maturity.
CSCI 1950Z. Computational Methods for Biology.
This course will introduce algorithms from machine learning and combinatorial optimization with a focus on their application to biological data. Topics will include problems in phylogenetic inference, population genetics, 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 deep understanding of a complex ecosystem of tools and platforms. Data Science refers to the intersection of these skills and how to transform data into actionable knowledge. This course provides an overview of techniques and tools involved and how they work together: SQL and NoSQL solutions for massive data management, basic algorithms for data mining and machine learning, information retrieval techniques, and visualization methods.
Prerequisites: CSCI 0160, CSCI 0180, CSCI 0190, or CSCI 0200. One of CSCI 0300, 0330, CSCI 0320, 1310 or 1330 strongly recommended.
Spr  CSCI1951A  S01  26219  MW  3:004:20(10)  (L. De Stefani) 
Spr  CSCI1951A  S02  26220  Arranged  (L. De Stefani) 
CSCI 1951B. Virtual Citizens or Subjects? The Global Battle Over Governing Your Internet.
The Internet began as a U.S. government research project, progressed to an open network run by freespirited geeks, and transitioned in the late 1990’s to a unique governance model in which nations, corporations, and civil society were supposed to all have a voice. Where are the real decisions being made? Who is making them? How can you and citizens of other nations influence these decisions? The global battle to run the Internet, brewing for years, has broken wide open with revelations of American spying on a massive scale.
CSCI 1951C. Designing Humanity Centered Technology.
This semester we will explore how emerging technologies might shape our lives in the near future, as we design and build working prototypes. We will proceed from a set of questions that will complement a deep immersion in design process and creative practice. We will explore the “how” and “why” of designing new technologies. The course will help students build a portfolio of design projects that are in response to various design strategies such as Human Centered Design, Speculative Design, Critical Design, and Design Fiction, as well as developing skills for iterative prototyping and participatory critique.
Students interested in registering should sign up here: https://docs.google.com/forms/d/e/1FAIpQLSdvo0o4ICpj55ZubZQTXdVRfBmnbCHbT8egriwPOcWcbRiy6A/viewform
Fall  CSCI1951C  S01  17499  MW  11:001:50(15)  (I. Gonsher) 
CSCI 1951G. Optimization Methods in Finance.
Optimization plays an important role in financial decisions. Many computational finance problems ranging from asset allocation to risk management, from option pricing to model calibration can be solved efficiently using modern optimization techniques. This course discusses several classes of optimization problems (including linear, quadratic, integer, dynamic, stochastic, conic, and robust programming) encountered in financial models. For each problem class, after introducing the relevant theory and efficient solution methods, we discuss problems of mathematical finance that can be modeled within this problem class. Prerequisites: CSCI 1450 or APMA 1650, and CSCI 1570.
CSCI 1951I. CS for Social Change.
Working in a studio environment to iteratively design, build, and test technical projects in partnership with different social change organizations, students will be placed in small teams to collaboratively work on projects that will range from developing a chatbot to aid community engagement to conducting geospatial data analytics. We will also reflect on our positionality and ethics in engaging in social impact work and what it practically means to leverage technology to create social change on an everyday basis.
CSCI 1951J. Interdisciplinary Scientific Visualization.
Students will learn about solving scientific problems using computer graphics and visualization. Projects will involve the solution of scientific problems using computer graphics, modeling, and visualization. Working in small groups, students will identify scientific problems, propose solutions involving computational modeling and visualization, evaluate the proposals, design and implement the solutions, apply them to the problems, evaluate their success, and report on results. Example projects might include interactive software systems, immersive virtual reality cave applications, quantitative analysis tools, or new applications of existing visualizations methods. The focus will be on applications in the new virtual reality cave.
CSCI 1951L. Blockchains and Cryptocurrencies.
Introduction to modern blockchainbased systems. Topics covered include consensus and distributed computing, examples cryptocurrencies, programming smart contracts, privacy and secrecy, transfer networks, atomic swaps and transactions, noncurrency applications of blockchains, and legal and social implications. Students will do a programming project and a term project.
Spr  CSCI1951L  S01  26222  TTh  2:303:50(11)  (M. Herlihy) 
Spr  CSCI1951L  S02  26223  Arranged  (M. Herlihy) 
CSCI 1951N. VR+X, The Potential of Virtual Reality to Transform Nearly Everything.
This course introduces students to the history, present, and future possibilities of virtual reality (VR) with a focus on addressing the question: What is the transformative potential of virtual reality? We’ll critically evaluate a variety of applications in fields as varied as healthcare, architecture, education, and storytelling. Students will learn discovery and design thinking processes of a kind that can lead to the development of VR solutions. Students will create a design concept for a VR use case in a field of their choosing.
CSCI 1951P. Design of Robotic Systems (ENGN 1931I).
Interested students must register for ENGN 1931I.
CSCI 1951R. Introduction to Robotics.
Each student will learn to program a small quadrotor helicopter. We will provide each student with their own robot for the duration of the course. The course will cover PID controllers for stable flight, localization with a camera, mapping, and autonomous planning. At the end of the course, the aim is for students to understand the basic concepts of a mobile robot and aerial vehicle. Enrollment by instructor permission.
Fall  CSCI1951R  S01  17500  TTh  10:3011: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 for researchers. We will target several specific types of data, including volumetric data, and remote sensing data. We will investigate the capabilities of software for headmounted displays (HMDs), bigmetal displays like caves and the yurt, and, as a baseline, desktop displays. Software evaluation will include web research, handson case studies, and surveying. Results will be documented in a courses wiki.
CSCI 1951V. Hypertext/Hypermedia: The Web Was Not the Beginning and the Web Is Not the End.
Hypertext/Hypermedia systems  first designed in the 1960s  link information and people. Developed in the late 1980s, the Web was the first global hypermedia system; 30+ years later, it represents a small part of past visions. Students will identify stilluncommon features by exploring/using systems from the 1960s onwards. They will read papers for class discussion. They will study architecture and design topics such as annotating, note taking, searching, networking, collaboration, permanence, and social impact. Web programming projects, using TypeScript/MERN stack, will culminate in group projects to create their own hypertext/hypermedia systems. Prerequisites: An introductory CS sequence or equivalent experience
Fall  CSCI1951V  S01  17540  W  3:005:30(10)  (N. Meyrowitz) 
Fall  CSCI1951V  L01  19390  Th  4:006:00  (N. Meyrowitz) 
Fall  CSCI1951V  L02  19391  F  3:005:00  (N. Meyrowitz) 
CSCI 1951W. Sublinear Algorithms for Big Data.
A huge quantity of data is worth little unless we can extract insights from it. Yet, the large quantities mean that classic algorithms (running in linear, quadratic or even more time) can be infeasible in practice. We must instead turn to new algorithmic approaches and paradigms, which allow us to answer valuable questions about our data in runtime that is still feasible even when the data set is Facebooksized.
Surprisingly, to answer many computational and statistical questions, sometimes there is no need to read/store every piece of data! This course focuses on this exciting "sublinear" algorithmic regime. We will study practical algorithms, making clever use of randomness with strong theoretical guarantees
Prerequisites: (CS22 or equivalent); (CS145 or APMA1650/1655 or equivalent); (CS157 or CS155). Mathematical maturity is essential: this is a theory course with proofs.
Recommended: CS155
CSCI 1951X. Formal Proof and Verification.
Proof assistants are tools that are used to check the correctness of programs. Unlike tools like model checkers and SAT solvers, proof assistants are highly interactive. Machinechecked formal proofs lead to trustworthy programs and fully specified reliable mathematics. This course introduces students to the theory and use of proof assistants, using the system Lean. We will use Lean to verify properties of functional programs and theorems from pure mathematics. We will learn the theory of deductive reasoning and the logic that these tools are based on.
Text: "The Hitchhiker's Guide to Logical Verification" by Blanchette et al.
Prereqs: CSCI 1710 Logic for Systems or a proofbased mathematics course. Basic familiarity with functional programming (e.g. Haskell, ML) is helpful but not required.
Fall  CSCI1951X  S01  17501  MW  3:004:20(10)  (R. Lewis) 
CSCI 1952B. Responsible Computer Science in Practice.
What can ethics and social and political theory tell us about how to navigate the social impacts of computing? How do these perspectives shape technical decisions computer scientists have to make? The role of computer scientists is rapidly evolving: as the systems they build affect everyone, from individuals to society at large, computer scientists become more than just coders. They must be able to assess the social impacts of the technology they develop and engage with experts from other disciplines which offer critical insights and normative perspectives on those impacts. The goal of this course is to enable you to understand and critically reflect on key concepts and ideas in ethics and social and political theory on topics ranging from fairness to consent, digital wellbeing to regulation, and to apply them to concrete technical decisions in practical exercises and projectoriented work.
Spr  CSCI1952B  S01  26225  MW  3:004:20(10)  (J. Netter) 
CSCI 1952C. Frontiers of Graph Algorithms Seminar.
Graphs are one of the most powerful and flexible algorithmic tools. Likewise, graph algorithms remains a primary focus of modern algorithms research. This course will sample major results from contemporary paradigms of graph algorithms. Particular attention will be paid to techniques in graph sparsification and how these techniques have helped to recently solve open problems in algorithms. Planned topics include: metric embeddings, expander decompositions, iterative rounding, edgedegreeconstrained subgraphs and graph shortcuts. This course is aimed at current and potential future graduate students considering proofbased research in algorithms. Each student will be responsible for reading and presenting a paper with the goal of better understanding how contemporary research in theoretical computer science is both done and best communicated.
Fall  CSCI1952C  S01  19369  W  3:005:30(10)  (E. Hershkowitz) 
CSCI 1952I. Language Processing in Humans and Machines (CLPS 1850).
Interested students must register for CLPS 1850.
CSCI 1952V. Algorithms for the People.
Computer science has transformed every aspect of society, including communication, transportation, commerce, finance, and health. The revolution enabled by computing has been extraordinarily valuable. The largest tech companies generate almost a trillion dollars a year and employ millions of people. But technology does not affect everyone in the same way. In this seminar, we will examine how new technologies, ranging from facial recognition to drones, are affecting marginalized communities.
CSCI 1952X. Contemporary Digital Policy and Politics.
This course will examine the politics and processes for making policies related to the internet and digital policy issues. We will examine current issues at the national level, including the White House and federal agencies, Congress, international institutions and industry on issues such as privacy and information security, and on debates like whether and how to regulate Big Tech. Topics covered include the creation of national policies at the White House, the regulatory process, legislation, standards, global implications and the politics of technological change.
Format and participation: This is an asynchronous version of IAPA 1811, available only to students enrolled in a completely online master’s degree program, by permission of the instructor. Students will complete weekly activities in lieu of attending synchronous class discussions.
Spr  CSCI1952X  S01  26691  Arranged  (T. Edgar) 
CSCI 1952Y. Computer Architecture.
How does a computer program actually turn into the electrons moving inside of your computer? What are the relevant metrics and tradeoffs for designing a computer, and what impact do these tradeoffs have on our software? In this course, we cover computer organization and design, from a software lens. Topics include instruction set architectures, processor design and pipelining, memory hierarchies, program flow optimization, I/O, and emerging applications. Homeworks and final project will use powerful architecture simulators and explore general and specialized hardware for various applications.
Spr  CSCI1952Y  S01  27105  MWF  10:0010:50(03)  (M. Zizyte) 
CSCI 1952Z. Robots as a Medium: Creating Art with Teams of Robots.
In this course, students will work in groups to use teams of flying and ground robots to create works of art, such as paintings, composing music, choreography, etc. This course is open to all concentrations, no prior experience necessary!
Spr  CSCI1952Z  S01  27224  TTh  10:3011:50(09)  (N. Ayanian) 
Spr  CSCI1952Z  L01  27225  T  6:009:00PM  (N. Ayanian) 
Spr  CSCI1952Z  L02  27226  Th  6:009:00PM  (N. Ayanian) 
CSCI 1970. Individual Independent Study.
Independent study in various branches of Computer Science. Section numbers vary by instructor. Please check Banner for the correct section number 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 2D game engines. Projects involve building different varieties of 2D game engines as well as games that require use of the features implemented in the engines. Topics include highlevel engine design, vector and raster graphics, 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 on engine architecture. Students independently develop their own engines using C++, OpenGL, and the Qt framework, then work in groups to create a polished game. Topics include: spatial subdivision, player representation, collision detection and response, game networking, GPUs, and OpenGL. Prerequisite: CSCI 1230 and one of the following CSCI 0320, CSCI 0330, CSCI 1950N, OR CSCI 1971.
CSCI 1973. Independent Study.
CSCI 2000. Computer Science Research Methods.
What does it mean to conduct research in computer science, and how might we be most effective at it? To help begin a fruitful career in CS research, this class will cover the philosophy and practice of forming ideas, executing research, presenting outcomes, and understanding and contributing to our community. The aim is to kickstart your time at Brown CS by being the 'missing semester' on how to be a PhD student, and by peeling back the curtain on why CS academia works like this to help you make the most of your time. Discussions include: motivating, pitching, and funding research; finding, reading, and reviewing research; selecting research areas and forming hypotheses; designing, performing, and evaluating research; communicating research; research collaborations; and research ethics. We will learn together through presentations, activities, discussions, plus readings and assignments out of class.
CSCI 2002. Privacy and Personal Data Protection.
If you tried to live for one day without generating any digital personal data, how would you spend it? In the Information Age, the use of personal data has proliferated and is pervasive. This course offers a comprehensive examination of protection of privacy and personal data, which is central to autonomy, dignity, and liberty. Topics include identity, financial, health, educational, and other data. Students will learn about: Fair Information Practices; the development of modern privacy rules in the United States and around the world; Fourth Amendment privacy and the autonomy of the individual in relation to the state; key US laws (HIPAA, FERPA, GLBA, GINA, COPPA, etc.); significant international rules (European Union’s General Data Protection Regulation (GDPR), etc.); important institutions (Federal Trade Commission, Data Protection Authorities, etc.); standards; Privacy by Design and Default; and emerging issues.
Spr  CSCI2002  S01  26227  Arranged  (D. Hurley) 
CSCI 2230. Computer Graphics.
This course offers an indepth exploration of fundamental concepts in 2D and 3D computer graphics. It introduces 2D raster graphics techniques, including simple image processing. The bulk of the course is devoted to 3D modeling, geometric transformations, and 3D viewing and rendering. A sequence of assignments culminates in a simple geometric modeler and ray tracer. C++ and the graphics library OpenGL are used throughout the course, as is shader programming on the GPU. The final project is typically a small group project spec'd and implemented by the group using shaders or ray tracing to create special effects.
Fall  CSCI2230  S01  19110  TTh  10:3011:50(13)  (D. Ritchie) 
Fall  CSCI2230  S02  19112  Arranged  (D. Ritchie) 
CSCI 2240. Advanced Computer Graphics.
CSCI 2240 explores several key areas of 3D graphicsrendering, geometry processing, optimization, and simulationtaking a sophisticated approach to each. This year, we are looking to improve the course's coverage of optimization by adding more lecture content on the topic (optimization theory, methods for solving (sparse) linear systems, etc.) and by designing a new assignment (likely 3D asrigidaspossible shape manipulation). Prerequisites: one of CSCI 0530, MATH 0520, MATH 0540; CSCI 1230; and familiarity with multivariable calculus by e.g. having taken one of MATH 180, MATH 200, MATH 350
Spr  CSCI2240  S01  26228  MWF  11:0011:50(04)  (D. Ritchie) 
CSCI 2270. Topics in Database Management.
Indepth 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 webbased data management. Prerequisite: CSCI 1270.
Spr  CSCI2270  S01  26229  M  12:002:20(01)  (U. Cetintemel) 
CSCI 2300. HumanComputer Interaction Seminar.
Covers methods for conducting research in humancomputer interaction (HCI). Topics will be pursued through independent reading, assignments, and class discussion. Comprises four assignments that apply to HCI research methods and push the envelope, which are designed to be meaningful and have the potential for real impact. Students will gain the background necessary to perform research in HCI and the skills to conduct humancentric research. There will be little content about user interfaces, but students may find some topics in CSCI 1300 relevant. Please see the course website when it's available (shortly before the semester begins) for information about overrides.
CSCI 2310. Human Factors and User Interface Design.
Covers current research issues involving the implementation, evaluation and design of user interfaces, while also providing a basic background in the fundamentals of user interface evaluation, programming, tools, and techniques. A possible topic is programming and designing deviceindependent interfaces. Previous topics have included the development of pervasive internetbased interfaces and software visualization. Prerequisite: Consent of instructor.
CSCI 2330. Programming Environments.
Programming tools; control and data integration; software understanding and debugging; environments for parallel and distributed programming; reverse engineering; configuration management and version control and debugging. Emphasis on current research areas. Prerequisite: consent of instructor.
CSCI 2340. Software Engineering.
Topics in the design, specification, construction and validation of programs. Focus will be on tools to support each of these stages. Course will pay special attention to the concerns raised by the properties of modern software systems including distribution, security, componentbased decomposition and implicit control. A basic software engineering course such as CSCI0320 or CSCI1340 or extensive industrial programming experience is required. Knowledge of system programming such as CSCI0300,CSCI0330, CSCI1310, or CSCI1330 is highly recommended.
Spr  CSCI2340  S01  26898  TTh  9:0010:20(05)  (S. Reiss) 
CSCI 2370. Interdisciplinary Scientific Visualization.
Learn how to do research on using computer graphics, visualization, and interaction applied to scientific problems. Working in small multidisciplinary groups, students identify scientific problems, propose solutions involving computational modeling and visualization, design and implement the solutions, apply them to the problems, and evaluate their success.
Prerequisites: programming experience, some graphics experience, problem ideas.
CSCI 2390. PrivacyConscious Computer Systems.
We will examine research papers on distributed system design, privacypreserving, and secure computing techniques, and discuss how to apply these ideas in practice. The goal is to understand if, and how we can better protect the sensitive data we entrust to computer systems, both against leaks and against unauthorized or unethical use. We will look at web services, datacenter systems, distributed communication systems, and machine learning systems. During class, you will present and discuss papers, finish a set of handson assignments, work on a research project, and present your project at the end of the semester.
Fall  CSCI2390  S01  17508  TTh  2:303:50(12)  (M. Schwarzkopf) 
CSCI 2410. Statistical Models in NaturalLanguage Understanding.
Various topics in computer understanding of natural language, primarily from a statistical point of view. Topics include: hidden Markov models, wordtagging models, probabilistic contextfree grammars, syntactic disambiguation, semantic word clustering, wordsense disambiguation, machine translation and lexical semantics. Prerequisite: CSCI 1410.
CSCI 2420. Probabilistic Graphical Models.
Probabilistic graphical models provide a flexible framework for modeling large, complex, heterogeneous collections of random variables. After a brief introduction to their representational power, we provide a comprehensive survey of stateoftheart methods for statistical learning and inference in graphical models. We discuss a range of efficient algorithms for approximate inference, including optimizationbased variational methods, and simulationbased Monte Carlo methods. Several approaches to learning from data are explored, including conditional models for discriminative learning, and Bayesian methods for controlling model complexity. Programming experience required for homeworks and projects, which integrate mathematical derivations with algorithm implementations. PREREQUISITES: CSCI1420 or APMA1690.
CSCI 2430. Topics in Machine Learning.
Machine learning from the artificial intelligence perspective, with emphasis on empirical validation of learning algorithms. Different learning problems are considered, including concept learning, clustering, speedup learning, and behavior learning. For each problem a variety of solutions are investigated, including those from symbolic AI, neural and genetic algorithms, and standard statistical methods. Prerequisite: CSCI 1410 or familiarity with basic logic and probability theory.
CSCI 2440. Advanced Algorithmic Game Theory.
This course examines topics in game theory and mechanism design from a computer scientist’s perspective. Through the lens of computation, the focus is the design and analysis of systems utilized by selfinterested agents. Students will investigate how the potential for strategic agent behavior can/should influence system design, and the ramifications of conflicts of interest between system designers and participating agents. Emphasis on computational tractability is paramount, so that simple designs are often preferred to optimal. Students will learn to analyze competing designs using the tools of theoretical computer science, and empirical tools, such as empirical gametheoretic analysis. Application areas include computational advertising, wireless spectrum, and prediction markets.
Spr  CSCI2440  S01  26230  W  3:005:30(10)  (A. Greenwald) 
CSCI 2450. Exchange Scholar Program.
Fall  CSCI2450  S01  16098  Arranged  'To Be Arranged' 
CSCI 2470. Deep Learning.
Deep Learning belongs to a broader family of machine learning methods. It is a particular version of artificial neural networks that emphasizes learning representation with multiple layers of networks. Deep Learning, plus the specialized techniques that it has inspired (e.g. convolutional neural networks, recurrent neural networks, and transformers), have led to rapid improvements in many applications, such as computer vision, machine learning, sound understanding, and robotics. This course gives students an overview of the prominent techniques of Deep Learning and its applications in computer vision, language understanding, and other areas. It also provides handson practice of implementing deep learning algorithms in Python. A final project will implement an advanced piece of work in one of these areas. Prerequisites: basic programming: (CSCI 0150, 0170, 0190); linear algebra: (CSCI 0530, MATH 0520, 0540); stats/probability: (CSCI 0220, 1450, 0450, MATH 1610, APMA 1650, 1655)
Spr  CSCI2470  S01  26231  MWF  12:0012:50(01)  (R. Singh) 
CSCI 2500A. Advanced Algorithms.
In this course, we study a selection of advanced algorithms and data structures that are provably correct and fast. Our goal is to present a broad range of algorithmic ideas and techniques, especially those that have had significant impact on the field and/or have had or might have practical impact. Prerequisite: CSCI 1570 or the equivalent
CSCI 2500B. Optimization Algorithms for Planar Graphs.
Planar graphs arise in applications such as road map navigation and logistics, graph drawing and image processing. We will study graph algorithms and data structures that exploit planarity. Our focus will be on recent research results in optimization. Prerequisite: CSCI 1570 or the equivalent.
Spr  CSCI2500B  S01  27049  MWF  11:0011:50(04)  (P. Klein) 
CSCI 2510. Approximation Algorithms.
Approximation Algorithms deal with NPhard combinatorial optimization problems by efficiently constructing a suboptimal solution with some specified quality guarantees. We study techniques such as linear programming and semidefinite programming relaxations, and apply them to problems such as facility location, scheduling, bin packing, maximum satifiability or vertex cover. Prerequisite  one of the following: CSCI 1510, 1550, 1810, 1950J, 1950L, any graduatelevel course on algorithms (including 2500A, 2500B, 2580).
CSCI 2520. Computational Geometry.
Algorithms and data structures for fundamental geometric problems in two and three dimensions. Topics include point location, range searching, convex hull, intersection, Voronoi diagrams, and graph drawing. Applications to computer graphics, circuit layout, information visualization, and computeraided design are also discussed. Prerequisite: CSCI 1570 or instructor permission.
CSCI 2530. Design and Analysis of Communication Networks.
A theory seminar focusing on algorithmic and combinatorial issues related to the design and analysis of communication networks for parallel and distributed systems. Topics include packet routing, circuit switching, distributed shared memory, fault tolerance, and more. Prerequisites: CSCI 1550, 1570, or equivalent.
CSCI 2531. Internet and Web Algorithms.
This advanced graduate course/seminar focuses on the mathematical foundations of algorithms for handling large amounts of data over networks. We'll read and discuss recent papers in information retrieval, search engines, link analysis, probabilistic modeling of the web and social networks, and more. Recommended: CSCI 1550 and CSCI 1570, or equivalent courses.
CSCI 2540. Advanced Probabilistic Methods in Computer Science.
Advanced topics in applications of probabilistic methods in design and analysis of algorithms, in particular to randomized algorithms and probabilistic analysis of algorithms. Topics include the Markov chains Monte Carlo method, martingales, entropy as a measure for information and randomness, and more. Prerequisite: CSCI 1450. Recommended but not required: CSCI 1570.
Spr  CSCI2540  S01  26704  TTh  2:303:50(11)  (E. Upfal) 
CSCI 2550. Parallel Computation: Models, Algorithms, Limits.
The theoretical foundations of parallel algorithmics. Analysis of the most important models of parallel computation, such as directedacyclic computation graphs, shared memory and networks, and standard dataexchange schemes (common address space and messagepassing). Algorithmic techniques with numerous examples are cast mostly in the dataparallel framework. Finally, limitations to parallelizability (Pcompleteness) are analyzed. The content of the course is likely to change as technology evolves.
CSCI 2560. Advanced Complexity.
Advanced topics in computational complexity, such as: the polynomial hierarchy, interactive proofs, pseudorandomness, derandomization, probabilistically checkable proofs.
CSCI 2570. Introduction to Nanocomputing.
Nanoscale technologies employing materials whose smallest dimension is on the order of a few nanometers are expected to replace lithography in the design of chips. We give an introduction to computational nanotechnologies and explore problems presented by their stochastic nature. Nanotechnologies based on the use of DNA and semiconducting materials 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 in practical systems. Explores issues encountered in implementing such systems. Emphasizes the wide variety of techniques and methodologies available, including integer programming, local search, constraint programming, and approximation algorithms. Problems addressed may include: scheduling, coloring, traveling salesman tours, and resource allocation. Prerequisites: CSCI 0320 and basic knowledge of linear algebra.
CSCI 2590. Advanced Topics in Cryptography.
Seminarstyle course on advanced topics in cryptography. Example topics are zeroknowledge proofs, multiparty computation, extractors in cryptography, 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.
Fall  CSCI2590  S01  17585  W  3:005:30(10)  (A. Lysyanskaya) 
CSCI 2660. Computer Systems Security.
This course teaches computer security principles from an applied viewpoint and provides handson experience with security threats and countermeasures. The course additionally covers principles and skills useful for making informed security decisions and for understanding how security interacts with the world around it. The main topics covered are cryptography, authentication, access control, web security, and network security. Other topics include cybersecurity ethics and privacy. The course aims to balance theory and practice. These advanced versions focus on realworld skills: performing attacks that are more difficult and rely on less serious vulnerabilities, and creating attacks that achieve a higher standard of quality than a mere ”proof of concept.” This course covers the same material as CSCI 1620 and 1660 and shares their assignments. Graduate students only. If you are interested in this course, request an override and fill out this form: https://forms.gle/pHPAy9ntQkAQ7xLD9
Spr  CSCI2660  S01  26689  TTh  2:303:50(11)  (N. DeMarinis) 
Spr  CSCI2660  S02  26690  Arranged  (N. DeMarinis) 
CSCI 2670. Operating Systems.
Covers not just the principles of operating systems but the intricacies of how they work. Topics include multithreaded programming, managing threads and interrupts, managing storage, processor scheduling, operatingsystem structure, virtualization, security, and the design of file systems (both local and distributed). Extensive examples are taken from actual systems, including Linux and Windows. Students are expected to complete both problem sets and programming assignments (in C) and will individually write a simple operating system. Prerequisite: one of CSCI 0300, CSCI 0330, CSCI 1310, or CSCI 1330. Graduate students only. This course covers the same material as the combination of CSCI 1670 and 1690 and shares their assignments.
Spr  CSCI2670  S01  26233  MWF  2:002:50(07)  (T. Doeppner) 
Spr  CSCI2670  S02  26234  Arranged  (T. Doeppner) 
CSCI 2730. Programming Language Theory.
Theoretical models for the semantics of programming languages and the verification of programs. Topics will be drawn from operational semantics, denotational semantics, type theory and static analyses. Recommended prerequisite: 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 (to be determined) in distributed computing. May be repeated for credit.
CSCI 2810. Advanced Computational Molecular Biology.
Highthroughput experimental approaches now allow molecular biologists to make largescale measurements of DNA, RNA, and protein, the three fundamental molecules of the cell. The resulting datasets are often too large for manual analysis and demand computational techniques. This course introduces algorithms for sequence comparison and alignment; molecular evolution and phylogenetics; DNA/RNA sequencing and assembly; recognition of genes and regulatory elements; and RNA and protein structure. The course demonstrates how to model biological problems in terms of computer science. CSCI 0160, 0180, 0190, or 0200. Recommended: CS 220, or some other course that introduces concepts from discrete math and probability. Course overrides are available at the instructor’s discretion.
Fall  CSCI2810  S01  17504  TTh  2:303:50(12)  (S. Istrail) 
CSCI 2840. Advanced Algorithms in Computational Biology and Medical Bioinformatics.
Devoted to computational problems and methods in the emerging field of Medical Bioinformatics where genomics, computational biology and bioinformatics impact medical research. We will present challenging problems and solutions in three areas: Disease Associations, Protein Folding and Immunogenomics. This course is open to graduate students and advanced undergraduates with Computational or Life Science backgrounds. Prior background in Biology is not required.
CSCI 2890. Comprehensive Examination Preparation.
For graduate students who have met the tuition requirement and are paying the registration fee to continue active enrollment while preparing for a preliminary examination.
Fall  CSCI2890  S01  16099  Arranged  'To Be Arranged'  
Spr  CSCI2890  S01  24852  Arranged  'To Be Arranged' 
CSCI 2950C. Topics in Computational Biology.
This course will investigate active and emerging research areas in computational biology. Topics include cancer genomics; genome rearrangements and assembly; and protein and regulatory interaction networks. The course will be a mixture of lectures and student presentations of recent conference and journal papers.
CSCI 2950D. Sensor Data Management.
Sensor networks combine sensing, computing, actuation, and communication in a single infrastructure that allows us to observe and respond to phenomena in the physical and cyber world. The sensors range from tiny "smart dusts" to dimesized RFID tags and largescale weather sensors. This course will cover the stateofthe art in designing and building sensor networks, focusing on issues that revolve around data and resource management. No prerequisites.
CSCI 2950E. Stochastic Optimization.
This advanced graduate course/seminar will focus on optimization under uncertainty, or optimization problems where some of the constrains include random (stochastic) components. Most practical optimization problems are stochastic (subject to future market conditions, weather, faults, etc.), and there has been substantial research (both theoretical and experimental) in efficient solution for such problems. We'll read and discuss some of the recent works in this area.
CSCI 2950F. Implementing WebBased Software Systems.
CSCI 2950G. LargeScale Networked Systems.
Explores widelydistributed systems that take advantage of resources throughtout the Internet. The systems leverage their large size and geographic diversity to provide bandwidth scalability, rapid responses, faulttolerance, highavailability and diverse data collection. Topics include overlay networks, peertopeer systems, content distribution networks, distributed file systems and widescale measurement systems.
CSCI 2950H. Advanced Cryptography.
CSCI 2950I. Computational Models of the Neocortex.
This course addresses the problem of modeling the perceptual neocortex using probabilistic graphical models, including Bayesian and Markov networks, and extensions to model time and change such as hidden Markov models and dynamic Bayesian networks. The emphasis is on problems of learning, inference, and attention. Sources include the literature in computational and cognitive neuroscience, machine learning, and other fields that bear on how biological and engineered systems make sense of the world. Prerequisites: basic probability theory, algorithms and statistics.
CSCI 2950J. Cognition, HumanComputer Interaction and Visual Analysis.
In this graduate seminar we will learn about models of human cognition and perception, and explore potential implications of the models on how computers and humans can interact effectively when performing scientific analyses. Participants will be responsible for reading assigned materials, taking turns guiding discussions of the readings, and preparing a final paper and presentation. It is recommended that participants have some background in at least one of the areas of study.
CSCI 2950K. Special Topics in Computational Linguistics.
Every year will cover a different topic in computational linguistics, from a statistical point of view, including parsing, machine translation, conference, summarization, etc. Prerequisites: CSCI 1460 or permission of the instructor.
CSCI 2950M. Computer Science, Algorithms and Economics.
Course investigates the interplay of economic theory and computer science. It is suitable for advanced senior undergraduates and for graduate students. We will study topics such as: algorithms for selfish routing; competitive combinatorial auctions; Multicast cost sharing and cooperative games; graphical models for games; and related topics. This course will be organized around the presentation of recent research papers. Prerequisite: CSCI 1570 or equivalent.
CSCI 2950N. Special Topics in Autonomous Robotics.
No description available.
CSCI 2950O. Topics in BrainComputer Interfaces.
Introduces the mathematical and computational foundations of braincomputer interfaces. Statistical learning, Bayesian inference, dimensionality reduction, information theory, and other topics are presented in the context of brain interfaces based on neural implants and EEG recordings. Prerequisites: Basic knowledge of probability, statistics and linear algebra (e.g., CSCI 1550, APMA 1650, APMA 1690, or APMA 2640). Enrollment limited to 20 students.
CSCI 2950P. Special Topics in Machine Learning.
This seminar course explores current research topics in statistical machine learning. Focus varies by year, and may include Bayesian nonparametrics; models for spatial, temporal, or structured data; and variational or Monte Carlo approximations. Course meetings combine lectures with presentation and discussion of classical and contemporary research papers. Students will apply some this material to a project, ideally drawn from their own research interests.
CSCI 2950Q. Topics in Computer Vision.
This course will cover current topics in computer vision by focusing on a single real problem in computer vision. Recent courses have focused on forensic video analysis of an unsolved murder and threedimensional object recognition for a mobile robot. Readings from the literature are integrated with group projects to solve problems beyond the state of the art. Strong mathematical skills (probability, linear algebra, calculus) and previous 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 wellestablished advanced techniques in combinatorial optimization and constraint satisfaction. Students will study and individually present research papers and work on challenging software projects in small teams. Prerequisites: CSCI 0160, 0180, or 0190; and CSCI 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 arise in the design, implementation, and deployment of distributed computing systems by covering the state of the art in research and industry. Typical topics include cloud computing and sensor networks. Strongly recommended: CSCI 0320, CSCI 1270, or CSCI 1951A.
CSCI 2950U. Special Topics on Networking and Distributed Systems.
Explores current research topics in networking, distributed and operating systems. Specific topics may include wireless and sensor networking, Internetscale distributed systems, cloud computing, as well as the core problems, concepts, and techniques underlying these systems. The course has two components: reading and discussion of current and classical research papers, and a research project related to the topic but ideally drawn from students' own research interests. This is a graduatelevel 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 that arise in practice from areas like cloud computing, databases, surveillance and finance. Topics will vary each year. Pre Requisites: CSCI 1660 and CSCI 1510 recommended or instructor permission. This year's theme is cryptography for social good.
CSCI 2950W. Online Algorithms.
Decisions must often be made before the entire data is available. Online algorithms solve problems in which commitments must be made as the data is arriving. Choosing which items to evict from a cache before knowing future requests, which advertisers to consider for displaying ads alongside the result of a search, or which most representative data to store when computing statistics about a huge stream of information. We will discuss the worstcase model, which hinges against the worst possible future data, and some stochastic and gametheoretic models.
CSCI 2950X. Topics in Programming Languages and Systems.
Examines contemporary research topics in software construction from the perspectives of programming languages, software engineering and computeraided verification. The primary goals are to understand which theory applies to which problems and to convert that theory into tools. Topics include security, modularity, and new paradigms in software composition. Prerequisite: CSCI 1730 or written permission of the instructor.
CSCI 2950Y. Theorem Proving.
This course explores computerassisted theorem proving with the Coq Proof Assistant. The course will teach students to formally specify software and model mathematical theories. We will then study techniques for mechanically proving theorems about these Coq. Prerequisites: CSCI 1730 or CSCI 0170 and permission of the instructor.
CSCI 2950Z. Robot Learning and Autonomy.
This seminar course will cover current research topics related to perceiving and acting in the real world. These topics will be pursued through independent reading, class discussion, and project implementations. Papers covered will be drawn from robotics, computer vision, animation, machine learning, and neuroscience. Special emphasis will 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 future generations of scientists and engineers, with a particular focus on broadening participation in computing across society. Academic papers describing existing models, systems, courses, and evaluation for teaching robotics at undergraduate and secondary levels will be covered through students presentations. A group project will be conducted to find viable and accessible "offtheshelf" technology solutions suited to teaching robotics without requiring a technical background. Instructor permission required.
CSCI 2951B. DataDriven Vision and Graphics.
Investigates current research topics in imagebased graphics and vision. We will examine data sources, features, and algorithms for understanding and manipulating visual data. We will pay special attention to methods that use crowdsourcing or Internetderived data. Vision topics such as scene understanding and object detection will be linked to graphics applications such as photo editing and imagebased rendering. These topics will be pursued through independent reading, class discussion and presentations, and a semester long research project. Strong mathematical skills and previous imaging (vision or computational photography) courses are essential.
CSCI 2951C. Autonomous Agents and Computational Market Design.
An important area of research in artificial intelligence is how to effectively automate decision making in timecritical, informationrich environments. Electronic markets are a prime example of such environments. In this course students will create their own simulated electronic market as well as autonomous agents that trade in their market simulation. Application domains will include supply chain management, the Dutch flower auctions, and ad auctions, such as those run by Google and Facebook. Enrollment limited to 40 graduate students.
CSCI 2951E. Topics in Computer Systems Security.
This course explores advanced topics and highlights current research in computer security and privacy. Recent research papers will be presented and discussed. Also, projects will provide an opportunity for creative work. Class attendance is required and active participation in class discussions is essential. The course has two sections, each with a different focus and prerequisites. Section S01 (Networks, Software, and Systems) addresses computer security and privacy from the perspective of networks, software, and systems. Section S02 (Human Factors, Law, and Policy) addresses computer security and privacy from the perspective of law, policy, and human factors. Either section of the course can be used toward satisfying the capstone requirement for the ScB degree in Computer Science. Instructor permission is required to register.
CSCI 2951F. Learning and Sequential Decision Making.
The course explores automated decision making from a computerscience perspective. It examines efficient algorithms, where they exist, for single agent and multiagent planning as well as approaches to learning nearoptimal decisions from experience. Topics will include Markov decision processes, stochastic and repeated games, partially observable Markov decision processes, and reinforcement learning. Of particular interest will be issues of generalization, exploration, and representation. Participants should have taken a graduatelevel computer science course and should have some exposure to machine learning from a previous computerscience class or seminar; check with instructor if not sure. Recommended Prerequisites: CSCI 1950F or CSCI 1420
Spr  CSCI2951F  S01  27220  TTh  9:0010:20(05)  (R. Parr) 
CSCI 2951I. Computer Vision for Graphics and Interaction.
Computer vision reconstructs real world information from image and video data; computer graphics synthesizes dynamic virtual worlds; interaction lets us explore these worlds; and machine learning allows us to map between domains across vision, graphics, and interaction. In visual computing, these fields converge to exploit both models of visual appearance and databases of examples to generate and interact with new images. This enables applications from the seemingly simple, like semantic photo editing, to the seemingly science fiction, like mixed reality. In this seminar, we will discover the stateoftheart algorithmic contributions in computer vision which make this possible. Please join us!
CSCI 2951K. Topics in Collaborative Robotics.
Practical approaches to designing intelligent systems. Topics include search 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.
CSCI 2951M. Advanced Algorithms Seminar.
Students in this course will read, present, and discuss recent breakthrough papers on the topic of algorithms, and the related areas needed to analyze algorithms. This course is aimed at current and potential future graduate students who want to gain technical depth and perspective on the field of algorithms. Topics will roughly alternate by year, with even years emphasizing fundamental techniques, and odd years emphasizing applications 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 will be described on the first day of class. Ideal students will have a mix of the following: 1) motivation to learn how to read papers, 2) technical skills and background, 3) willingness to participate and contribute to discussions.
CSCI 2951N. Advanced Algorithms in Computational Biology.
This is a fulllecture, graduate course on algorithms and biomedical applications. The Foundations lectures are an introduction to the biological and medical genomics application areas. Each Algorithm section is devoted to an algorithmic method presented in rigorous depth, followed by an important open problem in the application area, together with the current most effective algorithmic solutions to the problem. Graduate students and advanced undergraduates in computational and mathematical sciences and engineering are welcome. Biological, life sciences and medical students and faculty are welcome as well and will be able to participate more in the applications areas.
CSCI 2951O. Foundations of Prescriptive Analytics.
We are undoubtedly in the middle of an Analytics Revolution that enabled turning huge amounts data into insights, and insights into predictions about the future. At its final frontiers, Prescriptive Analytics is aimed at identifying the best possible action to take given the constraints and the objective. To that end, this course provides students with a comprehensive overview of the theory and practice of how to apply Prescriptive Analytics through optimization technology. A wide variety of stateoftheart techniques are studied including: Boolean Satisfiability, Constraint Programming, Linear Programming, Integer Programming, Local Search MetaHeuristics, and LargeScale Optimization. Pre Requisites: One of CSCI 0300, 0320, CSCI 0330, CSCI 1310, OR CSCI 1330 and recommended: one of CSCI 0530, CSCI 1570, MATH 0520 or MATH 0540.
Spr  CSCI2951O  S01  26235  F  3:005: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 many computer scientists. For this reason, this course provides a selfcontained, elementary introduction to the concepts from combinatorial topology needed to analyze distributed computing. Conversely, while the systems and models used here are standard in computer science, they may be unfamiliar to students with a background in pure or applied mathematics. For this reason, this course also provides a selfcontained, elementary description of standard notions of distributed computing. CSCI 0220 required, CSCI 1760 recommended
CSCI 2951T. DataDriven Computer Vision.
Investigates current research topics in datadriven object detection, scene recognition, and imagebased graphics. We will examine data sources, features, and algorithms useful for understanding and manipulating visual data. We will pay special attention to methods that harness largescale or Internetderived data. There will be an overview of the current crowdsourcing techniques used to acquire massive image datasets. Vision topics such as scene understanding and object detection will be linked to graphics applications such as photo editing. These topics will be pursued through independent reading, class discussion and presentations, and projects involving current research problems in Computer Vision.
CSCI 2951U. Topics in Software Security.
This course investigates the stateoftheart in software exploitation and defense. Specifically, the course is structured as a seminar where students present research papers to their peers. We will begin with a summary of prevalent software defects, typically found in applications written in memory unsafe languages, and proceed to surveying what we are up against: traditional and modern exploitation techniques, ranging from classical code injection and code reuse up to the newest goodies (JITROP, Blind ROP). For the bulk part, we will focus on the latest advances in protection mechanisms, mitigation techniques, and tools against modern vulnerability classes and exploitation methods.
Spr  CSCI2951U  S01  26687  M  3:005:30(13)  (V. Kemerlis) 
CSCI 2951X. Reintegrating AI.
The goal of AI has been to build complete intelligent agents, yet the field has been fragmented into a collection of problemspecific areas of study. We will first spend a few weeks in lecture covering a new approach to integrating existing AI subfields into a single agent architecture, and remainder of the semester on selfdirected, semesterlong research projects.
Grading based on a midsemester project proposal, and a substantial openended final project. The projects will be multidisciplinary in nature but students will have the opportunity to work in small groups, so they need not necessarily have expertise in the relevant areas. Graduate students welcome; undergraduates need instructor permission to enroll.
Spr  CSCI2951X  S01  26236  TTh  1:002:20(08)  (G. Konidaris) 
CSCI 2951Z. Advanced Algorithmic Game Theory.
This course examines topics in game theory from a computer scientist's perspective. Through the lens of computation, it will focus on the design and analysis of systems involving selfinterested agents, investigating how strategic behavior should influence algorithm design, which gametheoretic solution concepts are practical to implement, and the ramifications of conflicts of interest between system designers and participating agents. Students will create their own automated trading agents for various simulated market games. Topics include: auctions and mechanism design, equilibria, and learning. For graduate credit, students will complete additional homework exercises, and a significant programming project.
CSCI 2952B. Topics in Computer Science Education Research.
How do people learn computing, and what can we do to teach them better? Answering these questions requires applying techniques from a variety of disciplines: computer science, naturally, but also cognitive science, psychology, linguistics, sociology, and more—even fields like economics can be relevant. This course studies different focused topics in computing education research (CER), drawing on these other disciplines as needed.
CSCI 2952C. Learning with Limited Labeled Data.
As machine learning is deployed more widely, researchers and practitioners keep running into a fundamental problem: how do we get enough labeled data? This seminar course will survey research on learning when only limited labeled data is available. Topics covered include weak supervision, semisupervised learning, active learning, transfer learning, and fewshot learning. Students will lead discussions on classic and recent research papers, and work in teams on final research projects.
Previous experience in machine learning is required through CSCI 1420 or equivalent research experience.
CSCI 2952F. Distributed Systems at Scale: Microservices Management.
This seminar investigates and explores cutting edge challenges and issues in the emerging Microservices paradigm. Microservices are a specific cloud paradigm for enabling distributed systems and applications at scale. In particular, this course builds on the foundations provided by the initial distributed systems, networking and operating systems offering (i.e., CSCI 1380, CSCI 1680, CSCI 1670) and explores how these concepts are used to realize, manage, and orchestrate microservices. The course is driven by materials from academic conferences and industrial blogs. The industrial blogs will provide context and motivation for different problems. The academic reasons will provide a deep divide into the technical details: we will focus on reading, analyzing, critiquing and brainstorming academic papers. Students taking this class should be familiar with reading academic literature, performing critical analysis, and working on open ended problems with undefined solutions. More information: http://cs.brown.edu/courses/info/csci2952f/
CSCI 2952G. Deep Learning in Genomics.
Deep learning models have achieved impressive performance in fields like computer vision and NLP. Given an adequate amount of data, these models can extract meaningful representations to perform accurate predictions. The collection of vast quantities of biological data naturally leads to the question  can deep learning help us understand genomics? In this seminarstyle class, we will cover the recent research literature trying to answer this question. We will learn how stateoftheart models like CNNs, RNNs, GCNs, GANs, etc. have been applied to solve significant problems in genomics and what unique challenges are presented by the data in this field.
Fall  CSCI2952G  S01  17505  TTh  1:002:20(06)  (R. Singh) 
CSCI 2952H. Recent Progress in Reinforcement Learning.
Reinforcement learning is a framework for studying machines that interact with a sequential environment to achieve a goal. In the past decade, the RL framework has gained a lot of attention owing to its intriguing success in solving problems in complicated domains such as games, robotics, and dialog systems. We observe continual growth in the number of RL papers published in major machinelearning conferences. This growth calls for a careful investigation of the recent progress in the field. By reading selections of the current RL literature, this graduatelevel course examines some of the latest theoretical and empirical progress in the field.
CSCI 2952I. Language Processing in Humans and Machines.
Understanding language requires transforming sequences of sounds into words, combining words into meaningful thoughts, and incorporating thoughts into an ongoing discourse. Psychologists and linguists have been trying to reverseengineer how humans do this so easily, at the speed of conversation. In parallel, computer scientists have been trying to engineer machines to solve the same problems, leading to products like Siri and Alexa. This class will explore how these two kinds of research can help each other, bringing recent insights from machine learning into the study of human language processing, and insights from human processing into the architectures of machine language systems. For CS students: Machine Learning, Deep Learning, Computational Linguistics (or comparable experience). For CLPS students: At least one of CLPS 0200, 0300, 0800, or 1800
CSCI 2952K. Topics in 3D Computer Vision and Deep Learning.
We live in a world that spans 3 dimensions. Cameras and sensors image the 3D world by projecting to a 2D plane. How can we recover the 3D world back from these images? What techniques can we use to process 3D data? In this course we will study computer vision and machine learning techniques to recover 3D information of the world from images, and process and understand 3D data. We will learn about classical computer vision techniques but focus on cuttingedge deep learning methods. The techniques we will study are widely used, for instance, in selfdriving cars and smartphone AR face filter apps.
CSCI 2952N. Advanced Topics in Deep Learning.
Prepares graduate students with the knowledge they need to apply Deep Learning techniques for their own research. There has been tremendous success in developing unified neural architectures that achieve stateoftheart performance on language understanding (GPT3), visual perception (ViT), and even protein structure prediction (AlphaFold). We plan to understand how they work, and how the success of such unified models can give rise to further developments on selfsupervised learning, a technique that trains machine learning models without requiring labeled data; and multimodal learning, a technique that utilizes multiple input sources, such as vision, audio, and text. We will study recent attempts to interpret these models, thus revealing potential risks on model bias. Paper reading, student presentations, and invited guest lectures. Students required to work on a final project that explores a novel direction along the line of the papers we cover.
CSCI 2952O. A Practical Introduction to Advanced 3D Robot Perception.
This course is aimed at preparing graduate students and senior undergrads to do advanced work at the intersection of two important and popular fields: computer vision and robotics. The course will focus on the latest advances through lectures, readings, and discussion groups. The lectures and readings will be designed to represent a mix of classical techniques as well as the most recent advances in the two fields. The unique highlight of this course is the inclusion of a practical component: students will implement a project that combines computer vision and robotics by using cameras and a real robot arm. Students will form teams for this project and have exclusive access to a camera and a small robot arm both of which can be interfaced with the students' laptops. Prereqs: One of CSCI 1430, CSCI 1470, CSCI 1951R, CSCI 1230.
CSCI 2952P. Coordinated Mobile Robotics (ENGN 2912U).
Interested students must register for ENGN 2912U.
CSCI 2952Q. Robust Algorithms for Machine Learning.
As machine learning systems start to make more important decisions in our society, we need learning algorithms that are reliable and robust. In this course, we will (1) cover basic tools in linear algebra, matrix calculus, and statistics that are useful in theoretical machine learning, (2) explore different adversarial models and examine whether existing algorithms are robust in these models, and (3) design and analyze provably robust algorithms for fundamental tasks in machine learning. In particular, we will focus on the research areas of highdimensional robust statistics, nonconvex optimization, learning with strategic agents, and spectral graph theory. This is a researchoriented course where students are asked to read and present sophisticated papers in top machine learning conferences. Knowledge of basic linear algebra, algorithms, data structures, probability and statistics is essential. Prior experience with machine learning is required.
Fall  CSCI2952Q  S01  19362  M  3:005:30(03)  (Y. Cheng) 
CSCI 2952S. Topics in Cyber and Digital Policy.
This online asynchronous course explores advanced topics in cybersecurity and digital policy, including privacy and civil liberties. Research papers and/or projects will provide an opportunity for creative work. Topics may include public policy and the international aspects of cybersecurity, legislation and legal requirements concerning digital policy issues, the history and background of privacy and civil liberties in information and information systems, cyber conflict, and related subjects.
There is no set class time. Students and the instructor will coordinate work online and over Zoom through periodic meetings.
CSCI 1800, 1860, 1805, 1870 or equivalent background is a prerequisite. Instructor permission required.
Spr  CSCI2952S  S01  26683  Arranged  (T. Edgar) 
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 the world's flowers, focusing on both the sellers' and buyers' decisionmaking processes. More generally, we'll research ways to automate and optimize decisionmaking in timecritical, informationrich environments, like the DFA. Undergraduate students require instructor permission, and should have already completed CSCI 0190, or CSCI 0150 and CSCI 0160, or CSCI 0170 and CSCI 0180.
CSCI 2956A. Design of Agents for Bidding in Sponsored Search Autions.
This course investigates the new field of sponsored search auctions. Although students will be exposed to the field from the point of view of both the search engine and the advertiser, the course's focus is on advertiser's bidding algorithms. The students will implement novel bidding agents, and the course will culminate in a competition among the students' agents. Undergraduate students who obtained permission from the instructor or completed CSCI 0910, or CSCI 0150 and CSCI 0160, or CSCI 0170 and CSCI 0180 can register for the course. CSCI 1410 is a corequisite.
CSCI 2956R. MultiplicativeWeights/PackingCovering Method for Approximating Linear and Semidefinite Programs.
We will study the method called, variously, multiplicative weights and packingcovering. We will in particular investigate the use of this method for finding approximately optimal solutions to linear programs and semidefinite programs. Prerequisite: A graduatelevel course on algorithms. Enrollment limited to 10. Instructor permission required.
CSCI 2980. Reading and Research.
Section numbers vary by instructor. Please check Banner for the correct section number and CRN to use when registering for this course.
CSCI 2990. Thesis Preparation.
For graduate students who have met the residency requirement and are continuing research on a full time basis.
Fall  CSCI2990  S01  16100  Arranged  'To Be Arranged'  
Spr  CSCI2990  S01  24853  Arranged  'To Be Arranged' 
CSCI XLIST. Courses of Interest to Concentrators in Computer Science.
Computer Science
Computer science is now a critical tool for pursuing an everbroadening range of topics, from outer space to the workings of the human mind. In most areas of science and in many liberal arts fields, cuttingedge work depends increasingly on computational approaches. The undergraduate program at Brown is designed to combine breadth in practical and theoretical computer science with depth in specialized areas. These areas range from traditional topics, such as analysis of algorithms, artificial intelligence, databases, distributed systems, graphics, mobile computing, networks, operating systems, programming languages, robotics and security, to novel areas including games and scientific visualization.
Our requirements are built on a collection of pathways, each representing a welldefined area within computer science. Concentrators interested in particular areas can choose the courses included in particular pathways. Conversely, concentrators who are unsure of their area of interest but who have particularly enjoyed certain courses can choose pathways that include these concentrations. Students may not use more than two CSCI 1970 courses to complete the requirements for the Sc.B. and one CSCI 1970 course for the A.B. requirements.
For uptodate information on our concentration requirements please see https://cs.brown.edu/degrees/undergrad/concentratingincs/concentrationrequirements2020/newscbrequirements/ for ScB requirements and https://cs.brown.edu/degrees/undergrad/concentratingincs/concentrationrequirements2020/newabrequirements/ for AB requirements. Please see https://cs.brown.edu/degrees/undergrad/concentratingincs/concentrationhandbook/ for further discussion regarding our concentration requirements.
Requirements for the Standard Track of the Sc.B. degree
Prerequisites (03 courses)  
Calculus prerequisite: students must complete or place out of second semester calculus.  03  
Single Variable Calculus, Part II  
or MATH 0170  Single Variable Calculus, Part II (Accelerated)  
or MATH 0190  Single Variable Calculus, Part II (Physics/Engineering)  
Concentration Requirements  
CoreComputer Science:  
Select one of the following introductory course Series:  2  
Series A  
Introduction to ObjectOriented Programming and Computer Science and Program Design with Data Structures and Algorithms  
Series B  
Computer Science: An Integrated Introduction and Program Design with Data Structures and Algorithms  
Series C  
Accelerated Introduction to Computer Science (and an additional CS course not otherwise used to satisfy a concentration requirement; this course may be CSCI 0200, an intermediatelevel course, or an advanced course)  
Series D ^{1}  
Computing Foundations: Data and Computing Foundations: Program Organization and Program Design with Data Structures and Algorithms  
Thirteen more advanced courses.  13  
♦︎ Two complete pathways (at least one core course from each)  
⚬ Each requires two 1000level courses as well as onetothree intermediate courses  
⚬ One of the courses used in one pathway must be a capstone course (defined below) ^{2}  
⚬ The core and related courses used in one pathway may not overlap with those used in another  
⚬ 2000level courses beyond those explicitly mentioned may also be used toward the concentration. They will be considered to be part of the same pathway as their thematicallyrelated 1000level courses  
♦︎ Additional intermediate courses so that a total of five are taken, with at least one from each of the three categories  
♦︎ One additional 1000level course that is neither a core nor a related nor a graduate course for the pathways used above  
♦︎ No more than four arts, humanities, and social science oriented CS courses (currently CSCI 1250, 1280, 1370, 1800, 1805, and 1870) may be used for concentration credit.  
Intermediate Courses  
ScB students must take at least one course from each intermediate course category to ensure they span all areas. In addition, they must take whatever intermediate courses they haven't yet taken that are required for their pathways.  
Foundations  
Introduction to Discrete Structures and Probability  
or MATH 1001  The Art of Writing Mathematics  
or MATH 1530  Abstract Algebra  
Theory of Computation  
Mathematics  
Coding the Matrix: An Introduction to Linear Algebra for Computer Science  
or MATH 0520  Linear Algebra  
or MATH 0540  Linear Algebra With Theory  
Advanced Introduction to Probability for Computing and Data Science  
or APMA 1650  Statistical Inference I  
or APMA 1655  Honors Statistical Inference I  
Multivariable Calculus  
or MATH 0200  Multivariable Calculus (Physics/Engineering)  
or MATH 0350  Multivariable Calculus With Theory  
Systems  
Introduction to Software Engineering  
Introduction to Computer Systems  
or CSCI 0300  Fundamentals of Computer Systems  
Pathways  
Completing a pathway entails taking two courses in the pathway of which at least one is a core course for the pathway. One must also take the intermediate courses specified as part of the pathway. Certain graduate courses can also satisfy pathway requirements, see the CS Pathway page for more info:http://cs.brown.edu/degrees/undergrad/concentratingincs/concentrationhandbook/  
SYSTEMS: studies the design, construction, and analysis of modern, multifaceted computing systems  
Core Courses  
Distributed Computer Systems  
or CSCI 1670  Operating Systems  
or CSCI 1680  Computer Networks  
Related Courses  
Compilers and Program Analysis  
Database Management Systems  
or CSCI 1320  Creating Modern Web & Mobile Applications  
or CSCI 1600  RealTime and Embedded Software  
or CSCI 1650  Software Security and Exploitation  
or CSCI 1660  Introduction to Computer Systems Security  
or CSCI 1710  Logic for Systems  
or CSCI 1730  Design and Implementation of Programming Languages  
or CSCI 1760  Multiprocessor Synchronization  
or ENGN 1640  Design of Computing Systems  
Intermediate Courses  
Fundamentals of Computer Systems  
or CSCI 0330  Introduction to Computer Systems  
Introduction to Discrete Structures and Probability  
SOFTWARE PRINCIPLES: studies the design, construction, and analysis of modern software systems  
Core Courses  
Compilers and Program Analysis  
or CSCI 1320  Creating Modern Web & Mobile Applications  
or CSCI 1600  RealTime and Embedded Software  
or CSCI 1710  Logic for Systems  
or CSCI 1730  Design and Implementation of Programming Languages  
Related Courses  
Database Management Systems  
or CSCI 1380  Distributed Computer Systems  
or CSCI 1650  Software Security and Exploitation  
or CSCI 1680  Computer Networks  
or CSCI 1951I  CS for Social Change  
or CSCI 1951T  Surveying VR Data Visualization Software for Research  
or CSCI 1951X  Formal Proof and Verification  
Intermediate Courses  
Introduction to Discrete Structures and Probability  
Introduction to Software Engineering  
Introduction to Computer Systems (Data)  
or CSCI 0300  Fundamentals of Computer Systems  
DATA: Studies the management and use of large data collections  
Core Courses  
Database Management Systems  
or CSCI 1420  Machine Learning  
or CSCI 1951A  Data Science  
Related Courses  
Probabilistic Methods in Computer Science  
Intermediate Courses  
Introduction to Software Engineering  
or CSCI 0330  Introduction to Computer Systems  
or CSCI 0300  Fundamentals of Computer Systems  
Linear Algebra  
or MATH 0540  Linear Algebra With Theory  
or CSCI 0530  Coding the Matrix: An Introduction to Linear Algebra for Computer Science  
Advanced Introduction to Probability for Computing and Data Science  
or APMA 1650  Statistical Inference I  
or APMA 1655  Honors Statistical Inference I  
ARTIFICIAL INTELLIGENCE / MACHINE LEARNING: studies the theory and application of algorithms for making decisions and inferences from rules and data  
Core Courses  
Artificial Intelligence  
or CSCI 1420  Machine Learning  
or CSCI 1430  Computer Vision  
or CSCI 1460  Computational Linguistics  
or CSCI 1470  Deep Learning  
or CSCI 1850  Deep Learning in Genomics  
or CSCI 1951R  Introduction to Robotics  
Related Courses  
Algorithmic Game Theory  
or CSCI 1550  Probabilistic Methods in Computer Science  
or CSCI 1951A  Data Science  
or CSCI 1951C  Designing Humanity Centered Technology  
or APMA 1740  Recent Applications of Probability and Statistics  
or ENGN 1610  Image Understanding  
Intermediate Courses  
Advanced Introduction to Probability for Computing and Data Science  
or APMA 1650  Statistical Inference I  
or APMA 1655  Honors Statistical Inference I  
Linear Algebra  
or MATH 0540  Linear Algebra With Theory  
or CSCI 0530  Coding the Matrix: An Introduction to Linear Algebra for Computer Science  
THEORY: students the foundations of models and algorithms for computing in various contexts  
Core Courses  
Introduction to Cryptography and Computer Security  
or CSCI 1550  Probabilistic Methods in Computer Science  
or CSCI 1570  Design and Analysis of Algorithms  
or CSCI 1760  Multiprocessor Synchronization  
or CSCI 1951W  Sublinear Algorithms for Big Data  
or CSCI 1951X  Formal Proof and Verification  
Related Courses  
Algorithmic Game Theory  
or CSCI 1550  Probabilistic Methods in Computer Science  
or CSCI 1710  Logic for Systems  
or CSCI 1810  Computational Molecular Biology  
or CSCI 1820  Algorithmic Foundations of Computational Biology  
or CSCI 1950H  Computational Topology  
or CSCI 1951G  Optimization Methods in Finance  
Introduction to Computational Complexity  
or CSCI 1710  Logic for Systems  
or CSCI 1810  Computational Molecular Biology  
or CSCI 1820  Algorithmic Foundations of Computational Biology  
or CSCI 1950H  Computational Topology  
or CSCI 1951G  Optimization Methods in Finance  
Intermediate Courses  
Theory of Computation  
Advanced Introduction to Probability for Computing and Data Science  
or APMA 1650  Statistical Inference I  
or APMA 1655  Honors Statistical Inference I  
Linear Algebra  
or MATH 0540  Linear Algebra With Theory  
or CSCI 0530  Coding the Matrix: An Introduction to Linear Algebra for Computer Science  
SECURITY: studies the design, construction, analysis, and defense of techniques to protect systems, data, and communications  
Core Courses  
Introduction to Cryptography and Computer Security  
or CSCI 1650  Software Security and Exploitation  
or CSCI 1660  Introduction to Computer Systems Security  
Related Courses  
Creating Modern Web & Mobile Applications  
or CSCI 1380  Distributed Computer Systems  
or CSCI 1670  Operating Systems  
or CSCI 1680  Computer Networks  
or CSCI 1710  Logic for Systems  
or CSCI 1730  Design and Implementation of Programming Languages  
or CSCI 1800  Cybersecurity and International Relations  
or CSCI 1805  Computers, Freedom and Privacy  
or CSCI 1951L  Blockchains and Cryptocurrencies  
Intermediate Courses  
Introduction to Computer Systems  
or CSCI 0300  Fundamentals of Computer Systems  
Introduction to Discrete Structures and Probability (Or Probability and Statistics (see options below))  
or CSCI 1450  Advanced Introduction to Probability for Computing and Data Science  
or APMA 1650  Statistical Inference I  
or APMA 1655  Honors Statistical Inference I  
VISUAL COMPUTING: studies the creation, interaction, and analysis of images and visual information, including animation and games  
Core Courses  
Introduction to Computer Graphics  
or CSCI 1250  Introduction to Computer Animation  
or CSCI 1280  Intermediate 3D Computer Animation  
or CSCI 1290  Computational Photography  
or CSCI 1300  User Interfaces and User Experience  
or CSCI 1370  Virtual Reality Design for Science  
or CSCI 1430  Computer Vision  
or CSCI 1950T  Advanced Animation Production  
or CSCI 1951T  Surveying VR Data Visualization Software for Research  
Related Courses  
2D Game Engines  
or CSCI 1470  Deep Learning  
or CSCI 1950N  2D Game Engines  
or CSCI 1950U  Topics in 3D Game Engine Development  
or CSCI 1951V  Hypertext/Hypermedia: The Web Was Not the Beginning and the Web Is Not the End  
or CLPS 1520  Computational Vision  
Intermediate Courses  
Introduction to Software Engineering  
or CSCI 0330  Introduction to Computer Systems  
Linear Algebra  
or MATH 0540  Linear Algebra With Theory  
or CSCI 0530  Coding the Matrix: An Introduction to Linear Algebra for Computer Science  
COMPUTER ARCHITECTURE: studies the design, construction, and analysis of computer architecture and hardware  
Core Courses  
Digital Electronics Systems Design  
or ENGN 1640  Design of Computing Systems  
or ENGN 1650  Embedded Microprocessor Design  
Related Courses  
RealTime and Embedded Software  
or CSCI 1760  Multiprocessor Synchronization  
or ENGN 1600  Design and Implementation of Digital Integrated Circuits  
Intermediate Course  
Introduction to Computer Systems  
or CSCI 0300  Fundamentals of Computer Systems  
COMPUTATIONAL BIOLOGY: studies the foundations and applications of algorithms for analyzing biological data and processes  
Core Courses  
Computational Molecular Biology  
or CSCI 1820  Algorithmic Foundations of Computational Biology  
or CSCI 1850  Deep Learning in Genomics  
Related Courses  
Machine Learning  
or CSCI 1430  Computer Vision  
or CSCI 1470  Deep Learning  
or CSCI 1951A  Data Science  
or CLPS 1520  Computational Vision  
Intermediate Courses  
Introduction to Discrete Structures and Probability  
Theory of Computation  
Advanced Introduction to Probability for Computing and Data Science  
or APMA 1650  Statistical Inference I  
or APMA 1655  Honors Statistical Inference I  
DESIGN: studies the design, construction, and analysis of processes at the interface between humans and systems  
Core Courses  
User Interfaces and User Experience  
or CSCI 1370  Virtual Reality Design for Science  
or CSCI 1951C  Designing Humanity Centered Technology  
Related Courses  
Introduction to Computer Graphics  
or CSCI 1320  Creating Modern Web & Mobile Applications  
or CSCI 1360  Human Factors in Cybersecurity  
or CSCI 1600  RealTime and Embedded Software  
or CSCI 1951A  Data Science  
or CSCI 1951I  CS for Social Change  
or CSCI 1951T  Surveying VR Data Visualization Software for Research  
or CSCI 1951V  Hypertext/Hypermedia: The Web Was Not the Beginning and the Web Is Not the End  
or CSCI 1952B  Responsible Computer Science in Practice  
or ENGN 1931I  Design of Robotic Systems  
or VISA 1720  Physical Computing  
Intermediate Courses  
Fundamentals of Computer Systems  
or CSCI 0320  Introduction to Software Engineering  
or CSCI 0330  Introduction to Computer Systems  
Advanced Introduction to Probability for Computing and Data Science  
or APMA 1650  Statistical Inference I  
or APMA 1655  Honors Statistical Inference I  
SELFDESIGNED: This pathway is modeled after the Brown programs for designing one’s own concentration. Students electing this pathway must write a proposal for their pathway and have it approved by an advisor and the director of undergraduate studies. The proposal must meet the breadth and overall course requirements. This must be done by the end of shopping period of the student’s seventh semester. 
^{1}  Students wishing to go directly from CSCI 0111 to CSCI 0200 (without CSCI 0112) will need to successfully complete additional exercises to receive an instructor override code for CSCI 0200. 
^{2}  Capstone: a onesemester course, taken in the student's last undergraduate year, in which the student (or group of students) use a significant portion of their undergraduate education, broadly interpreted, in studying some current topic in depth, to produce a culminating artifact such as a paper or software project. 
^{3}  Certain 1000level courses may be used to fill the additional 1000level course requirements for both the AB and ScB. No more than one such course may be used for the AB concentration and no more than three for the ScB concentration. A list of approved nonCS courses is on our web page. Unless explicitly stated on our web page, such nonCS courses may not be used as part of pathways. 
Requirements for the Standard Track of the A.B. degree
Prerequisites (03 courses)  03  
Students must complete or place out of second semester calculus.  
Single Variable Calculus, Part II  
or MATH 0170  Single Variable Calculus, Part II (Accelerated)  
or MATH 0190  Single Variable Calculus, Part II (Physics/Engineering)  
Concentration Requirements (9 courses)  
Core Computer Science:  
Select one of the following series:  2  
Series A  
Introduction to ObjectOriented Programming and Computer Science and Program Design with Data Structures and Algorithms  
Series B  
Computer Science: An Integrated Introduction and Program Design with Data Structures and Algorithms  
Series C  
Accelerated Introduction to Computer Science (and an additional CS course not otherwise used to satisfy a concentration requirement; this course may be CSCI 0200, an intermediatelevel course, or an advanced course)  
Series D ^{1}  
Computing Foundations: Data and Computing Foundations: Program Organization and Program Design with Data Structures and Algorithms  
Seven more advanced courses.  7  
♦︎ One complete pathway (see ScB for pathways)  
Requires two 1000level courses as well as onetothree intermediate courses  
♦︎ Additional intermediate courses so that a total of three are taken with at least one in each of two different intermediatecourse categories (see the ScB requirements for a listing of these categories)  
♦︎ One additional 1000level course that is neither a core nor a related course for the pathways used above  
♦︎ Of the remaining two courses, at least one must be at the 1000level or higher (i.e., one may be an intermediate course not otherwise used as part of the concentration). One course may be an approved 1000level course from another department. Unless explicitly stated in a pathway, such nonCS courses may not be used as part of pathways.  
♦︎ No more than two arts, humanities, and social science oriented CS courses (currently CSCI 1250, 1280, 1370, 1800, 1805, and 1870) may be used for concentration credit. 
^{1}  Students wishing to go directly from CSCI 0111 to CSCI 0200 (without CSCI 0112) will need to successfully complete additional exercises to receive an instructor override code for CSCI 0200. 
Requirements for the Professional Track of the both the Sc. B. and A.B. degrees.
The requirements for the professional track include all those of the standard track, as well as the following:
Students must complete fulltime professional experiences doing work that is related to their concentration programs, totaling 26 months, whereby each internship must be at least one month in duration in cases where students choose to do more than one internship experience. Such work is normally done at a company, but may also be at a university under the supervision of a faculty member. Internships that take place between the end of the fall and the start of the spring semesters cannot be used to fulfill this requirement.
On completion of each professional experience, the student must write and upload to ASK a reflective essay about the experience addressing the following 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 embarking on your summer experience? What are the topics from these courses that would have helped you over the summer if you had been more familiar with them?
 Are there topics you should have been familiar with in preparation for your summer experience, but are not taught at Brown? What are these topics?
 What did you learn from the experience that probably could not have been picked up from course work?
 Is the sort of work you did over the summer something you would like to continue doing once you graduate? Explain.
 Would you recommend your summer experience to other Brown students? Explain.
Honors
Honors candidates must have earned A's or Swithdistinction in 2/3 (rounding up) of the courses used towards the concentration, excluding introductorysequence courses (CS courses numbered 0200 or below) and the calculus prerequisite (unless that course is also used as an intermediate math course in CS requirements).
Computer ScienceEconomics
The joint Computer ScienceEconomics concentration exposes students to the theoretical and practical connections between computer science and economics. It prepares students for professional careers that incorporate aspects of economics and computer technology and for academic careers conducting research in areas that emphasize the overlap between the two fields. Concentrators may choose to pursue either the A.B. or the Sc.B. degree. While the A.B. degree allows students to explore the two disciplines by taking advanced courses in both departments, its smaller number of required courses is compatible with a liberal education. The Sc.B. degree achieves greater depth in both computer science and economics by requiring more courses, and it offers students the opportunity to creatively integrate both disciplines through a design requirement. If you are interested in declaring a concentration in Computer ScienceEconomics, please refer to this page for more information regarding the process. For more information about the CS Pathways, see this page.
Standard Program for the Sc.B. degree.
Prerequisites (3 courses):  
Single Variable Calculus, Part II  
Linear Algebra  
or MATH 0540  Linear Algebra With Theory  
or CSCI 0530  Coding the Matrix: An Introduction to Linear Algebra for Computer Science  
Principles of Economics  
Required Courses: 17 courses: 8 Computer Science, 8 Economics, and a Capstone  
CSCI 1450  Advanced Introduction to Probability for Computing and Data Science ^{1}  1 
or APMA 1650  Statistical Inference I  
or APMA 1655  Honors Statistical Inference I  
Select one of the following Series:  2  
Series A  
Introduction to ObjectOriented Programming and Computer Science and Program Design with Data Structures and Algorithms  
Series B  
Computer Science: An Integrated Introduction and Program Design with Data Structures and Algorithms  
Series C  
Accelerated Introduction to Computer Science (and an additional CS course not otherwise used to satisfy a concentration requirement; this course may be CSCI 0200, an intermediatelevel CS course, or a 1000level course.)  
Series D  
Computing Foundations: Data and Computing Foundations: Program Organization and Program Design with Data Structures and Algorithms  
Two of the following intermediate courses, one of which must be mathoriented and one systemsoriented.  2  
Introduction to Discrete Structures and Probability (math)  
Introduction to Software Engineering (systems)  
Introduction to Computer Systems (systems)  
or CSCI 0300  Fundamentals of Computer Systems  
Theory of Computation (math) ^{2}  
A pair of 1000level CS courses that, along with the intermediate courses and math courses, satisfy one of the CS Pathways, as described for the CSCI ScB. ^{3}  2  
An additional CS course that is either at the 1000level or is an intermediate course not already used to satisfy concentration requirements. CSCI 1450 may not be used to satisfy this requirement.  1  
ECON 1130  Intermediate Microeconomics (Mathematical) ^{4}  1 
ECON 1210  Intermediate Macroeconomics  1 
ECON 1630  Mathematical Econometrics I  1 
Three courses from the "mathematical economics" group (CSCI 1951K can be counted as one of them, if it has not been used to satisfy the computer science requirements of the concentration and if the student has taken either ECON 1470 or ECON 1870):  3  
Welfare Economics and Social Choice Theory  
Advanced Macroeconomics: Monetary, Fiscal, and Stabilization Policies  
Unemployment: Models and Policies  
Bargaining Theory and Applications  
Designing Internet Marketplaces  
Topics in Macroeconomics, Development and International Economics  
Mathematical Econometrics II  
Big Data  
Advanced Topics in Econometrics  
Machine Learning, Text Analysis, and Economics  
Investments II  
Economics in the Laboratory  
Theory of Behavioral Economics  
Theory of Economic Growth  
The Theory of General Equilibrium  
Game Theory and Applications to Economics  
Two additional 1000level Economics courses excluding 1620, 1960, 1970 ^{5}  2  
One capstone course in either CS or Economics: a onesemester course, normally taken in the student's last semester undergraduate 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 at the intersection of computer science and economics) in depth, to produce a culminating artifact such as a paper or software project. A senior thesis, which involved two semesters of work, may count as a capstone.  1  
Total Credits  17 
^{1}  APMA 1650 or APMA 1655 may be used in place of CSCI 1450 in CS pathway requirements. However, concentration credit will be given for only one of APMA 1650, APMA 1655, and CSCI 1450. 
^{2}  CSCI 1010 may be used either as a mathoriented intermediate course or as an advanced course. CSCI 1010 was formerly known as CSCI 0510: They are the same course and hence only one may be taken for credit. 
^{3}  CS Pathways can be found on the Pathways page. 
^{4}  Or ECON 1110 with permission. For students matriculating at Brown in Fall 2021 or later, note that if ECON 1110 is used, then one additional course from the mathematicaleconomics group will be required 
^{5}  Students may apply, at most, one Economics course whose number is in the range of 1000 to 1099 toward the concentration. Note that ECON 1620, ECON 1960, and ECON 1970 (independent study) cannot be used for concentration credit. However, 1620 and 1960 can be used for university credit and up to two 1970s may be used for university credit. 
Standard Program for the A.B. degree:
Prerequisites (3 courses):  
Single Variable Calculus, Part II  
Linear Algebra  
or MATH 0540  Linear Algebra With Theory  
or CSCI 0530  Coding the Matrix: An Introduction to Linear Algebra for Computer Science  
Principles of Economics  
Required Courses: 13 courses: 7 Computer Science and 6 Economics  
CSCI 1450  Advanced Introduction to Probability for Computing and Data Science  1 
or APMA 1650  Statistical Inference I  
or APMA 1655  Honors Statistical Inference I  
Select one of the following series:  2  
Series A  
Introduction to ObjectOriented Programming and Computer Science and Introduction to Algorithms and Data Structures  
Series B  
Computer Science: An Integrated Introduction and Computer Science: An Integrated Introduction  
Series C  
Accelerated Introduction to Computer Science (and an additional CS course not otherwise used to satisfy a concentration requirement; this course may be CSCI 0200, an intermediatelevel course, or a 1000level course)  
Series D  
Computing Foundations: Data and Computer Science: An Integrated Introduction  
Two of the following intermediate courses, one of which must be mathoriented and one systemsoriented:  2  
Introduction to Discrete Structures and Probability (math)  
Introduction to Software Engineering (systems)  
Introduction to Computer Systems (systems)  
or CSCI 0300  Fundamentals of Computer Systems  
Theory of Computation (math)  
Two additional CS courses; at least one must be at the 1000level. The other must either be at the 1000level or be an intermediate course not already used to satisfy concentration requirements. CSCI 1450 may not be used to satisfy this requirement.  2  
ECON 1130  Intermediate Microeconomics (Mathematical) ^{1}  1 
ECON 1210  Intermediate Macroeconomics  1 
ECON 1630  Mathematical Econometrics I  1 
Three courses from the "mathematicaleconomics" group: ^{2}  3  
Welfare Economics and Social Choice Theory  
Advanced Macroeconomics: Monetary, Fiscal, and Stabilization Policies  
Unemployment: Models and Policies  
Bargaining Theory and Applications  
Designing Internet Marketplaces  
Topics in Macroeconomics, Development and International Economics  
Mathematical Econometrics II  
Big Data  
Advanced Topics in Econometrics  
Machine Learning, Text Analysis, and Economics  
Investments II  
Economics in the Laboratory  
Theory of Behavioral Economics  
Theory of Economic Growth  
The Theory of General Equilibrium  
Game Theory and Applications to Economics  
or any graduate Economics course ^{3}  
Total Credits  13 
^{1}  Or ECON 1110 with permission. For students matriculating at Brown in Fall 2021 or later, note that if ECON 1110 is used, then one additional course from the mathematicaleconomics group will be required 
^{2}  CSCI 1951K can be counted as one of them, if it has not been used to satisfy the computer science requirements of the concentration and if the student has taken either ECON 1470 or ECON 1870. 
^{3}  Note that ECON 1620, ECON 1960, and ECON 1970 (independent study) cannot be used for concentration credit. However, 1620 and 1960 can be used for university credit and up to two 1970s may be used for university credit. 
Honors
Students who meet stated requirements are eligible to write an honors thesis in their senior year. Students should consult the listed honors requirements of whichever of the two departments their primary thesis advisor belongs to, at the respective departments' websites. If the primary thesis advisor belongs to Economics (Computer Science), then students must have a reader in the Computer Science (respectively, Economics) department.
Professional Track
The requirements for the professional track include all those of the standard track, as well as the following:
Students must complete fulltime professional experiences doing work that is related to their concentration programs, totaling 26 months, whereby each internship must be at least one month in duration in cases where students choose to do more than one internship experience. Such work is normally done at a company, but may also be at a university under the supervision of a faculty member. Internships that take place between the end of the fall and the start of the spring semesters cannot be used to fulfill this requirement.
On completion of each professional experience, the student must write and upload to ASK a reflective essay about the experience addressing the following 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 embarking on your summer experience? What are the topics from these courses that would have helped you over the summer if you had been more familiar with them?
 Are there topics you should have been familiar with in preparation for your summer experience, but are not taught at Brown? What are these topics?
 What did you learn from the experience that probably could not have been picked up from course work?
 Is the sort of work you did over the summer something you would like to continue doing once you graduate? Explain.
 Would you recommend your summer experience to other Brown students? Explain.
Applied MathematicsComputer Science
The Sc.B. concentration in Applied MathComputer Science provides a foundation of basic concepts and methodology of mathematical analysis and computation and prepares students for advanced work in applied mathematics, computer science, and data science. Concentrators must complete courses in mathematics, applied math, computer science, and an approved English writing course. While the concentration in Applied MathComputer Science allows students to develop the use of quantitative methods in thinking about and solving problems, knowledge that is valuable in all walks of life, students who have completed the concentration have pursued graduate study, computer consulting and information industries, and scientific and statistical analysis careers in industry or government. This degree offers a standard track and a professional track.
Standard Program for the Sc.B. degree.
Prerequisites – the equivalent of two semesters of singlevariable calculus  
Requirements – 17 courses ^{1,2}  
Completion of one CS pathway ^{3}  
Completion of one APMA pairing ^{4}  
Mathematical Requirements – 8 courses  
MATH 0180  Multivariable Calculus  1 
or MATH 0200  Multivariable Calculus (Physics/Engineering)  
or MATH 0350  Multivariable Calculus With Theory  
MATH 0520  Linear Algebra  1 
or MATH 0540  Linear Algebra With Theory  
or CSCI 0530  Coding the Matrix: An Introduction to Linear Algebra for Computer Science  
or APMA 1170  Introduction to Computational Linear Algebra  
APMA 0350  Applied Ordinary Differential Equations ^{5}  1 
APMA 0360  Applied Partial Differential Equations I ^{6}  1 
APMA 1160  An Introduction to Numerical Optimization  1 
or APMA 1170  Introduction to Computational Linear Algebra  
or APMA 1180  Introduction to Numerical Solution of Differential Equations  
or APMA 1690  Computational Probability and Statistics  
or APMA 1740  Recent Applications of Probability and Statistics  
Two approved 1000level or higher APMA courses. The APMA pairing must be completed. ^{4,7}  2  
One 1000level or higher APMA or MATH course ^{7}  1  
Computer Science Requirements – 8 courses ^{2}  
Select one of the following introductory course sequences  2  
Introduction to ObjectOriented Programming and Computer Science and Program Design with Data Structures and Algorithms  
Computer Science: An Integrated Introduction and Program Design with Data Structures and Algorithms  
Computing Foundations: Data and Program Design with Data Structures and Algorithms ^{2}  
Select three of the following five intermediatelevel options, one of which must be mathoriented and one systemsoriented. The intermediate requirements of the chosen pathway must be completed. ^{3}  3  
Introduction to Discrete Structures and Probability (math)  
or MATH 1001  The Art of Writing Mathematics  
or MATH 1530  Abstract Algebra  
Theory of Computation (math)  
Honors Statistical Inference I (math ) ^{8}  
or APMA 1650  Statistical Inference I  
or CSCI 1450  Advanced Introduction to Probability for Computing and Data Science  
or MATH 1620  Mathematical Statistics  
Introduction to Software Engineering (systems)  
Introduction to Computer Systems (systems) ^{9}  
or CSCI 0300  Fundamentals of Computer Systems  
Three approved 1000level or higher CSCI courses. The advanced requirements of the chosen pathway must be completed. ^{3,10}  3  
Additional Requirements – 1 course  1  
One approved capstone in computer science or applied mathematics taken in the student’s senior year. ^{11}  
Total Credits  17 
^{1}  A required course may be replaced by a more advanced course with concentration advisor approval. No course may be used to satisfy more than one of the required 17 concentration credits. Transfer credits and courses receiving placement credit notation can satisfy concentration credit as long as they appear on the Brown internal transcript. At most 3 postmatriculation transfer credits (such as study abroad courses or summer courses at another institution) can be used for concentration credit. Pursuing honors will require 18 courses – these 17 along with two semesters of independent study courses for the honors research project, one of which can be used to satisfy the capstone concentration requirement. 
^{2}  Students who take the CSCI 0111, CSCI 0112, CSCI 0200 sequence will effectively need an additional course (CSCI 0112) to complete the concentration. Students wishing to go directly from CSCI 0111 to CSCI 0200 (without CSCI 0112) will need to successfully complete additional exercises to receive an instructor override code for CSCI 0200. 
^{3}  CS pathways are described in the bulletin for the CS concentration at this link and also on the CS website at this link. To complete a pathway students must complete one core CSCI course, one additional core, related, or graduate CSCI course, and all of the intermediate courses for that pathway. These courses can appear anywhere in the declaration. NonCSCI courses are not allowed, even if they are approved as part of a CS pathway or allowed as part of a pure CS concentration. 
^{4}  To complete an APMA pairing, students must complete two 1000level or higher APMA courses that adhere to a common theme. These courses can appear anywhere in the declaration. APMA 1910, APMA 1920 and research/independent study courses are not allowed. Themes can be broadly defined and are subject to concentration advisor approval. Examples include:

^{5}  APMA 0330 or MATH 1110 may be used in place of APMA 0350. If MATH 1110 is used, then the concentration must include at least four 1000level APMA courses (not including APMA 1910, APMA 1920 or research/independent study courses). 
^{6}  APMA 0340 or MATH 1120 may be used in place of APMA 0360. If MATH 1120 is used, then the concentration must include at least four 1000level APMA courses (not including APMA 1910, APMA 1920 or research/independent study courses). 
^{7}  APMA 1910, APMA 1920 and research/independent study courses are not allowed. 
^{8}  APMA 1655 is recommended. At most one of APMA 1650, APMA 1655, CSCI 1450, MATH 1610, MATH 1620 can be used for concentration credit. Note that MATH 1610 is a prerequisite for MATH 1620, so if MATH 1620 is used, the presumption is that MATH 1610 or the equivalent has also been taken (but only one can be used for concentration credit). 
^{9}  At most one of CSCI 0300 and CSCI 0330 can be used for concentration credit. 
^{10}  At most one arts, humanities, or social science CS course can be used for concentration credit (currently CSCI 1250, CSCI 1280, CSCI 1360, CSCI 1370, CSCI 1800, CSCI 1805, CSCI 1870, CSCI 1952B, CSCI 1952X, CSCI 2002, CSCI 2952S). NonCSCI courses are not allowed, even if they are approved as part of a CS pathway or allowed as part of a pure CS concentration. 
^{11}  The capstone does not have to be part of the chosen CS pathway (unlike the pure CS concentration), but it can be used as one of the courses that completes a pathway or one of the courses that completes the APMA pairing. Completing a capstone prior to the senior year requires prior approval from the concentration advisor and the Director of Undergraduate Studies in CS. The following options can be used to satisfy this requirement:

Professional Tracks
The requirements for the professional tracks include all those of each of the standard tracks, as well as the following:
Students must complete fulltime professional experiences doing work that is related to their concentration programs, totaling 26 months, whereby each internship must be at least one month in duration in cases where students choose to do more than one internship experience. Such work is normally done at a company, but may also be at a university under the supervision of a faculty member. Internships that take place between the end of the fall and the start of the spring semesters cannot be used to fulfill this requirement.
On completion of each professional experience, the student must write and upload to ASK a reflective essay about the experience, 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 embarking on your summer experience? What are the topics from these courses that would have helped you over the summer if you had been more familiar with them?
 Are there topics you should have been familiar with in preparation for your summer experience, but are not taught at Brown? What are these topics?
 What did you learn from the experience that probably could not have been picked up from course work?
 Is the sort of work you did over the summer something you would like to continue doing once you graduate? Explain.
 Would you recommend your summer experience to other Brown students? Explain.
Honors
Concentrators that demonstrate excellence in grades and in undergraduate research can be awarded departmental honors. Honors students with primary advisors in Applied Math should follow the guidelines, requirements, and deadlines for honors as described in the bulletin for Applied Math concentrators and as published on the APMA departmental website. Honors students with primary advisors in Computer Science should follow the guidelines, requirements, and deadlines for honors as described in the bulletin for Computer Science concentrators and as published on the CS departmental website. Students wishing to do honors research with a nonAPMA or CS advisor should contact the Directors of Undergraduate Studies in APMA and CS to discuss options.
MathematicsComputer Science
Students may opt to pursue an interdisciplinary Bachelor of Science degree in MathComputer Science, a concentration administered cooperatively between the mathematics and computer science departments. Course requirements include math and systemsoriented computer science courses, as well as computational courses in applied math. Students must identify a series of electives that cohere around a common theme. As with other concentrations offered by the Computer Science department, students have the option to pursue the professional track of the ScB program in MathematicsComputer Science.
Requirements for the Standard Track of the Sc.B. degree.
Prerequisites  
Three semesters of Calculus to the level of MATH 0180, MATH 0200, or MATH 0350  3  
MATH 0520  Linear Algebra  1 
or MATH 0540  Linear Algebra With Theory  
or CSCI 0530  Coding the Matrix: An Introduction to Linear Algebra for Computer Science  
Core Courses  
MATH 1530  Abstract Algebra  1 
Select one of the following series:  2  
Series A  
Introduction to ObjectOriented Programming and Computer Science and Program Design with Data Structures and Algorithms  
Series B  
Computer Science: An Integrated Introduction and Program Design with Data Structures and Algorithms  
Series C  
Accelerated Introduction to Computer Science (and an additional CS course not otherwise used to satisfy a concentration requirement; an intermediatelevel CS course, or a 1000level CS course)  
Series D ^{1}  
Computing Foundations: Data and Computing Foundations: Program Organization and Program Design with Data Structures and Algorithms  
Intermediate Courses:  
CSCI 0320  Introduction to Software Engineering  1 
or CSCI 0300  Fundamentals of Computer Systems  
or CSCI 0330  Introduction to Computer Systems  
CSCI 0220  Introduction to Discrete Structures and Probability  1 
or CSCI 1010  Theory of Computation  
Three 1000level Mathematics courses  3  
Three advanced courses in Computer Science ^{2,3}  3  
Three additional courses different from any of the above chosen from Mathematics, Computer Science, Applied Mathematics, or related areas ^{4}  3  
A capstone course in Computer Science or Mathematics ^{5}  1  
Total Credits  19 
^{1}  Students wishing to go directly from CSCI 0111 to CSCI 0200 (without CSCI 0112) will need to successfully complete additional exercises to receive an instructor override code for CSCI 0200. In 202021, these exercises will be offered within CSCI 0111. Students from prior CSCI 0111 offerings should contact the current CSCI0111 instructor to arrange to do this work. 
^{2}  These must be CSCI courses at the 1000level or higher. Two of these courses and the intermediate courses must satisfy one of the CS pathways (https://cs.brown.edu/degrees/undergrad/concentratingincs/concentrationrequirements2020/pathwaysforundergraduateandmastersstudents/. At most one arts, humanities, or social science CS course can be used for concentration credit (currently CSCI 1250, 1280, 1360, 1370, 1800, 1805, 1870, 1952B, 1952X, 2002, 2952S). 
^{3}  Note: CSCI 1010 may be used either as a mathoriented intermediate course or as an advanced course. CSCI 1010 was formerly known as CSCI 510: they are the same course and hence only one may be taken for credit. CSCI 1450 was formerly known as CSCI 450: they are the same course and hence only one may be taken for credit. Applied Math 1650 or 1655 may be used in place of CSCI 1450 in CS pathway requirements. However, concentration credit will be given for only one of Applied Math 1650, 1655, and CSCI 1450. 
^{4}  These must be approved by a concentration advisor. 
^{5}  A onesemester course, taken in the student's last undergraduate year, in which the student (or group of students) use a significant portion of their undergraduate education, broadly interpreted, in studying some current topic in depth, to produce a culminating artifact such as a paper or software project. The title and abstract of the artifact, along with the student's and facultysponsor's names, will be placed in the CS website. The inclusion of a relevant image or system diagram is strongly encouraged. The complete text of the best artifacts of each class will be featured on the CS website. A senior thesis, which involves two semesters of work, may count as a capstone Coursebased capstones are currently only available through CS. Approved capstone courses and instructions may be found here: https://cs.brown.edu/degrees/undergrad/concentratingincs/concentrationrequirements2020/capstone/ 
Requirements for the Professional Track of the Sc.B. degree.
The requirements for the professional track include all those of the standard track, as well as the following:
Students must complete fulltime professional experiences doing work that is related to their concentration programs, totaling 26 months, whereby each internship must be at least one month in duration in cases where students choose to do more than one internship experience. Such work is normally done at a company, but may also be at a university under the supervision of a faculty member. Internships that take place between the end of the fall and the start of the spring semesters cannot be used to fulfill this requirement.
On completion of each professional experience, the student must write and upload to ASK a reflective essay about the experience addressing the following 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 embarking on your summer experience? What are the topics from these courses that would have helped you over the summer if you had been more familiar with them?
 Are there topics you should have been familiar with in preparation for your summer experience, but are not taught at Brown? What are these topics?
 What did you learn from the experience that probably could not have been picked up from course work?
 Is the sort of work you did over the summer something you would like to continue doing once you graduate? Explain.
 Would you recommend your summer experience to other Brown students? Explain.
Computer Science
The department of Computer Science offers two graduate degrees in computer science. The Master of Science (Sc.M.) degree for those who wish to improve their professional competence in computer science or to prepare 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/computerscience
Ph.D. Requirements
Requirements for the Ph.D. program can be found at https://cs.brown.edu/degrees/doctoral/reqs/reqs_phd.2015.pdf
Requirements for the Masters Degree
The requirements consist of a basic component and an advanced component. All courses must be at the 1000 level or higher. All courses must be completed with a grade of B or better.
The courses in student's program must be approved by the director of the Master's program (as well as by the student's advisor).
Basic Component
The basic component consists of six courses. None of these courses may be reading and research courses such as CSCI 2980.
The six courses are chosen as follows:
 Two must be CS courses that form a pathway (see the explanation of pathways at https://cs.brown.edu/degrees/undergrad/concentratingincs/concentrationrequirements2020/pathwaysforundergraduateandmastersstudents/
 One must be a CS course in an area that’s not listed in the chosen pathway (it must not be a core course, must not be a grad course, and must not be a related course of the pathway).
 The three additional courses must be in CS or related and must be approved by your advisor or the director of graduate studies (master’s). Getting this approval will require you to show that the courses are relevant to your CS interests. In general, the more nonCS courses you wish to take, the stronger your justification must be.
Advanced Component
The advanced component requires the student to complete one of the following 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 options 5 and 6. An “advanced course,” as used below, is either a 2000level CS courses or a 1000level CS courses that includes a Master's supplement. Master's supplement are nominally halfcredit courses, but students may do the work of these courses without officially registering for them. Examples of such supplements are CSCI 1234 (supplementing CSCI 1230), CSCI 1690 (supplementing CSCI 1670), and CSCI 1729 (supplementing CSCI 1730).
“Internships”, as used below, must be approved by the student's advisor and are paid work in the area of the student's master's studies. They may be full, or part time. A fulltime internship must last at least two months but no more than four months. A parttime internship must last at least four months but no more than six months. Normally the internship will be performed between the student's second and third semesters in the program.
The six options are:
 Complete a thesis supervised by her or his advisor and approved by a committee consisting of the advisor and at least one other faculty member.
 Complete a thesis supervised by her or his advisor and approved by a committee consisting of the advisor and at least one other faculty member, and complete an internship.
 Complete a project supervised and approved by her or his advisor.
 Complete a project supervised and approved by her or his advisor, and complete an internship.
 Complete two advanced courses.
 Complete two advanced courses and complete an internship.
Rationale
Students entering the Master's program typically have one of two goals: they intend to pursue research in Computer Science and are preparing themselves to enter Ph.D. programs, or they intend to become professional computer scientists and pursue careers in industry. In both cases, students should take collections of courses that not only give them strength in particular areas of Computer Science, but also include complementary areas that familiarize them with other ways of thinking about the field. For example, a student whose interests are in the practical aspects of designing computer systems should certainly take courses in this area, but should also be exposed to the mindset of theoretical computer science. In a rapidly changing discipline, there is much crossfertilization among areas and students should have some experience in doing advanced work in areas not directly related to their own.
A student whose goal is a research career should become involved as quickly as possible with a research group as part of their Master's studies, and demonstrate and learn about research by participating in it. The resulting thesis or project report will serve to establish her or his suitability for entering a Ph.D. program.
A student whose goal is to be a professional computer scientist should have some professional experience as part of her or his preparation. A certain amount of coursework is required before a student can qualify for a pedagogically useful internship. Students with limited experience in Computer Science should take a few advanced Computer Science courses before embarking on an internship. Other students, particularly those whose undergraduate degrees were at Brown, will have had internship experiences while undergraduates. Internships provide insights for subsequent courses and project work at Brown. Students without such experiences are at a disadvantage with respect to their peers. Thus we strongly encourage students who have not had such experience to choose of of options 2, 4, and 6, for which internships are required.
Note that these internships are not courses and the work is not evaluated as it would be for a course. Students' advisors will assist them in choosing and obtaining internships, but it is up to students themselves to ensure that they get as much benefit as possible from their experiences. They must be able to take advantage of these experiences while completing their Master's projects – we expect as highquality work from them as we do from students who entered the program with prior internship experiences.
A Master's degree normally requires three to four semesters of fulltime study, depending upon one's preparation.
CSCI 1010  Theory of Computation  1 
CSCI 1230  Introduction to Computer Graphics ^{*}  1 
CSCI 1250  Introduction to Computer Animation  1 
CSCI 1260  Compilers and Program Analysis  1 
CSCI 1270  Database Management Systems  1 
CSCI 1280  Intermediate 3D Computer Animation  1 
CSCI 1290  Computational Photography  1 
CSCI 1300  User Interfaces and User Experience  1 
CSCI 1310  Fundamentals of Computer Systems  1 
CSCI 1320  Creating Modern Web & Mobile Applications  1 
CSCI 1330  Computer Systems  1 
CSCI 1360  Human Factors in Cybersecurity  1 
CSCI 1370  Virtual Reality Design for Science  1 
CSCI 1380  Distributed Computer Systems  1 
CSCI 1410  Artificial Intelligence  1 
CSCI 1420  Machine Learning  1 
CSCI 1430  Computer Vision  1 
CSCI 1440  Algorithmic Game Theory  1 
CSCI 1450  Advanced Introduction to Probability for Computing and Data Science  1 
CSCI 1460  Computational Linguistics  1 
CSCI 1470  Deep Learning  1 
CSCI 1510  Introduction to Cryptography and Computer Security  1 
CSCI 1550  Probabilistic Methods in Computer Science  1 
CSCI 1570  Design and Analysis of Algorithms  1 
CSCI 1590  Introduction to Computational Complexity  1 
CSCI 1600  RealTime and Embedded Software  1 
CSCI 1610  Building HighPerformance Servers  1 
CSCI 1650  Software Security and Exploitation  1 
CSCI 1660  Introduction to Computer Systems Security ^{*}  1 
CSCI 1670  Operating Systems ^{*}  1 
CSCI 1680  Computer Networks  1 
CSCI 1710  Logic for Systems  1 
CSCI 1730  Design and Implementation of Programming Languages  1 
CSCI 1760  Multiprocessor Synchronization  1 
CSCI 1780  Parallel and Distributed Programming  1 
CSCI 1800  Cybersecurity and International Relations  1 
CSCI 1805  Computers, Freedom and Privacy  1 
CSCI 1810  Computational Molecular Biology  1 
CSCI 1820  Algorithmic Foundations of Computational Biology  1 
CSCI 1850  Deep Learning in Genomics  1 
CSCI 1860  Cybersecurity Law and Policy  1 
CSCI 1870  Cybersecurity Ethics  1 
CSCI 1880  Introduction to Computer Security  1 
CSCI 1900  csciStartup  1 
CSCI 1950N  2D Game Engines  1 
CSCI 1950T  Advanced Animation Production  1 
CSCI 1950U  Topics in 3D Game Engine Development  1 
CSCI 1950X  Software Foundations  1 
CSCI 1950Z  Computational Methods for Biology  1 
CSCI 1951A  Data Science  1 
CSCI 1951C  Designing Humanity Centered Technology  1 
CSCI 1951G  Optimization Methods in Finance  1 
CSCI 1951I  CS for Social Change  1 
CSCI 1951J  Interdisciplinary Scientific Visualization  1 
CSCI 1951L  Blockchains and Cryptocurrencies  1 
CSCI 1951N  VR+X, The Potential of Virtual Reality to Transform Nearly Everything  1 
CSCI 1951P  Design of Robotic Systems (ENGN 1931I)  0 
CSCI 2240  Advanced Computer Graphics  1 
CSCI 1951R  Introduction to Robotics  1 
CSCI 1951T  Surveying VR Data Visualization Software for Research  1 
CSCI 1951V  Hypertext/Hypermedia: The Web Was Not the Beginning and the Web Is Not the End  1 
CSCI 1951W  Sublinear Algorithms for Big Data  1 
CSCI 1951X  Formal Proof and Verification  1 
CSCI 1952V  Algorithms for the People  1 
CSCI 2270  Topics in Database Management  1 
CSCI 2300  HumanComputer Interaction Seminar  1 
CSCI 2310  Human Factors and User Interface Design  1 
CSCI 2330  Programming Environments  1 
CSCI 2340  Software Engineering  1 
CSCI 2370  Interdisciplinary Scientific Visualization  1 
CSCI 2390  PrivacyConscious Computer Systems  1 
CSCI 2410  Statistical Models in NaturalLanguage Understanding  1 
CSCI 2420  Probabilistic Graphical Models  1 
CSCI 2440  Advanced Algorithmic Game Theory  1 
CSCI 2470  Deep Learning  1 
CSCI 2500A  Advanced Algorithms  1 
CSCI 2500B  Optimization Algorithms for Planar Graphs  1 
CSCI 2510  Approximation Algorithms  1 
CSCI 2520  Computational Geometry  1 
CSCI 2530  Design and Analysis of Communication Networks  1 
CSCI 2531  Internet and Web Algorithms  1 
CSCI 2540  Advanced Probabilistic Methods in Computer Science  1 
CSCI 2550  Parallel Computation: Models, Algorithms, Limits  1 
CSCI 2590  Advanced Topics in Cryptography  1 
CSCI 2730  Programming Language Theory  1 
CSCI 2750  Topics in Parallel and Distributed Computing  1 
CSCI 2840  Advanced Algorithms in Computational Biology and Medical Bioinformatics  1 
CSCI 2950E  Stochastic Optimization  1 
CSCI 2950G  LargeScale Networked Systems  1 
CSCI 2950J  Cognition, HumanComputer Interaction and Visual Analysis  1 
CSCI 2950K  Special Topics in Computational Linguistics  1 
CSCI 2950R  Special Topics in Advanced Algorithms  1 
CSCI 2950T  Topics in Distributed Databases and Systems  1 
CSCI 2950U  Special Topics on Networking and Distributed Systems  1 
CSCI 2950V  Topics in Applied Cryptography  1 
CSCI 2950W  Online Algorithms  1 
CSCI 2950X  Topics in Programming Languages and Systems  1 
CSCI 2951B  DataDriven Vision and Graphics  1 
CSCI 2951E  Topics in Computer Systems Security  1 
CSCI 2951F  Learning and Sequential Decision Making  1 
CSCI 2951I  Computer Vision for Graphics and Interaction  1 
CSCI 2951K  Topics in Collaborative Robotics  1 
CSCI 2951M  Advanced Algorithms Seminar  1 
CSCI 2951N  Advanced Algorithms in Computational Biology  1 
CSCI 2951O  Foundations of Prescriptive Analytics  1 
CSCI 2951S  Distributed Computing through Combinatorial Topology  1 
CSCI 2951T  DataDriven Computer Vision  1 
CSCI 2951U  Topics in Software Security  1 
CSCI 2951X  Reintegrating AI  1 
CSCI 2952B  Topics in Computer Science Education Research  1 
CSCI 2952C  Learning with Limited Labeled Data  1 
CSCI 2952F  Distributed Systems at Scale: Microservices Management  1 
CSCI 2952G  Deep Learning in Genomics  1 
CSCI 2952K  Topics in 3D Computer Vision and Deep Learning  1 
* Students may arrange with the instructor to receive 2000 level credit for additional coursework in CSCI 1230, 1660 or 1670 
Concurrent ScB (NUS) and ScM in Computational Biology (Brown University)
The School of Computing at National University of Singapore and The Department of Computer Science at Brown have established a concurrent Bachelor’s and Master’s degree program in Computational Biology. After having first completed four years of under graduate study at National University of Singapore (NUS), qualified students will attend Brown University to complete their fifth and final year of study in computational biology. After the successful completion of requirements set forth by both universities, the students will simultaneously earn both their Sc.B. and Sc.M. degrees. The Sc.B will be awarded by the National University of Singapore, while the Sc.M. is awarded by Brown University.
Cybersecurity
Requirements for the Master of Science in Cybersecurity
The Master of Science in Cybersecurity is designed to be completed in 4 semesters. It takes 8 courses to complete the program and students can take up to 3 courses per semester, but the Department strongly recommends taking no more than 2 courses per semesterespecially during one's first term at Brown. We do not currently offer summer term courses in the program, so courses are completed during fall and spring. Course availability varies and there is no guarantee that students will be able to take every course they are interested in.
Each Cybersecurity student must have their course choices approved by the Director of Graduate Studies for their Track and by the student's advisor. Cybersecurity students must only register for courses at the 1000level or higher only. Additionally, all courses must be completed with a grade of B or better. Furthermore, students must complete at least two 2000level courses.
Choose from either the Computer Science Track or the Policy Track  
Computer Science Track:  
Required Courses:  
CSCI 1360  Human Factors in Cybersecurity  1 
CSCI 1660  Introduction to Computer Systems Security  1 
CSCI 1860  Cybersecurity Law and Policy  1 
Select Three Track courses:  3  
Fundamentals of Computer Systems  
Introduction to Cryptography and Computer Security  
Software Security and Exploitation  
Operating Systems  
Computer Networks  
Operating Systems Laboratory  
Design and Implementation of Programming Languages  
PrivacyConscious Computer Systems  
Advanced Topics in Cryptography  
Topics in Applied Cryptography  
Topics in Computer Systems Security  
Topics in Software Security  
Select Two Elective Courses:  2  
Theory of Computation  
Database Management Systems  
User Interfaces and User Experience  
Distributed Computer Systems  
Artificial Intelligence  
Machine Learning  
Advanced Introduction to Probability for Computing and Data Science  
Deep Learning  
Design and Analysis of Algorithms  
Cybersecurity and International Relations  
Computers, Freedom and Privacy  
Cybersecurity Ethics  
Introduction to Robotics  
Reading and Research  
Other appropriate courses are possible with the approval of the Director of Graduate Studies and the instructor if you've satisfied their prerequsities.  
Policy Track:  
Required Courses:  
CSCI 1360  Human Factors in Cybersecurity  1 
CSCI 1860  Cybersecurity Law and Policy  1 
CSCI 1880  Introduction to Computer Security  1 
Select Three Track courses:  3  
Reading and Research  
CSCI 2001  Applied Cryptography and Data Privacy  
Privacy and Personal Data Protection  
Other appropriate courses are possible with the approval of the Director of Graduate Studies and the instructor if you have satisfied their prerequisites.  
Select Two Elective Courses:  2  
User Interfaces and User Experience  
Cybersecurity and International Relations  
Computers, Freedom and Privacy  
Cybersecurity Ethics  
Blockchains and Cryptocurrencies 