COMPUTER SCIENCE (Div III)

Chair: Professor Jeannie Albrecht

 Jeannie R Albrecht, Chair and Professor of Computer Science

 Daniel W. Barowy, Associate Professor of Computer Science; on leave Fall 2024

 James M. Bern, Assistant Professor of Computer Science

 Rohit Bhattacharya, Assistant Professor of Computer Science; on leave Fall 2024

 Stephen N. Freund, A. Barton Hepburn Professor of Computer Science; on leave Spring 2025

 Mark Hopkins, Assistant Professor of Computer Science

 Iris Howley, Assistant Professor of Computer Science; on leave Spring 2025

 Bill K. Jannen, Associate Professor of Computer Science; on leave Spring 2025

 Katie A. Keith, Assistant Professor of Computer Science

 Samuel McCauley, Assistant Professor of Computer Science

 Kelly A. Shaw, Professor of Computer Science

 Shikha Singh, Assistant Professor of Computer Science

 Laura South, Visiting Assistant Professor of Computer Science

 Aaron M. Williams, Associate Professor of Computer Science; on leave Spring 2025

Computers and computation are pervasive in our society. They play enormously important roles in areas as diverse as education, science,
business, and the arts. Understanding the nature of computation and exploring the great potential of computers are the goals of the discipline of
computer science. A sample of the areas of research investigated by the Williams Department of Computer Science alone illustrates the vast range of
topics that are of interest to computer scientists and computing professionals today. This includes: the use of computer-generated graphic images in
the arts and as a tool for visualization in the sciences and other areas; the protocols that make transmission of information over the Internet possible;
the design of revolutionary new computer languages that simplify the process of constructing complex programs for computers; the development of
machine learning algorithms that can extract useful and even novel information from data that is too complex for humans to analyze; algorithms that
can solve problems that were previously too hard to solve in a reasonable amount of time, just by giving up a little bit of optimality in the solution; the
investigation of machine architectures and specific hardware aimed at making computing fast.

The department recognizes that students’ interests in computer science will vary widely. The department attempts to meet these varying interests
through: (1) the major; (2) a selection of courses intended for those who are interested primarily in an introduction to computer science; (3)
recommended course sequences for the non-major who wants a more extensive introduction to computer science in general or who seeks to develop
some specific expertise in computing for application in some other discipline.

MAJOR
The goal of the major is to provide an understanding of algorithmic problem solving as well as the conceptual organization of computers and
complex programs running on them. Emphasis is placed on the fundamental principles of computer science, building upon the mathematical and
theoretical ideas underlying these principles. The introductory and core courses build a broad and solid base for understanding computer science. The
more advanced courses allow students to sample a variety of specialized areas including graphics, artificial intelligence, computer architecture,
networks, compiler design, human computer interaction, distributed systems, and operating systems. Independent study and honors work provide
opportunities for students to study and conduct research on topics of special interest.

The major in Computer Science equips students to pursue a wide variety of career opportunities. It can be used as preparation for a career in
computing, for graduate school, or to provide important background and techniques for the student whose future career will extend outside of
computer science.

MAJOR REQUIREMENTS
Required Courses in Computer Science
A minimum of 8 courses is required in Computer Science, including the following:
Introductory Courses
Computer Science 134 Introduction to Computer Science

Computer Science 136 Data Structures and Advanced Programming

Core Courses
Computer Science 237 Computer Organization

Computer Science 256 Algorithm Design and Analysis

At least one of the following:

Computer Science 334 Principles of Programming Languages

Computer Science 361 Theory of Computation

Elective Courses
Three or more electives (bringing the total number of Computer Science courses to at least 8) chosen from 300- or 400-level courses in Computer
Science. If a student takes both Computer Science 334 and Computer Science 361, then one of the two may be counted as an elective. Computer
Science courses with 9 as the middle digit (reading, research, and thesis courses) will normally not be used to satisfy the elective requirements.
Students may petition the department to waive this restriction with good reason.

Elective courses in Computer Science fall into three categories: systems, theory and algorithms, and applications. In general, systems courses
have 3 or 4 as the middle digit, theory and algorithms courses have 5 or 6 as the middle digit, and applications courses have 7 or 8 as the middle
digit. Students are strongly encouraged to explore at least one elective course from each category.

Required Courses in Mathematics

Any Mathematics or Statistics course at the 200-level or higher in addition to the one used to satisfy the Discrete Math Proficiency Requirement.

Required Proficiency in Discrete Mathematics

Students must demonstrate proficiency in discrete mathematics by earning a grade of C- or better in MATH 200, MATH 328, MATH 334, or MATH
341. This requirement must be met by the end of the sophomore year.

The Department previously offered a Discrete Mathematics Proficiency Exam that could be used to fulfill the Discrete Math Proficiency
requirement in lieu of a passing grade in MATH 200. The exam will be discontinued in Fall 2025. Students entering in Fall 2024 or later are not
eligible to take the exam.

Students considering pursuing a major in Computer Science are urged to take Computer Science 134 and to begin satisfying their mathematics
requirements early. Note in particular that the Discrete Mathematics Proficiency requirement is a prerequisite for many advanced courses.

Other Notes
Students who take Computer Science 102T, 103, or 104 prior to Fall 2023 may use that course as one of the electives required for the major in
Computer Science. Those classes cannot be counted toward the major if taken in Fall 2023 or later semesters. Computer Science 102T, 103, 104,
and 134 are not open to students who have taken a Computer Science course numbered 136 or higher.

To be eligible for admission to the major, a student must have completed at least two Computer Science courses, including Computer Science
136, as well as fulfilled the Discrete Mathematics Proficiency Requirement by the end of the sophomore year. A Mathematics or Statistics course at
the 200-level or higher (in addition to the one used to satisfy the Discrete Math Proficiency Requirement) must be completed by the end of the junior
year. Students are urged to have completed two core courses (Computer Science 237, 256, 334 or 361) by the end of the sophomore year and must
normally have completed three core courses by the end of the junior year.

We encourage students to be intellectually engaged in our field beyond the formal structure of courses. As such, all computer science majors
must attend at least twenty Computer Science colloquia. Juniors and seniors are encouraged to attend at least five during each semester they are
present on campus. Prospective majors in their first and second years are also encouraged to attend. A student studying away in a program
approved by the International Education and Study Away Office will receive four colloquium credits for each semester away, up to a total of eight
credits.

With the advance permission of the department, two appropriate mathematics or statistics courses may be substituted for one Computer Science
elective. Appropriate mathematics classes are those numbered 300 or above, and appropriate statistics courses are those numbered 200 or above.
Other variations in the required courses, adapting the requirements to the special needs and interests of the individual student, may be arranged in
consultation with the department.

LABORATORY FACILITIES
The Computer Science Department maintains four departmental computer laboratories for students taking Computer Science courses. The
workstations in these laboratories also support student and faculty research in computer science.
THE DEGREE WITH HONORS IN COMPUTER SCIENCE
The degree with honors in Computer Science is awarded to students who have demonstrated outstanding intellectual achievement in a program of
study extending beyond the requirements of the regular major. The principal considerations in recommending a student for the degree with honors will
be: mastery of core material, ability to pursue independent study of computer science, originality in methods of investigation, and creativity in research.
Honors study is highly recommended for those students with strong academic records in computer science who wish to attend graduate school,
pursue high-level industrial positions in computing, or who would simply like to experience research in computer science.

Prospective honors students are urged to consult with their departmental advisor at the time of registration in the spring of the sophomore or at the
beginning of the junior year to arrange a program of study that could lead to the degree with honors. Such a program normally consists of Computer
Science 493 and 494 and a WSP of independent research under the guidance of a Computer Science faculty member, culminating in a thesis that is
judged acceptable by the department. The program produces a significant piece of written work and often includes a major computer program. All
honors candidates are required to give an oral presentation of their research in the Computer Science Colloquium in early spring semester.

Students considering honors work should obtain permission from the department before registering in the fall of the senior year. Formal admission
to candidacy occurs at the beginning of the spring semester of the senior year and is based on promising performance in the fall semester and winter
study units of honors work. Recommendations for the degree with honors will be made for outstanding performance in the three honors courses.
Highest honors will be recommended for students who have displayed exceptional ability, achievement, or originality.

INTRODUCTORY COURSES
The department offers a choice of introductory courses; Computer Science 102 The Socio-Techno Web, 103 Electronic Textiles, 104 Data Science
and Computation for All, and 134 Introduction to Computer Science.

Computer Science 134 provides an introduction to computer science with a focus on developing computer programming skills. These skills are
essential to most upper-level courses in the department. As a result, Computer Science 134 together with Computer Science 136, are required as a
prerequisite to most advanced courses in the department. Those students intending to take several Computer Science courses are urged to take 134
early.

Those students interested in learning more about exciting new ideas in computer science, but not necessarily interested in developing extensive
programming skills, should consider Computer Science 102 The Socio-Techno Web, 103 Electronic Textiles, or 104 Data Science and Computation
for All.

Students with significant programming experience should consider electing Computer Science 136 (see “Advanced Placement” below).

Please see https://csci.williams.edu/placement-for-introductory-computer-science-classes/ for more details on selecting among our classes.
Students are always welcome to contact a member of the department for guidance in selecting a first course.

COMPUTER SCIENCE 134

Introduction to Computer Science covers fundamental concepts in the design, implementation and testing of computer programs including loops,
conditionals, functions, elementary data types and recursion. There is a strong focus on constructing correct, understandable and efficient programs in
a structured language such as Java or Python.

STUDY ABROAD
Study abroad can be a wonderful experience. Students who hope to take computer science courses while abroad should discuss their plans in
advance with the chair of the department or the departmental study away advisor. Students who plan to study away but do not expect to take courses
toward the major should work with the department to create a plan to ensure that they will be able to complete the major. While study abroad is
generally not an impediment to completing the major, students should be aware that certain computer science courses must be taken in a particular
sequence and that not all courses are offered every semester (or every year). Students who wish to discuss their plans are invited to meet with any of
the faculty in Computer Science.

FAQ
Students MUST contact departments/programs BEFORE assuming study away credit will be granted toward the major or concentration.

Can your department or program typically pre-approve courses for major/concentration credit?

Yes, in some cases, if appropriate course information is available in advance (e.g. syllabi and/or course descriptions), though students should be
sure to contact the department.

What criteria will typically be used/required to determine whether a student may receive major/concentration credit for a course taken
while on study away?

Course title and description, and complete syllabus, including readings and assignments.

Does your department/program place restrictions on the number of major/concentration credits that a student might earn through study
away?
 Yes. Typically no more than two CSCI courses and one Math course.

Does your department/program place restrictions on the types of courses that can be awarded credit towards your major?

No.

Are there specific major requirements that cannot be fulfilled while on study away?

No.

Are there specific major requirements in your department/program that students should be particularly aware of when weighing study
away options? (Some examples might include a required course that is always taught in one semester, laboratory requirements.)

Yes. Many CSCI electives are not taught every year. Students should develop a plan to complete all major requirements and discuss them with
the department prior to going abroad.

Give examples in which students thought or assumed that courses taken away would count toward the major or concentration and then
learned they wouldn’t:

Students must have courses pre-approved prior to going abroad to ensure they meet the curricular goals and standards of the department.

ADVANCED PLACEMENT
Students with an extensive background in computer science are urged to take the Advanced Placement Examination in Computer Science. A
score of 4 or better on the AP Computer Science A exam is normally required for advanced placement in Computer Science 136. Students who
receive a score of 4 or better on the AP Computer Science A exam are not eligible to take Computer Science 134.

Students who wish to be placed in Computer Science 136 but who have not taken the Advanced Placement Examination should consult with the
department and arrange to take the departmental placement exam. Such students should have had a good course in computer science using a
structured language such as Java or Python.

PLANS OF STUDY FOR NON-MAJORS

The faculty in Computer Science believes that students can substantially enrich their academic experience by completing a coherent plan of study
in one or more disciplines outside of their majors. With this in mind, we have attempted to provide students majoring in other departments with options
in our department’s curriculum ranging from two-course sequences to collections of courses equivalent to what would constitute a minor at institutions
that recognize such a concentration. Students interested in designing such a plan of study are invited to discuss their plans in detail with a member of
the faculty. To assist students making such plans, we include some suggestions below.

Students seeking to develop an extensive knowledge of computer science without majoring in the department are encouraged to use the major
requirements as a guide. In particular, the core courses required of majors are intended to provide a broad knowledge of topics underlying all of
computer science. Students seeking a concentration in Computer Science are urged to complete at least two of these courses followed by one of our
upper-level electives. Such a program would typically require the completion of a total of five Computer Science courses in addition to the Discrete
Mathematics Proficiency requirement.

There are several sequences of courses appropriate for those primarily interested in developing skills in programming for use in other areas. For
general programming, Computer Science 134 followed by 136 and 256 will provide students with a strong background in algorithm and data structure
design together with an understanding of issues of correctness and efficiency. Students of the Bioinformatics program are encouraged to take
Computer Science 134 at a minimum, and should also consider Computer Science 136 and 256. Students interested in Data Science should take
Computer Science 134, 136, 256, and at least one elective with a 7 or 8 as the middle digit. For engineering students, we recommend Computer
Science 134 followed by 136 and 237.

There are, of course, many other alternatives. We encourage interested students to consult with the department chair or other members of the
department’s faculty.

GENERAL REMARKS
Divisional Requirements
All Computer Science courses may be used to satisfy the Division III distribution requirement.

Alternate Year Courses

Computer Science 102, 103, 104, and our electives are each usually offered at least every other year. All other Computer Science courses are
normally offered every year.

Course Numbering
The increase from 100, through 200 and 300, to 400 indicates in most instances an increasing level of maturity in the subject that is expected of
students. Within a series, numeric order does not indicate the relative level of difficulty of courses. Rather, the middle digit of the course number
(particularly in upper-level courses) generally indicates the area of computer science covered by the course.
Course Descriptions
Brief descriptions of the courses in Computer Science can be found below. More detailed information on the offerings in the department is
available at http://www.cs.williams.edu/.

Courses Open on a Pass-Fail Basis

Students taking a Computer Science course on a pass-fail basis must meet all the requirements set for students taking the course on a graded
basis.

With the permission of the department, any course offered by the department may be taken pass-fail (with the exception of tutorials), though
courses graded with the pass-fail option may not be used to satisfy any of the major or honors requirements. However, with the permission of the
department, courses taken in the department beyond those requirements may be taken on a pass-fail basis.

CSCI 103 (S) Electronic Textiles (QFR)

Digital data is being infused throughout the entire physical world, escaping the computer monitor and spreading to other devices and appliances,
including the human body. Electronic textiles, or eTextiles, is one of the next steps toward making everything interactive and this course aims to
introduce learners to the first steps of developing their own wearable interactive technology devices. After completing a series of introductory eTextiles
projects to gain practice in necessary sewing, circuitry, and programming skills, students will propose and design their own eTextiles projects,
eventually implementing them with sewable Arduino components, and other found electronic components as needed. The scope of the project will
depend on the individual's prior background, but can include everything from a sweatshirt with light-up turn signals for bicycling, to a wall banner that
displays the current air quality of the room, to a stuffed animal that plays a tune when the lights go on, to whatever project you can conceivably
accomplish with sewable Arduino inputs, outputs, and development board in a semester context. This class will introduce students to introductory
computer programming, circuitry, and sewing with the goal of creating novel wearable artifacts that interact with the world.

Class Format: interspersed with hands-on activities in a computer lab

Requirements/Evaluation: weekly homework assignments and a final project

Prerequisites: none

Enrollment Limit: 18

Enrollment Preferences: students who have not previously taken a CSCI course

Expected Class Size: 18

Grading: yes pass/fail option, yes fifth course option

Unit Notes: Please see the Computer Science Department website for more information on selecting an introductory computer science class:
https://csci.williams.edu/

Materials/Lab Fee: a fee of $95 will be added to term bill to cover Lilypad Arduino components (Protosnap Plus Kit, battery holders, sets of LEDs,
temperature sensor, vibe board, tri-color LED), alligator test leads, fabric, thread & fabric scissors.

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: The course will teach students the basics of computer programming through projects in which
quantitative/formal reasoning skills are practiced and evaluated.

Not offered current academic year

CSCI 104 (F) Data Science and Computing for All (QFR)

Many of the world's greatest discoveries and most consequential decisions are enabled or informed by the analysis of data from a myriad of sources.
Indeed, the ability to wrangle, visualize, and draw conclusions from data is now a critical tool in the sciences, business, medicine, politics, other
academic disciplines, and society as a whole. This course lays the foundations for quantifying relationships in data by exploring complementary
computational, statistical, and visualization concepts. These concepts will be reinforced by lab experiences designed to teach programming and
statistics skills while analyzing real-world data sets. This course will also examine the broader context and social issues surrounding data analysis,
including privacy and ethics.

Requirements/Evaluation: Weekly lab assignments involving programming, a project, and examinations.

Prerequisites: None; previous programming experience or statistics is not required.

Enrollment Limit: 30;15/lab

Enrollment Preferences: Not open to those who have completed or are currently enrolled in a Computer Science course numbered 136 or higher.
Preference given to those who have not previously taken a computer science or statistics course.

Expected Class Size: 30

Grading: yes pass/fail option, no fifth course option

Unit Notes: Additional details about the class are available here: https://www.cs.williams.edu/~cs104. Please see the Computer Science Department
website for more information on selecting an introductory computer science class: https://csci.williams.edu/

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: This course includes regular and substantial problem sets, labs, and/or projects in which quantitative/formal
reasoning skills are practiced and evaluated.

Fall 2024

LEC Section: 01 MWF 10:00 am - 10:50 am Stephen N. Freund

LEC Section: 02 MWF 11:00 am - 11:50 am Stephen N. Freund

LAB Section: 03 M 1:00 pm - 2:30 pm Stephen N. Freund

LAB Section: 04 M 2:30 pm - 4:00 pm Stephen N. Freund

LAB Section: 05 T 1:00 pm - 2:30 pm Stephen N. Freund

LAB Section: 06 T 2:30 pm - 4:00 pm Stephen N. Freund

CSCI 134 (F)(S) Introduction to Computer Science (QFR)

This course introduces students to the science of computation by exploring the representation and manipulation of data and algorithms. We organize
and transform information in order to solve problems using algorithms written in a modern object-oriented language. Topics include organization of
data using objects and classes, and the description of processes using conditional control, iteration, methods and classes. We also begin the study of
abstraction, self-reference, reuse, and performance analysis. While the choice of programming language and application area will vary in different
offerings, the skills students develop will transfer equally well to more advanced study in many areas. In particular, this course is designed to provide
the programming skills needed for further study in computer science and is expected to satisfy introductory programming requirements in other
departments.

Requirements/Evaluation: weekly programming projects, weekly written homeworks, and two examinations.

Prerequisites: none, except for the standard prerequisites for a (QFR) course; previous programming experience is not required

Enrollment Limit: 30;15/lab

Enrollment Preferences: if the course is over-enrolled, enrollment will be determined by lottery.

Expected Class Size: 30/lec

Grading: yes pass/fail option, yes fifth course option

Unit Notes: Please see the Computer Science Department website for more information on selecting an introductory computer science class:
https://csci.williams.edu/. Students with prior experience with object-oriented programming should discuss appropriate course placement with
members of the department.

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: This course includes regular and substantial problem sets, labs, and/or projects in which quantitative/formal
reasoning skills are practiced and evaluated.

Attributes: COGS Interdepartmental Electives

Fall 2024

LEC Section: 01 MWF 9:00 am - 9:50 am Bill K. Jannen

LEC Section: 02 MWF 10:00 am - 10:50 am Iris Howley

LEC Section: 03 MWF 11:00 am - 11:50 am Iris Howley

LAB Section: 04 M 1:00 pm - 2:30 pm Iris Howley

LAB Section: 05 M 1:00 pm - 2:30 pm Bill K. Jannen

LAB Section: 06 M 2:30 pm - 4:00 pm Iris Howley

LAB Section: 07 M 2:30 pm - 4:00 pm Bill K. Jannen

LAB Section: 08 T 2:30 pm - 4:00 pm Iris Howley

LAB Section: 09 T 2:30 pm - 4:00 pm Bill K. Jannen

Spring 2025

LEC Section: 01 MWF 9:00 am - 9:50 am Laura South

LEC Section: 02 MWF 10:00 am - 10:50 am Mark Hopkins

LEC Section: 03 MWF 11:00 am - 11:50 am Mark Hopkins

LAB Section: 04 M 1:00 pm - 2:30 pm Mark Hopkins

LAB Section: 05 M 2:30 pm - 4:00 pm Mark Hopkins

LAB Section: 06 T 1:00 pm - 2:30 pm Laura South

LAB Section: 07 T 1:00 pm - 2:30 pm Mark Hopkins

LAB Section: 08 T 2:30 pm - 4:00 pm Laura South

LAB Section: 09 T 2:30 pm - 4:00 pm Mark Hopkins

CSCI 136 (F)(S) Data Structures and Advanced Programming (QFR)

This course builds on the programming skills acquired in Computer Science 134. It couples work on program design, analysis, and verification with an
introduction to the study of data structures. Data structures capture common ways in which to store and manipulate data, and they are important in the
construction of sophisticated computer programs. Students are introduced to some of the most important and frequently used data structures: lists,
stacks, queues, trees, hash tables, graphs, and files. Students will be expected to write several programs, ranging from very short programs to more
elaborate systems. Emphasis will be placed on the development of clear, modular programs that are easy to read, debug, verify, analyze, and modify.

Requirements/Evaluation: programming and written assignments, quizzes, examinations

Prerequisites: CSCI 134 or equivalent; fulfilling the Discrete Mathematics Proficiency requirement is recommended, but not required

Enrollment Limit: 30;15/lab

Enrollment Preferences: if the course is over-enrolled, enrollment will be determined by lottery.

Expected Class Size: 30/lec

Grading: yes pass/fail option, no fifth course option

Unit Notes: Please see the Computer Science Department website for more information on selecting an introductory computer science class:
https://csci.williams.edu/

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: This course include regular and substantial problem sets, labs, and/or projects in which quantitative/formal
reasoning skills are practiced and evaluated.

Attributes: BIGP Courses

Fall 2024

LEC Section: 01 MWF 9:00 am - 9:50 am James M. Bern

LEC Section: 02 MWF 10:00 am - 10:50 am James M. Bern

LAB Section: 03 W 1:00 pm - 2:30 pm James M. Bern

LAB Section: 04 W 2:30 pm - 4:00 pm James M. Bern

LAB Section: 05 R 1:00 pm - 2:30 pm James M. Bern

LAB Section: 06 R 2:30 pm - 4:00 pm James M. Bern

Spring 2025

LEC Section: 01 MWF 9:00 am - 9:50 am Katie A. Keith

LEC Section: 02 MWF 10:00 am - 10:50 am Katie A. Keith

LAB Section: 03 W 1:00 pm - 2:30 pm Katie A. Keith

LAB Section: 04 W 2:30 pm - 4:00 pm Katie A. Keith

LAB Section: 05 R 1:00 pm - 2:30 pm Katie A. Keith

LAB Section: 06 R 2:30 pm - 4:00 pm Katie A. Keith

CSCI 237 (F)(S) Computer Organization (QFR)

This course studies the basic instruction set architecture and organization of a modern computer. It provides a programmer's view of how computer
systems execute programs, store information, and communicate. Over the semester the student learns the fundamentals of translating higher level
languages into assembly language, and the interpretation of machine languages by hardware. At the same time, a model of computer hardware
organization is developed from the gate level upward.

Requirements/Evaluation: weekly programming assignments and/or problem sets, quizzes, midterm and final exams

Prerequisites: CSCI 136

Enrollment Limit: 36;18/lab

Enrollment Preferences: current or expected Computer Science majors

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: The course will consist of programming assignments and problem sets in which quantitative/formal
reasoning skills are practiced and evaluated.

Fall 2024

LEC Section: 01 MWF 10:00 am - 10:50 am Kelly A. Shaw

LEC Section: 02 Cancelled

LAB Section: 03 W 1:00 pm - 2:30 pm Kelly A. Shaw

LAB Section: 04 W 2:30 pm - 4:00 pm Kelly A. Shaw

LAB Section: 05 Cancelled

LAB Section: 06 Cancelled

Spring 2025

LEC Section: 01 MWF 11:00 am - 11:50 am Jeannie R Albrecht

LAB Section: 02 W 1:00 pm - 2:30 pm Jeannie R Albrecht

LAB Section: 03 R 1:00 pm - 2:30 pm Jeannie R Albrecht

CSCI 256 (F)(S) Algorithm Design and Analysis (QFR)

This course investigates methods for designing efficient and reliable algorithms. By carefully analyzing the structure of a problem within a
mathematical framework, it is often possible to dramatically decrease the computational resources needed to find a solution. In addition, analysis
provides a method for verifying the correctness of an algorithm and accurately estimating its running time and space requirements. We will study
several algorithm design strategies that build on data structures and programming techniques introduced in Computer Science 136. These include
greedy, divide-and-conquer, dynamic programming, and network flow algorithms. Additional topics of study include algorithms on graphs and
strategies for handling potentially intractable problems.

Requirements/Evaluation: Problem sets, midterm and final examinations

Prerequisites: CSCI 136 and fulfillment of the Discrete Mathematics Proficiency requirement

Enrollment Limit: 24

Enrollment Preferences: Preference will be given to students who need the class in order to complete the major. Ties will be broken by seniority
(seniors first, then juniors, etc.).

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: This course will have weekly problem sets in which students will formally prove statements about the
behavior and performance of algorithms. In short, the course is about applying abstract and mathematical reasoning to the study of algorithms and
computation.

Fall 2024

LEC Section: 01 MWF 12:00 pm - 12:50 pm Aaron M. Williams

Spring 2025

LEC Section: 01 MR 1:10 pm - 2:25 pm Samuel McCauley

LEC Section: 02 MR 2:35 pm - 3:50 pm Samuel McCauley

CSCI 315 (F) Computational Biology (QFR)

Cross-listings: PHYS 315

Secondary Cross-listing

This course will provide an overview of Computational Biology, the application of computational, mathematical, statistical, and physical
problem-solving techniques to interpret the rapidly expanding amount of biological data. Topics covered will include database searching, DNA
sequence alignment, clustering, RNA structure prediction, protein structural alignment, methods of analyzing gene expression, networks, and genome
assembly using techniques such as string matching, dynamic programming, hidden Markov models, and statistics.

Requirements/Evaluation: weekly Python programming assignments, code reviews, problem sets, plus a few quizzes and a final project

Prerequisites: programming experience (e.g., CSCI 136) and mathematics (PHYS/MATH 210 or MATH 150) and physical science (PHYS 142/151,
or CHEM 101/15X), or permission of instructor

Enrollment Limit: 10

Enrollment Preferences: if over-enrolled, a questionnaire will be circulated

Expected Class Size: 8

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

This course is cross-listed and the prefixes carry the following divisional credit:

CSCI 315(D3) PHYS 315(D3)

Quantitative/Formal Reasoning Notes: problem sets and programming assignments

Attributes: BIGP Courses

Fall 2024

LEC Section: 01 MR 2:35 pm - 3:50 pm Daniel P. Aalberts

CSCI 319 (S) Integrative Bioinformatics, Genomics, and Proteomics Lab (QFR)

Cross-listings: BIOL 319 / CHEM 319 / PHYS 319 / MATH 319

Secondary Cross-listing

What can computational biology teach us about cancer? In this lab-intensive experience for the Genomics, Proteomics, and Bioinformatics program,
computational analysis and wet-lab investigations will inform each other, as students majoring in biology, chemistry, computer science,
mathematics/statistics, and physics contribute their own expertise to explore how ever-growing gene and protein data-sets can provide key insights
into human disease. In this course, we will take advantage of one well-studied system, the highly conserved Ras-related family of proteins, which play
a central role in numerous fundamental processes within the cell. The course will integrate bioinformatics and molecular biology, using database
searching, alignments and pattern matching, and phylogenetics to reconstruct the evolution of gene families by focusing on the gene duplication
events and gene rearrangements that have occurred over the course of eukaryotic speciation. By utilizing high through-put approaches to investigate
genes involved in the inflammatory and MAPK signal transduction pathways in human colon cancer cell lines, students will uncover regulatory
mechanisms that are aberrantly altered by siRNA knockdown of putative regulatory components. This functional genomic strategy will be coupled with
independent projects using phosphorylation-state specific antisera to test our hypotheses. Proteomic analysis will introduce the students to de novo
structural prediction and threading algorithms, as well as data-mining approaches and Bayesian modeling of protein network dynamics in single cells.
Flow cytometry and mass spectrometry may also be used to study networks of interacting proteins in colon tumor cells.

Class Format: The lab for this course will meet for two afternoons per week. Some lab sessions will be shorter than 3 hours.

Requirements/Evaluation: lab participation, several short homework assignments, one lab report, a programming project, and a grant proposal

Prerequisites: BIOL 202; students who have not taken BIOL 202 but have taken BIOL 101 and a CSCI course, or CSCI/PHYS 315, may enroll with
permission of instructor. No prior computer programming experience is required.

Enrollment Limit: 12

Enrollment Preferences: seniors, then juniors, then sophomores

Expected Class Size: 12

Grading: yes pass/fail option, no fifth course option

Distributions: (D3) (QFR)

This course is cross-listed and the prefixes carry the following divisional credit:

BIOL 319(D3) CHEM 319(D3) CSCI 319(D3) PHYS 319(D3) MATH 319(D3)

Quantitative/Formal Reasoning Notes: Through lab work, homework sets and a major project, students will learn or further develop their skills in
programming in Python, and about the basis of Bayesian approaches to phylogenetic tree estimation.

Attributes: BIGP Courses BIMO Interdepartmental Electives

Not offered current academic year

CSCI 331 (F) Introduction to Computer Security (QFR)

This class explores common vulnerabilities in computer systems, how attackers exploit them, and how systems engineers design defenses to mitigate
them. The goal is to be able to recognize potential vulnerabilities in one's own software and to practice defensive design. Hands-on experience writing
assembly language and C code to inspect and modify the low-level operation of running programs is emphasized. Finally, regular reading and writing
assignments round out the course to help students understand the cultural and historical background of the computer security "arms race."

Class Format: This course has twice-weekly lecture meetings as well as a weekly lab meeting.

Requirements/Evaluation: weekly reading responses, lab assignments, midterm exam, and final project

Prerequisites: CSCI 237

Enrollment Limit: 24(12/lab)

Enrollment Preferences: upper-level students

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Materials/Lab Fee: A fee of $75-$100 will be added to the term bill to cover the purchase of a Raspberry Pi computer and accessories.

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: This course include regular and substantial problem sets and labs in which quantitative/formal reasoning
skills are practiced and evaluated.

Not offered current academic year

CSCI 334 (S) Principles of Programming Languages (QFR)

This course examines the concepts and structures governing the design and implementation of programming languages. It presents an introduction to
the concepts behind compilers and run-time representations of programming languages; features of programming languages supporting abstraction
and polymorphism; and the procedural, functional, object-oriented, and concurrent programming paradigms. Programs will be required in languages
illustrating each of these paradigms.

Requirements/Evaluation: weekly problem sets and programming assignments, a midterm examination, and a final examination

Prerequisites: CSCI 136

Enrollment Limit: 30
Enrollment Preferences: current or expected Computer Science majors

Expected Class Size: 30

Grading: yes pass/fail option, no fifth course option

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: This course include regular and substantial problem sets and labs in which quantitative/formal reasoning
skills are practiced and evaluated.

Spring 2025

LEC Section: 01 MR 1:10 pm - 2:25 pm Daniel W. Barowy

LEC Section: 02 MR 2:35 pm - 3:50 pm Daniel W. Barowy

CSCI 338 (S) Parallel Processing (QFR)

This course explores different parallel programming paradigms used for writing applications on today's parallel computer systems. The course will
introduce concurrency (i.e. multiple simultaneous computations) and the synchronization primitives that allow for the creation of correct concurrent
applications. It will examine how a variety of systems organize parallel processing resources and enable users to write parallel programs for these
systems. Covered programming paradigms will include multiprogramming with processes, message passing, threading in shared memory
multiprocessors, vector processing, graphics processor programming, MapReduce, and other forms of programming for the cloud. Class discussion is
based on assigned readings. Assignments provide students the opportunity to develop proficiency in writing software using different parallel
programming paradigms.

Requirements/Evaluation: homework assignments, programming projects, midterm, and final project

Prerequisites: CSCI 136 or equivalent programming experience, and CSCI 237, or permission of instructor

Enrollment Limit: 24

Enrollment Preferences: current or expected Computer Science majors

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Materials/Lab Fee: A fee of $100 will be added to the term bill to cover specialized compute resources (e.g., GPUs) purchased through AWS or
Azure to complete course assignments.

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: The course will consist of substantial homework assignments and programming assignments in which
quantitative/formal reasoning skills are practiced and evaluated.

Spring 2025

LEC Section: 01 TR 9:55 am - 11:10 am Kelly A. Shaw

CSCI 339 (F) Distributed Systems (QFR)

This course studies the key design principles of distributed systems, which are collections of independent networked computers that function as single
coherent systems. Covered topics include communication protocols, processes and threads, naming, synchronization, consistency and replication,
fault tolerance, and security. Students also examine some specific real-world distributed systems case studies, including Google and Amazon. Class
discussion is based on readings from the textbook and research papers. The goals of this course are to understand how large-scale computational
systems are built, and to provide students with the tools necessary to evaluate new technologies after the course ends.

Requirements/Evaluation: weekly homework assignments, midterm exam, 3 major programming projects, and a final project

Prerequisites: CSCI 237

Enrollment Limit: 24

Enrollment Preferences: current or expected Computer Science majors

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: The course will consist of programming assignments and problem sets in which quantitative/formal
reasoning skills are practiced and evaluated.

Fall 2024

LEC Section: 01 MR 1:10 pm - 2:25 pm Jeannie R Albrecht

CSCI 345 (S) Robotics and Digital Fabrication (QFR)

This course is a hands-on exploration of topics in robotics and digital fabrication. We will experience firsthand how ideas and methods from computer
science can be applied to make physical objects, including robots and other machines. The emphasis will be on creative, hands-on experimentation.
Along the way, students will learn the basics of embedded systems programming (Arduino), breadboarding, soldering, printed circuit board (PCB)
design, mechanical computer-aided design (CAD)--both conventional (OnShape) and programmatic (OpenSCAD)--as well digital fabrication
(3D-printing, laser cutting). Students will learn both how to build their own prototypes and how to send out designs to have parts machined
professionally. Students will work in teams throughout. The course will culminate in a team robotic design competition testing both functionality and
creativity.

Requirements/Evaluation: Evaluation based on assignments, projects, and exams.

Prerequisites: CSCI 237

Enrollment Limit: 18; 9/lab

Enrollment Preferences: Current or expected Computer Science majors

Expected Class Size: 18

Grading: no pass/fail option, no fifth course option

Materials/Lab Fee: A fee of $150-$200 will be added to the term bill to cover the purchase of consumable electronics, motors, 3D-printing filament,
and stock used in the assignments and final project.

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: The course will include programming assignments and problem sets in which quantitative/formal reasoning
skills are practiced and evaluated.

Spring 2025

LEC Section: 01 TR 9:55 am - 11:10 am James M. Bern

LAB Section: 02 T 1:00 pm - 2:30 pm James M. Bern

LAB Section: 03 T 2:30 pm - 4:00 pm James M. Bern

CSCI 357 (S) Algorithmic Game Theory (QFR)

This course focuses on topics in game theory and mechanism design from a computational perspective. We will explore questions such as: how to
design algorithms that incentivize truthful behavior, that is, where the participants have no incentive to cheat? Should we let drivers selfishly minimize
their commute time or let a central algorithm direct traffic? Does Arrow's impossibility result mean that all voting protocols are doomed? The
overarching goal of these questions is to understand and analyze selfish behavior and whether it can or should influence system design. Students will
learn how to model and reason about incentives in computational systems both theoretically and empirically. Topics include types of equilibria,
efficiency of equilibria, auction design and mechanism design with money, two-sided markets and mechanism design without money, incentives in
computational applications such as P2P systems, and computational social choice.

Requirements/Evaluation: weekly problem sets and/or programming assignments, two midterm exams, and a final project.

Prerequisites: CSCI 256

Enrollment Limit: 24

Enrollment Preferences: current or expected Computer Science majors

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: The course will consist problem sets and programming assignments in which quantitative/formal reasoning
skills are practiced and evaluated.

Spring 2025

LEC Section: 01 TF 1:10 pm - 2:25 pm Shikha Singh

CSCI 358 (F) Applied Algorithms (QFR)

This course is about bridging the gap between theoretical running time and writing fast code in practice. The course is divided into two basic topics.
The first is algorithmic: we will discuss some of the most useful tools in a coder's toolkit. This includes topics like randomization (hashing, filters,
approximate counters), linear and convex programming, similarity search, and cache-efficient algorithms. Our goal is to talk about why these efficient
algorithms make seemingly difficult problems solvable in practice. The second topic is applications: we will discuss how to implement algorithms in an
efficient way that takes advantage of modern hardware. Specific topics covered will include blocking, loop unrolling, pipelining, as well as strategies for
performance analysis. Projects and assessments will include both basic theoretical aspects (understanding why the algorithms we discuss actually
work), and practical aspects (implementing the algorithms we discuss to solve important problems, and optimizing the code so it runs as quickly as
possible).

Requirements/Evaluation: Over the course of each week, there will be either a homework or an assignment. Homeworks and assignments have
similar structure, with both a coding and problem set component, but assignments will be weighted more heavily and must be completed individually.
There will also be a take home final at the end of the year.

Prerequisites: CSCI 256 and CSCI 237

Enrollment Limit: 24

Enrollment Preferences: current or expected Computer Science majors

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: The course will consist of programming assignments and problem sets in which quantitative/formal
reasoning skills are practiced and evaluated.

Fall 2024

LEC Section: 01 TF 1:10 pm - 2:25 pm Samuel McCauley

CSCI 361 (F) Theory of Computation (QFR)

Cross-listings: MATH 361

Primary Cross-listing

This course introduces a formal framework for investigating both the computability and complexity of problems. We study several models of
computation including finite automata, regular languages, context-free grammars, and Turing machines. These models provide a mathematical basis
for the study of computability theory--the examination of what problems can be solved and what problems cannot be solved--and the study of
complexity theory--the examination of how efficiently problems can be solved. Topics include the halting problem and the P versus NP problem.

Requirements/Evaluation: weekly problem sets and one or more exams

Prerequisites: CSCI 256 or both a 300-level MATH course and permission of instructor

Enrollment Limit: 24

Enrollment Preferences: current or expected Computer Science majors

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

This course is cross-listed and the prefixes carry the following divisional credit:

MATH 361(D3) CSCI 361(D3)

Quantitative/Formal Reasoning Notes: This course include regular and substantial problem sets in which quantitative/formal reasoning skills are
practiced and evaluated.

Attributes: COGS Interdepartmental Electives

Fall 2024

LEC Section: 01 TR 8:30 am - 9:45 am Shikha Singh

LEC Section: 02 TR 9:55 am - 11:10 am Shikha Singh

CSCI 371 (S) Computer Graphics (QFR)

This course covers the fundamental mathematics and techniques behind computer graphics, and will teach students how to represent and draw 2D
and 3D geometry for real-time and photorealistic applications. Students will write challenging implementations from the ground up in C/C++, OpenGL,
and GLSL. Topics include transformations, rasterization, ray tracing, immediate mode GUI, forward and inverse kinematics, and physically-based
animation. Examples are drawn from video games, movies, and robotics.

Requirements/Evaluation: evaluation based on assignments, projects, and exams.

Prerequisites: CSCI 237

Enrollment Limit: 24;12/lab

Enrollment Preferences: current or expected Computer Science majors

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: The course will consist of programming assignments and problem sets in which quantitative/formal
reasoning skills are practiced and evaluated.

Not offered current academic year

CSCI 373 (S) Artificial Intelligence (QFR)

Artificial Intelligence (AI) has become part of everyday life, but what is it, and how does it work? This course introduces theories and computational
techniques that serve as a foundation for the study of artificial intelligence. Potential topics include the following: Problem solving by search, Logic,
Planning, Constraint satisfaction problems, Reasoning under uncertainty, Probabilistic graphical models, and Automated Learning.

Requirements/Evaluation: Evaluation based on assignments, projects, and exams.

Prerequisites: CSCI 136 and (CSCI 256 or permission of instructor)

Enrollment Limit: 24

Enrollment Preferences: current or expected Computer Science majors

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: The course will consist of programming assignments and problem sets in which quantitative/formal
reasoning skills are practiced and evaluated.

Attributes: COGS Interdepartmental Electives

Not offered current academic year

CSCI 374 (S) Machine Learning (QFR)

Machine learning is a field that derives from artificial intelligence and statistics, and is concerned with the design and analysis of computer algorithms
that "learn" automatically through the use of data. Computer algorithms are capable of discerning subtle patterns and structure in the data that would
be practically impossible for a human to find. As a result, real-world decisions, such as treatment options and loan approvals, are being increasingly
automated based on predictions or factual knowledge derived from such algorithms. This course explores topics in supervised learning (e.g., random
forests and neural networks), unsupervised learning (e.g., k-means clustering and expectation maximization), and possibly reinforcement learning
(e.g., Q-learning and temporal difference learning.) It will also introduce methods for the evaluation of learning algorithms (with an emphasis on
analysis of generalizability and robustness of the algorithms to distribution/environmental shift), as well as topics in computational learning theory and
ethics.

Requirements/Evaluation: Presentations, problem sets, programming exercises, empirical analyses of algorithms, critical analysis of current
literature; the final two weeks are focused on a project of the student's design.

Prerequisites: CSCI 136 and CSCI 256 or permission of instructor

Enrollment Limit: 24

Enrollment Preferences: Current or expected Computer Science majors.

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: This course heavily relies on discrete mathematics, calculus, and elementary statistics. Students will be
proving theorems, among many other mathematically oriented assignments. Additionally, they will be programming, which involves analytical and
logical thinking.

Attributes: COGS Interdepartmental Electives

Spring 2025

LEC Section: 01 MR 2:35 pm - 3:50 pm Rohit Bhattacharya

CSCI 375 (F) Natural Language Processing (QFR)

Natural language processing (NLP) is a set of methods for making human language accessible to computers. NLP underlies many technologies we
use on a daily basis including automatic machine translation, search engines, email spam detection, and automated personalized assistants. These
methods draw from a combination of algorithms, linguistics and statistics. This course will provide a foundation in building NLP models to classify,
generate, and learn from text data.

Requirements/Evaluation: Evaluation based on assignments, projects, and exams.

Prerequisites: CSCI 136, and either CSCI 256 or STAT 201/202.

Enrollment Limit: 24

Enrollment Preferences: current or expected Computer Science majors.

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: The course will consist of programming assignments and problem sets in which quantitative/formal
reasoning skills are practiced and evaluated.

Attributes: COGS Interdepartmental Electives

Fall 2024

LEC Section: 01 TR 9:55 am - 11:10 am Katie A. Keith

CSCI 376 (F)(S) Human-Computer Interaction

Cross-listings: STS 376

Primary Cross-listing

Human-Computer Interaction (HCI) principles are practiced in the design and evaluation of most software, greatly impacting the lives of anyone who
uses interactive technology and other products. There are many ways to design and build applications for people, so what methods can increase the
likelihood that our design is the most useful, intuitive, and enjoyable? This course provides an introduction to the field of human-computer interaction,
through a user-centered approach to designing and evaluating interactive systems. HCI draws on methods from computer science, the social and
cognitive sciences, and interaction design. In this course we will use these methods to: ideate and propose design problems, study existing systems
and challenges, explore design opportunities and tradeoffs, evaluate and improve designs, and communicate design problems and solutions to varying
audiences.

Requirements/Evaluation: course projects, in-class group work/participation, and exams

Prerequisites: CSCI 136

Enrollment Limit: 24

Enrollment Preferences: current or expected Computer Science majors

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3)

This course is cross-listed and the prefixes carry the following divisional credit:

STS 376(D2) CSCI 376(D3)

Attributes: COGS Interdepartmental Electives

Fall 2024

LEC Section: 01 MR 2:35 pm - 3:50 pm Laura South

Spring 2025

LEC Section: 01 MW 11:00 am - 12:15 pm Laura South

CSCI 378 (S) Human Artificial Intelligence Interaction

Cross-listings: STS 378

Primary Cross-listing

Artificial intelligence (AI) is already transforming society and every industry today. In order to ensure that AI serves the collective needs of humanity,
we as computer scientists must guide AI so that it has a positive impact on the human experience. This course is an introduction to harnessing the
power of AI so that it benefits people and communities. We will cover a number of general topics such as: agency and initiative, AI and ethics, bias and
transparency, confidence and errors, human augmentation and amplification, trust and explainability, and mixed-initiative systems. We explore these
topics via readings and projects across the AI spectrum, including: dialog and speech-controlled systems, computer vision, data science,
recommender systems, text summarization, and UI personalization, among others.

Class Format: Lecture content is delivered via video, and in-class time will be spent doing hands-on activities or in group discussion.

Requirements/Evaluation: homework, programming assignments, group work, participation, and quizzes

Prerequisites: CSCI 136, and at least one of CSCI 237, 256, or 334

Enrollment Limit: 24

Enrollment Preferences: current or expected Computer Science majors

Expected Class Size: 24

Grading: yes pass/fail option, no fifth course option

Distributions: (D3)

This course is cross-listed and the prefixes carry the following divisional credit:

STS 378(D2) CSCI 378(D3)

Attributes: COGS Interdepartmental Electives

Not offered current academic year

CSCI 379 (S) Causal Inference (QFR)

Does X cause Y? If so, how? And what is the strength of this causal relation? Seeking answers to such causal (as opposed to associational) questions
is a fundamental human endeavor; the answers we find can be used to support decision-making in various settings such as healthcare and public
policy. But how does one tease apart causation from association--early in our statistical education we are taught that "correlation does not imply
causation." In this course, we will re-examine this phrase and learn how to reason with confidence about the validity of causal conclusions drawn from
messy real-world data. We will cover core topics in causal inference including causal graphical models, unsupervised learning of the structure of these
models, expression of causal quantities as functions of observed data, and robust/efficient estimation of these quantities using statistical and machine
learning methods. Concepts in the course will be contextualized via regular case studies.

Requirements/Evaluation: Problem sets, programming exercises, empirical analyses, case studies, and a final project.

Prerequisites: CSCI 136, and either CSCI 256 or STAT 201/202.

Enrollment Limit: 24

Enrollment Preferences: Computer science majors and prospective majors.

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: This course heavily relies on discrete mathematics, algorithms, and elementary statistics. There will be
regular assignments requiring rigorous quantitative or formal reasoning.

Attributes: COGS Interdepartmental Electives

Not offered current academic year

CSCI 381 (F) Deep Learning (QFR)

This course is an introduction to deep neural networks and how to train them. Beginning with the fundamentals of regression and optimization, the
course then surveys a variety of neural network architectures, which may include multilayer feedforward neural networks, convolutional neural
networks, recurrent neural networks, and transformer networks. Students will also learn how to use deep learning software such as PyTorch or
Tensorflow.

Requirements/Evaluation: Evaluation based on assignments, projects, and exams.

Prerequisites: CSCI 136 and fulfillment of the Discrete Mathematics Proficiency requirement

Enrollment Limit: 24

Enrollment Preferences: Current or expected Computer Science majors

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: The course will consist of programming assignments and problem sets in which quantitative/formal
reasoning skills are practiced and evaluated.

Attributes: COGS Interdepartmental Electives

Fall 2024

LEC Section: 01 MWF 9:00 am - 9:50 am Mark Hopkins

CSCI 397 (F) Independent Reading: Computer Science

Directed independent reading in Computer Science.

Requirements/Evaluation: To be determined by supervising faculty member.

Prerequisites: permission of department

Enrollment Limit: none

Enrollment Preferences: none

Expected Class Size: NA

Grading: yes pass/fail option, yes fifth course option

Distributions: (D3)

Not offered current academic year

CSCI 398 (S) Independent Reading: Computer Science

Directed independent reading in Computer Science.

Requirements/Evaluation: To be determined by supervising faculty member.

Prerequisites: permission of department

Enrollment Limit: none

Enrollment Preferences: none

Expected Class Size: NA

Grading: yes pass/fail option, yes fifth course option

Distributions: (D3)

Not offered current academic year

CSCI 432 (F) Operating Systems (QFR)

This course explores the design and implementation of computer operating systems. Topics include historical aspects of operating systems
development, systems programming, process scheduling, synchronization of concurrent processes, virtual machines, memory management and
virtual memory, I/O and file systems, system security, os/architecture interaction, and distributed operating systems.

Requirements/Evaluation: several implementation projects that will include significant programming, as well as written homework, and up to two
exams

Prerequisites: CSCI 237 and either CSCI 256 or 334

Enrollment Limit: 24

Enrollment Preferences: current or expected Computer Science majors

Expected Class Size: 24

Grading: no pass/fail option, no fifth course option

Distributions: (D3) (QFR)

Quantitative/Formal Reasoning Notes: The course will consist of substantial problem sets and/or programming assignments in which
quantitative/formal reasoning skills are practiced and evaluated.

Not offered current academic year

CSCI 493 (F) Research in Computer Science

This course provides highly-motivated students an opportunity to work independently with faculty on research topics chosen by individual faculty.
Students are generally expected to perform a literature review, identify areas of potential contribution, and explore extensions to existing results. The
course culminates in a concise, well-written report describing a problem, its background history, any independent results achieved, and directions for
future research.

Requirements/Evaluation: class participation, presentations, and the final written report

Prerequisites: none

Enrollment Limit: none

Enrollment Preferences: open to senior Computer Science majors with permission of instructor

Expected Class Size: NA

Grading: yes pass/fail option, yes fifth course option

Unit Notes: this course (along with CSCI 31 and CSCI 494) is required for students pursuing honors, but enrollment is not limited to students
pursuing honors

Distributions: (D3)

Fall 2024

HON Section: 01 TBA Jeannie R Albrecht

CSCI 494 (S) Senior Thesis: Computer Science

Computer Science thesis; this is part of a full-year thesis (493-494).

Requirements/Evaluation: class participation, presentations, and the final written report

Prerequisites: CSCI 493

Enrollment Limit: none

Enrollment Preferences: open to senior Computer Science majors with permission of instructor

Expected Class Size: NA

Grading: yes pass/fail option, yes fifth course option

Distributions: (D3)

Spring 2025

HON Section: 01 TBA Jeannie R Albrecht

CSCI 497 (F) Independent Reading: Computer Science

Directed independent reading in Computer Science.

Requirements/Evaluation: To be determined by supervising faculty member.

Prerequisites: permission of department

Enrollment Limit: none

Enrollment Preferences: none

Expected Class Size: NA

Grading: yes pass/fail option, yes fifth course option

Distributions: (D3)

Fall 2024

IND Section: 01 TBA Jeannie R Albrecht

CSCI 498 (S) Independent Reading: Computer Science

Directed independent reading in Computer Science.

Requirements/Evaluation: To be determined by supervising faculty member.

Prerequisites: permission of department

Enrollment Limit: none

Enrollment Preferences: none

Expected Class Size: NA

Grading: yes pass/fail option, yes fifth course option

Distributions: (D3)

Spring 2025

IND Section: 01 TBA Jeannie R Albrecht

Winter Study ----------------------------------------------------------------------------

CSCI 10 (W) Unix and Software Tools

This course serves as a guided introduction to the Unix operating system and a variety of software tools. Students in this course will work on Unix
workstations, available in the Department's laboratory. By the end of the course, students will be familiar with Unix and will be able to use Git as a
collaborative tool. As a final project, students will work together in teams to explore an API of their choice. The exact topics to be covered may vary
depending upon the needs and desires of the students. The course is designed for individuals who understand basic program development techniques
as discussed in an introductory programming course (Computer Science 134 or equivalent), but who wish to become familiar with a broader variety of
computer systems and programming languages. This course is not intended for students who have completed a course at the 200 level or above.

Requirements/Evaluation: Presentation(s); Creative project(s)

Prerequisites: CSCI 134 or equivalent programming experience

Enrollment Limit: 10

Enrollment Preferences: Preference will be given to students who have not yet completed a CSCI course at the 200 level or above.

Expected Class Size: NA

Grading: pass/fail only

Unit Notes: Lida graduated from Williams in 2002 as a double major in CS and Psych. She returned in 2014 and spent 4 years working in Alumni
Relations before joining the staff of the CS Dept in 2019 where she provides instruction support for the intro classes.

Attributes: EXPE Experiential Education Courses STUX Winter Study Student Exploration

Winter 2025

LEC Section: 01 MTWR 10:00 am - 12:00 pm Lida P. Doret

CSCI 13 (W) User Experience Design: Designing for People

Many innovative products and entrepreneurial endeavors fail because they are not sensitive to the attitudes and behaviors of the people who interact
with them. The fields of User Experience (UX) Design and Design Thinking combine aspects of psychology with software development, behavioral
economics, architecture, and other fields, to create products and processes that provide an easy, enjoyable, efficient, and safe user experience. The
course will provide students with a theoretical framework for analyzing usability, as well as practical experience with iterative design techniques,
prototyping, and user testing and feedback. Students will demonstrate their understanding of UX theory through short presentations and participation
in class discussions. Students will work in small groups to identify a usability problem and design a solution which they will evaluate by heuristic
analysis and usability testing with human test subjects.

Requirements/Evaluation: Presentation(s); Creative project(s)

Prerequisites: None

Enrollment Limit: 12

Enrollment Preferences: The instructor seeks a diverse group of students with interests in psychology, design, human-computer interaction,
entrepreneurship, and other fields

Expected Class Size: NA

Grading: pass/fail only

Unit Notes: Rich Cohen '82 has designed communications, social networking, and education applications used by over 100 million people and has
conducted usability research on five continents.

Attributes: EXPE Experiential Education Courses STUX Winter Study Student Exploration

Winter 2025

SEM Section: 01 MWF 10:00 am - 12:00 pm Rich Cohen

CSCI 16 (W) Introduction to the Computer Science Research Process

This course introduces students to the research process in Computer Science. Students will learn how to critically read research papers and to find
relevant related work. They will also learn about experimental design and data visualization. Students will apply these skills in the context of a specific
research paper, recreating some of the data collection, analysis, and data visualization from that paper. A flipped classroom approach will be used,
with students watching recorded videos outside of class in preparation for in-class discussions and activities. Students will create a written research
project proposal that describes how they plan to extend the research paper to answer a different question, including describing how the existing
experimental framework would need to be modified and what experiments would need to be conducted. Assessment will be based on this written
project proposal and an in-class oral presentation of that proposal.
Class Format: Students will be expected to watch short pre-recorded videos in advance of in-class discussions and practice activities. Meeting times
will be shortened to reflect this outside preparation time.

Requirements/Evaluation: Short final paper and presentation.

Prerequisites: Students should have successfully completed Computer Science 134 or some similar computing experience. In particular, some
familiarity with the Python programming language will be advantageous.

Enrollment Limit: 15

Enrollment Preferences: Students who have not participated in computing research experiences previously will be given priority.

Expected Class Size: NA

Grading: pass/fail only

Attributes: EXPE Experiential Education Courses

Winter 2025

SEM Section: 01 TR 10:00 am - 1:00 pm Kelly A. Shaw

CSCI 17 (W) Fiber Arts for All

While fast fashion has taken over our lifestyles, the technology historically used to create our garments remain available to us today. In this class, we
will focus specifically on the process of turning protein (animal) fiber into yarn, and into appealing fabric through handspinning, dyeing, tapestry
weaving, and crocheting. We will use tools and techniques that are financially responsible, often leveraging found objects, to show that almost anyone
can participate in the slow fashion and local fibershed movements.

Class Format: Class will be a combination of lecture and hands-on practice, while significant time outside of class will be dedicated to further practice
and content delivery through videos, podcasts, and readings.

Requirements/Evaluation: Project(s); Presentation(s)

Prerequisites: NA

Enrollment Limit: 15

Enrollment Preferences: NA

Expected Class Size: 15

Grading: pass/fail only

Materials/Lab Fee: $200

Winter 2025

LEC Section: 01 Cancelled

CSCI 18 (W) The Evolution of Magic: The Gathering - Deck Archetypes and Strategies from 1993 to Today

Magic: The Gathering is a collectible card game that has been in continuous development since 1993 and has featured regular high-level professional
events since Pro Tour New York in 1996. In these competitive events, players construct their own sixty-card decks that must conform to the
deckbuilding restrictions of the particular tournament environment. New card designs are regularly developed, and the release of these cards in new
expansions increases the size of the available card pool and also introduces new rules and strategies to the game. Since competitive decks must
carefully consider card synergies, the design of newly introduced cards influences the balance among various competitive strategies. This class will
study the evolution of deck designs throughout Magic's thirty-year existence. It will focus on the elements that define classic archetypes, so-called
"Aggro", "Combo", and "Control", as well as elements that define the hybrid strategies present in many tournament environments. By studying
representative tournament environments from different Magic eras, we will appreciate the ways that shifts in card design philosophy continuously
shape tournament metagames.

Requirements/Evaluation: Paper(s) or report(s); Other: participation in competitive play and write-ups

Prerequisites: Knowledge of Magic the Gathering rules and gameplay experience. Interest in competitive play and tournament analysis.

Enrollment Limit: 12

Enrollment Preferences: Students with greater depth of magic-playing experience.

Expected Class Size: NA

Grading: pass/fail only

Unit Notes: Mark Tocco has been playing Magic: the Gathering since 1998 and has had a history of competitive Magic the Gathering success,
including winning the Vintage World Championship in 2014. He now makes his living with card games, including poker.

Materials/Lab Fee: $20

Attributes: SLFX Winter Study Self-Expression STUX Winter Study Student Exploration

Winter 2025

LEC Section: 01 Cancelled

CSCI 19 (W) Law, Cybersecurity, and Society

The connected world presents a new set of capabilities, and associated risks. In this course, we will explore the intersection of cybersecurity, legal
frameworks, jurisdictions, and the ethics linking them all. Using examples of past hacking incidents, we will work together to identify and explore
different vulnerabilities inherent in today's systems and technologies that hackers exploit. Simultaneously, we will explore the costs and benefits
implicit in various approaches to regulating these different hacking behaviors through societal mores and political, economic and legal mechanisms. By
the end of the course, students will be familiar with important cybersecurity events and changes, how they have influenced the law, and how the law
has shaped the development of the modern connected world. The evaluation will be through a paper of 10 pages or less, or other approaches agreed
upon with the instructors.

Requirements/Evaluation: Paper(s) or report(s); Presentation(s); Other: Certain projects may be appropriate, after consultation with the instructors.

Prerequisites: This course is designed to be accessible to any student; no requirement to be in the Computer Science major.

Enrollment Limit: 24

Enrollment Preferences: Should the course be over-enrolled, priority will be given first to seniors, then juniors, and so on.

Expected Class Size: NA

Grading: pass/fail only

Unit Notes: Richard Ward '89 is a former Technical Fellow at Microsoft Corp, where he was the head of security assurance for platform products. He
worked at Microsoft for 35 years across numerous projects. John Massaro '89 is a Partner in the Washington DC office of Arnold & Porter, where he
has practiced since completing a clerkship on the First Circuit in 1993. John also is an Adjunct Professor at George Mason Law School, teaching
Federal Courts there every year since 2010.

Attributes: EXPE Experiential Education Courses STUX Winter Study Student Exploration

Winter 2025

LEC Section: 01 TR 10:00 am - 1:00 pm Rich Ward, John Massaro

CSCI 23 (W) Research and Development in Computing

An independent project is completed in collaboration with a member of the Computer Science Department. The projects undertaken will either involve
the exploration of a research topic related to the faculty member's work or the implementation of a software system that will extend the students design
and implementation skills. It is expected that the student will spend 20 hours per week working on the project. At the completion of the project, each
student will submit a 10-page written report or the software developed together with appropriate documentation of its behavior and design. In addition,
students will be expected to give a short presentation or demonstration of their work. Prior to the beginning of the Winter Study registration period, any
student interested in enrolling must have arranged with a faculty member in the department to serve as their supervisor for the course.

Requirements/Evaluation: short paper and final project or presentation

Prerequisites: project must be pre-approved by the faculty supervisor

Enrollment Limit: 30

Enrollment Preferences: preference given to sophomores and juniors

Expected Class Size: NA

Grading: pass/fail only

Attributes: EXPE Experiential Education Courses STUX Winter Study Student Exploration
Winter 2025

RSC Section: 01 TBA Jeannie R Albrecht

CSCI 31 (W) Senior Thesis: Computer Science

To be taken by students registered for Computer Science 493-494.

Class Format: independent study

Requirements/Evaluation: Determined by faculty advisors

Prerequisites: CSCI 493

Enrollment Limit: 10

Enrollment Preferences: Current thesis students

Expected Class Size: 10

Grading: pass/fail only

Winter 2025

HON Section: 01 TBA Jeannie R Albrecht

CSCI 99 (W) Independent Study: Computer Science

Open to upperclass students. Students interested in doing an independent project (99) during Winter Study must make prior arrangements with a
faculty sponsor. The student and professor then complete the independent study proposal form available online. The deadline is typically in late
September. Proposals are reviewed by the pertinent department and the Winter Study Committee. Students will be notified if their proposal is
approved prior to the Winter Study registration period.

Class Format: independent study

Grading: pass/fail only

Distributions: (D3)

Winter 2025

IND Section: 01 TBA Jeannie R Albrecht