{"id":257,"date":"2017-10-17T16:34:20","date_gmt":"2017-10-17T16:34:20","guid":{"rendered":"https:\/\/www.macalester.edu\/160-mscs\/computer_science\/"},"modified":"2024-07-08T15:22:23","modified_gmt":"2024-07-08T15:22:23","slug":"computer_science","status":"publish","type":"page","link":"https:\/\/www.macalester.edu\/mscs\/schedules\/computer_science\/","title":{"rendered":"Computer Science Classes"},"content":{"rendered":"
\n <\/a>\n

\n \n Spring 2026<\/a>\n \n \n Fall 2026<\/a>\n \n \n\t\n\t\n\t\n <\/p>\n \n\t

Spring 2026<\/h2>\n

Visit the Registrar's Class Schedule for live registration information<\/a><\/p>\n

\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
Num. \/ Sec. \/ CRN<\/th>\n Name<\/th>\n Days<\/th>\n Time<\/th>\n Room<\/th>\n Instructor<\/th>\n <\/th>\n \n <\/tr>\n <\/thead>\n
COMP 112-01 32421<\/span><\/td>\n Introduction to Data Science<\/td>\n \n Days: <\/span> T R \n <\/td>\n \n Time: <\/span>01:20 pm-02:50 pm\n <\/td>\n \n Room: <\/span>OLRI 254\n <\/td>\n \n Instructor: <\/span>Leslie Myint\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with STAT 112-01 (32422); Registration limit will be adjusted to save 4 seats for Seniors, 6 seats for Juniors, 8 seats for Sophomores, and 6 seats for First Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course provides an introduction to the handling, analysis, and interpretation of the big datasets now routinely being collected in science, commerce, and government. Students achieve facility with a sophisticated, technical computing environment. The course aligns with techniques being used in several courses in the natural and social sciences, statistics, and mathematics. The course is intended to be accessible to all students, regardless of background.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Quantitative Thinking Q2\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 112-02 32423<\/span><\/td>\n Introduction to Data Science<\/td>\n \n Days: <\/span> T R \n <\/td>\n \n Time: <\/span>03:00 pm-04:30 pm\n <\/td>\n \n Room: <\/span>OLRI 254\n <\/td>\n \n Instructor: <\/span>Leslie Myint\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with STAT 112-02 (32424); Registration limit will be adjusted to save 4 seats for Seniors, 6 seats for Juniors, 8 seats for Sophomores, and 6 seats for First Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course provides an introduction to the handling, analysis, and interpretation of the big datasets now routinely being collected in science, commerce, and government. Students achieve facility with a sophisticated, technical computing environment. The course aligns with techniques being used in several courses in the natural and social sciences, statistics, and mathematics. The course is intended to be accessible to all students, regardless of background.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Quantitative Thinking Q2\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 112-03 32425<\/span><\/td>\n Introduction to Data Science<\/td>\n \n Days: <\/span> T R \n <\/td>\n \n Time: <\/span>09:40 am-11:10 am\n <\/td>\n \n Room: <\/span>OLRI 254\n <\/td>\n \n Instructor: <\/span>Dan Drake\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with STAT 112-03 (32426); Registration limit will be adjusted to save 4 seats for Seniors, 6 seats for Juniors, 8 seats for Sophomores, and 6 seats for First Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course provides an introduction to the handling, analysis, and interpretation of the big datasets now routinely being collected in science, commerce, and government. Students achieve facility with a sophisticated, technical computing environment. The course aligns with techniques being used in several courses in the natural and social sciences, statistics, and mathematics. The course is intended to be accessible to all students, regardless of background.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Quantitative Thinking Q2\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 123-01 32427<\/span><\/td>\n Core Concepts in Computer Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>08:30 am-09:30 am\n <\/td>\n \n Room: <\/span>OLRI 258\n <\/td>\n \n Instructor: <\/span>Dan Drake\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Registration limit will be adjusted to save 4 seats for First Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course introduces the field of computer science, including central concepts such as the design and implementation of algorithms and programs, testing and analyzing programs, the representation of information within the computer, and the role of abstraction and metaphor in computer science. The exploration of these central ideas will draw examples from a range of application areas including multimedia processing, turtle graphics, and text processing. Course work will use the Python programming language.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 123-02 32428<\/span><\/td>\n Core Concepts in Computer Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>09:40 am-10:40 am\n <\/td>\n \n Room: <\/span>OLRI 258\n <\/td>\n \n Instructor: <\/span>Dan Drake\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Registration limit will be adjusted to save 4 seats for First Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course introduces the field of computer science, including central concepts such as the design and implementation of algorithms and programs, testing and analyzing programs, the representation of information within the computer, and the role of abstraction and metaphor in computer science. The exploration of these central ideas will draw examples from a range of application areas including multimedia processing, turtle graphics, and text processing. Course work will use the Python programming language.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 123-03 32429<\/span><\/td>\n Core Concepts in Computer Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>10:50 am-11:50 am\n <\/td>\n \n Room: <\/span>OLRI 258\n <\/td>\n \n Instructor: <\/span>Lian Duan\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Registration limit will be adjusted to save 4 seats for First Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course introduces the field of computer science, including central concepts such as the design and implementation of algorithms and programs, testing and analyzing programs, the representation of information within the computer, and the role of abstraction and metaphor in computer science. The exploration of these central ideas will draw examples from a range of application areas including multimedia processing, turtle graphics, and text processing. Course work will use the Python programming language.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 123-04 32430<\/span><\/td>\n Core Concepts in Computer Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>12:00 pm-01:00 pm\n <\/td>\n \n Room: <\/span>OLRI 258\n <\/td>\n \n Instructor: <\/span>Lian Duan\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Registration limit will be adjusted to save 4 seats for First Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course introduces the field of computer science, including central concepts such as the design and implementation of algorithms and programs, testing and analyzing programs, the representation of information within the computer, and the role of abstraction and metaphor in computer science. The exploration of these central ideas will draw examples from a range of application areas including multimedia processing, turtle graphics, and text processing. Course work will use the Python programming language.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 127-01 32431<\/span><\/td>\n Object-Oriented Programming and Abstraction<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>09:40 am-10:40 am\n <\/td>\n \n Room: <\/span>OLRI 256\n <\/td>\n \n Instructor: <\/span>Amin Alhashim\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Registration limit will be adjusted to save 4 seats for First Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n What happens as software grows in complexity? How do we break a program into manageable pieces? How do we write readable, maintainable code? This course is an introduction to the building blocks of software design: abstraction, decomposition, and encapsulation. Using object-oriented programming in Java, we will create graphics, games, and simulations, and explore natural language processing. Topics may include: classes, objects, polymorphism, inheritance, testing, refactoring, events, closures, streams, immutability, parallel programming, and version control. The course culminates in a student-designed project. Prerequisite(s): COMP 123\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 127-02 32432<\/span><\/td>\n Object-Oriented Programming and Abstraction<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>10:50 am-11:50 am\n <\/td>\n \n Room: <\/span>OLRI 256\n <\/td>\n \n Instructor: <\/span>Amin Alhashim\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Registration limit will be adjusted to save 4 seats for First Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n What happens as software grows in complexity? How do we break a program into manageable pieces? How do we write readable, maintainable code? This course is an introduction to the building blocks of software design: abstraction, decomposition, and encapsulation. Using object-oriented programming in Java, we will create graphics, games, and simulations, and explore natural language processing. Topics may include: classes, objects, polymorphism, inheritance, testing, refactoring, events, closures, streams, immutability, parallel programming, and version control. The course culminates in a student-designed project. Prerequisite(s): COMP 123\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 127-03 32433<\/span><\/td>\n Object-Oriented Programming and Abstraction<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>01:10 pm-02:10 pm\n <\/td>\n \n Room: <\/span>OLRI 256\n <\/td>\n \n Instructor: <\/span>Shilad Sen\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

**Registration limit will be adjusted to save 4 seats for First Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n What happens as software grows in complexity? How do we break a program into manageable pieces? How do we write readable, maintainable code? This course is an introduction to the building blocks of software design: abstraction, decomposition, and encapsulation. Using object-oriented programming in Java, we will create graphics, games, and simulations, and explore natural language processing. Topics may include: classes, objects, polymorphism, inheritance, testing, refactoring, events, closures, streams, immutability, parallel programming, and version control. The course culminates in a student-designed project. Prerequisite(s): COMP 123\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 128-01 32434<\/span><\/td>\n Data Structures<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>10:50 am-11:50 am\n <\/td>\n \n Room: <\/span>THEATR 205\n <\/td>\n \n Instructor: <\/span>Bret Jackson\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course familiarizes students with the fundamental data structures in computer science. Using the Java programming language, students will study existing data structure implementations, implement their own data structures, and develop data-intensive applications. The course covers stacks, queues, lists, trees, heaps, hash tables, graphs, and the common algorithms that use these data structures. Students will also receive an introduction to basic complexity analysis (Big-O), learn the time complexity of different data structure operations, and gain experience in calculating the time complexity of programs that use data structures. Prerequisite(s): COMP 127\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 128-02 32435<\/span><\/td>\n Data Structures<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>01:10 pm-02:10 pm\n <\/td>\n \n Room: <\/span>OLRI 241\n <\/td>\n \n Instructor: <\/span>Suhas Arehalli\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course familiarizes students with the fundamental data structures in computer science. Using the Java programming language, students will study existing data structure implementations, implement their own data structures, and develop data-intensive applications. The course covers stacks, queues, lists, trees, heaps, hash tables, graphs, and the common algorithms that use these data structures. Students will also receive an introduction to basic complexity analysis (Big-O), learn the time complexity of different data structure operations, and gain experience in calculating the time complexity of programs that use data structures. Prerequisite(s): COMP 127\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 212-01 32436<\/span><\/td>\n Intermediate Data Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>12:00 pm-01:00 pm\n <\/td>\n \n Room: <\/span>OLRI 241\n <\/td>\n \n Instructor: <\/span>Amin Alhashim\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with STAT 212-01 (32437)*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This second course in the data science curriculum emphasizes advanced data wrangling and manipulation, interactive visualization, writing functions, working with data in databases, version control, and data ethics. Through open-ended and interdisciplinary projects, students practice the constant feedback loop of asking questions of the data, manipulating the data to help answer the question, and then returning to more questions. Prerequisite(s): STAT 112\u00a0and\u00a0COMP 123\u00a0and\u00a0STAT 155;\u00a0STAT 253\u00a0recommended but not required.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 221-01 32438<\/span><\/td>\n Algorithm Design and Analysis<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>02:20 pm-03:20 pm\n <\/td>\n \n Room: <\/span>OLRI 241\n <\/td>\n \n Instructor: <\/span>Suhas Arehalli\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course offers an in-depth introduction to the design and analysis of algorithms. Students will work with algorithms in pseudocode, and will learn formal and informal methods for analyzing algorithm efficiency and correctness. Topics may include recursion, divide and conquer, dynamic programming, greedy methods, branch and bound, randomized, probabilistic, and parallel algorithms. Application areas include string processing, graphs, geometric problems, and optimization. This course will introduce computability topics including regular expressions, grammars and parsing, automata, nondeterminism, and NP completeness. Prerequisite(s): COMP 128\u00a0(or COMP 124, if previously taken) and MATH 279, or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 221-02 32439<\/span><\/td>\n Algorithm Design and Analysis<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>03:30 pm-04:30 pm\n <\/td>\n \n Room: <\/span>OLRI 241\n <\/td>\n \n Instructor: <\/span>Suhas Arehalli\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course offers an in-depth introduction to the design and analysis of algorithms. Students will work with algorithms in pseudocode, and will learn formal and informal methods for analyzing algorithm efficiency and correctness. Topics may include recursion, divide and conquer, dynamic programming, greedy methods, branch and bound, randomized, probabilistic, and parallel algorithms. Application areas include string processing, graphs, geometric problems, and optimization. This course will introduce computability topics including regular expressions, grammars and parsing, automata, nondeterminism, and NP completeness. Prerequisite(s): COMP 128\u00a0(or COMP 124, if previously taken) and MATH 279, or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 225-01 32440<\/span><\/td>\n Software Design and Development<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>10:50 am-11:50 am\n <\/td>\n \n Room: <\/span>OLRI 245\n <\/td>\n \n Instructor: <\/span>Paul Cantrell\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course is an introduction to the problem of building software with humans and for humans. Students work in teams to design and implement a semester-long user-facing software project of their own invention. There are no limitations on topic or technology; on the contrary, students are responsible for imagining possibilities, articulating goals, and researching and selecting suitable technologies. The format resembles a studio art class, with in-class discussion guided by sharing and critiquing classmates' ongoing work. Topics include communication, division of labor, user-centered design, human-computer interaction, product management, project management, iterative development, engineering tradeoffs, separation of concerns, code readability and maintainability, refactoring, testing, and version control. Teams give a public demonstration of their working projects at the end of the semester. Prerequisite(s): COMP 127\u00a0(COMP 128\u00a0recommended), or COMP 124 if previously taken, or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 225-02 32441<\/span><\/td>\n Software Design and Development<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>01:10 pm-02:10 pm\n <\/td>\n \n Room: <\/span>OLRI 245\n <\/td>\n \n Instructor: <\/span>Paul Cantrell\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course is an introduction to the problem of building software with humans and for humans. Students work in teams to design and implement a semester-long user-facing software project of their own invention. There are no limitations on topic or technology; on the contrary, students are responsible for imagining possibilities, articulating goals, and researching and selecting suitable technologies. The format resembles a studio art class, with in-class discussion guided by sharing and critiquing classmates' ongoing work. Topics include communication, division of labor, user-centered design, human-computer interaction, product management, project management, iterative development, engineering tradeoffs, separation of concerns, code readability and maintainability, refactoring, testing, and version control. Teams give a public demonstration of their working projects at the end of the semester. Prerequisite(s): COMP 127\u00a0(COMP 128\u00a0recommended), or COMP 124 if previously taken, or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 240-01 32442<\/span><\/td>\n Computer Systems<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>02:20 pm-03:20 pm\n <\/td>\n \n Room: <\/span>OLRI 245\n <\/td>\n \n Instructor: <\/span>Susan Fox\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course is an introduction to how computer systems work, including how a computer represents data, how code is compiled into instructions for the CPU, and how memory is organized. Students will learn to use the C programming language and assembly language. Prerequisite(s): COMP 127\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 240-02 32443<\/span><\/td>\n Computer Systems<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>03:30 pm-04:30 pm\n <\/td>\n \n Room: <\/span>OLRI 245\n <\/td>\n \n Instructor: <\/span>Susan Fox\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course is an introduction to how computer systems work, including how a computer represents data, how code is compiled into instructions for the CPU, and how memory is organized. Students will learn to use the C programming language and assembly language. Prerequisite(s): COMP 127\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 272-01 32299<\/span><\/td>\n Advanced Remote Sensing<\/td>\n \n Days: <\/span>M \n <\/td>\n \n Time: <\/span>07:00 pm-10:00 pm\n <\/td>\n \n Room: <\/span>CARN 109\n <\/td>\n \n Instructor: <\/span>Xavier Haro-Carri\u00f3n\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Permission of instructor required; cross-listed with GEOG 372-01 (32298)*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course introduces students to advanced topics in remote sensing analysis and is directed to students who want to work on a research project of their own choice. Introduction to some advanced remote sensing techniques such as the use of machine learning algorithms in image classification analysis (e.g. Random Forests) and time series analysis will be provided, but ultimately topics will be defined by students' interest. Advanced remote sensing techniques will be learned using Google Earth Engine (GEE). GEE is a cloud-based geospatial analysis platform that uses JavaScript and that enables large scale processing of satellite and other types of imagery. No previous coding experience is required and given the project-based nature of the class, students can opt to use GEE or another geospatial software for their projects. Students are expected to build a body of literature related to a topic of their choice, lead discussions, analyze data, peer-review other projects, and other steps related to the production of a scientific paper. The ultimate goal is to produce a "research manuscript" by the end of the semester and the majority of the grade will come from completing the steps leading to manuscript production. Prerequisite(s): GEOG 352\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Quantitative Thinking Q3\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Social science\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 302-01 32444<\/span><\/td>\n Introduction to Database Management Systems<\/td>\n \n Days: <\/span> T R \n <\/td>\n \n Time: <\/span>09:40 am-11:10 am\n <\/td>\n \n Room: <\/span>OLRI 258\n <\/td>\n \n Instructor: <\/span>Getiria Onsongo\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course will introduce students to the design, implementation, and analysis of databases stored in database management systems (DBMS). Topics include implementation-neutral data modeling, database design, database implementation, and data analysis using relational algebra and SQL. Students will generate data models based on real-world problems, and implement a database in a state-of-the-art DBMS. Students will master complex data analysis by learning to first design database queries and then implement them in a database query language such as SQL. Advanced topics include objects in databases, indexing for improved performance, distributed databases, and data warehouses. Prerequisite(s): COMP 127\u00a0\u00a0or permission of instructor\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 302-02 32445<\/span><\/td>\n Introduction to Database Management Systems<\/td>\n \n Days: <\/span> T R \n <\/td>\n \n Time: <\/span>01:20 pm-02:50 pm\n <\/td>\n \n Room: <\/span>OLRI 258\n <\/td>\n \n Instructor: <\/span>Getiria Onsongo\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course will introduce students to the design, implementation, and analysis of databases stored in database management systems (DBMS). Topics include implementation-neutral data modeling, database design, database implementation, and data analysis using relational algebra and SQL. Students will generate data models based on real-world problems, and implement a database in a state-of-the-art DBMS. Students will master complex data analysis by learning to first design database queries and then implement them in a database query language such as SQL. Advanced topics include objects in databases, indexing for improved performance, distributed databases, and data warehouses. Prerequisite(s): COMP 127\u00a0\u00a0or permission of instructor\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 325-01 32215<\/span><\/td>\n Video Games: Coding and Narrative<\/td>\n \n Days: <\/span> T R \n <\/td>\n \n Time: <\/span>09:40 am-11:10 am\n <\/td>\n \n Room: <\/span>LIBR 250\n <\/td>\n \n Instructor: <\/span>Dawes, Jackson\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with ENGL 224-01 (32214)*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n Videogames dominate entertainment culture. But like all popular forms of entertainment, they are often looked down upon as aesthetically superficial, intellectually uncomplicated, and somehow bad for you. They are "just pop culture." Like Shakespeare was in his time. Like the novel was when it was invented. And like film and television shows were when they were invented. This course takes seriously the deep intellectual and aesthetic value of videogames and of videogame making. Videogames are expanding the possibilities and the borders of storytelling and narrative design. They are pushing the limits of coding wizardry. They have also become one of the most creative popular-cultural sites for experimenting with and understanding other minds and identities. In this class, students will work in interdisciplinary teams to bring world-building narrative techniques to an immersive visual setting while exploring technical challenges involved in programming and game development through hands-on projects. Prerequisite(s): COMP 127\u00a0only if course is taken as the Computer Science cross-list.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Writing WC\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 342-01 32446<\/span><\/td>\n Operating Systems and Computer Architecture<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>09:40 am-10:40 am\n <\/td>\n \n Room: <\/span>OLRI 245\n <\/td>\n \n Instructor: <\/span>Lian Duan\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course introduces the basic design and architecture of operating systems. Concepts to be discussed include sequential and concurrent processes, synchronization and mutual exclusion, processor scheduling, time-sharing, multitasking, parallel processing, memory management, file system design, and security. Students will learn concepts through lectures, readings, and low-level programming using the C programming language. Prerequisite(s): COMP 240\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 365-01 32447<\/span><\/td>\n Computational Linear Algebra<\/td>\n \n Days: <\/span> T R \n <\/td>\n \n Time: <\/span>09:40 am-11:10 am\n <\/td>\n \n Room: <\/span>THEATR 201\n <\/td>\n \n Instructor: <\/span>Lori Ziegelmeier\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with MATH 365-01 (32448)*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n A mix of applied linear algebra and numerical analysis, this course covers a central point of contact between mathematics and computer science. Many of the computational techniques important in science, commerce, and statistics are based on concepts from linear algebra, such as subspaces, projections, and matrix decompositions. The course reviews these concepts, adopts them to large scales, and applies them in the core techniques of scientific computing. These include solving systems of linear and nonlinear equations, approximation and statistical function estimation, optimization, interpolation, eigenvalue and singular value decompositions, and compression. Applications throughout the natural sciences, social sciences, statistics, and computer science. Prerequisite(s): MATH 236; one of: MATH 135 or MATH 137 or MATH 237 ; one of: COMP 120 or COMP 123 or COMP 127 or COMP 128; or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 365-02 32449<\/span><\/td>\n Computational Linear Algebra<\/td>\n \n Days: <\/span> T R \n <\/td>\n \n Time: <\/span>01:20 pm-02:50 pm\n <\/td>\n \n Room: <\/span>THEATR 002\n <\/td>\n \n Instructor: <\/span>Lori Ziegelmeier\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with MATH 365-02 (32450)*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n A mix of applied linear algebra and numerical analysis, this course covers a central point of contact between mathematics and computer science. Many of the computational techniques important in science, commerce, and statistics are based on concepts from linear algebra, such as subspaces, projections, and matrix decompositions. The course reviews these concepts, adopts them to large scales, and applies them in the core techniques of scientific computing. These include solving systems of linear and nonlinear equations, approximation and statistical function estimation, optimization, interpolation, eigenvalue and singular value decompositions, and compression. Applications throughout the natural sciences, social sciences, statistics, and computer science. Prerequisite(s): MATH 236; one of: MATH 135 or MATH 137 or MATH 237 ; one of: COMP 120 or COMP 123 or COMP 127 or COMP 128; or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 394-01 32408<\/span><\/td>\n Language in Social Media<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>02:20 pm-03:20 pm\n <\/td>\n \n Room: <\/span>HUM 314\n <\/td>\n \n Instructor: <\/span>Zuoyu Tian\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*First day attendance required; cross-listed with LING 394-01 (32407)*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n In a world driven by digital communication, how do scholars in linguistics and computer science analyze language data from social media? This course provides you with the opportunity to learn how to apply recent Natural Language Processing (NLP) techniques to understand the dynamics of online discourse. We will cover the following topics in this course: topic modeling and text classification to uncover trends and patterns in large-scale social data, automated detection of harmful content and evaluation of such systems, techniques for identifying and tracking misinformation across platforms, assessment of large language models for bias and fairness, and approaches to building equitable and trustworthy AI systems. We will engage with recent academic papers, critically discussing their methods and findings. Hands-on sessions will provide experience replicating these studies and extending them using different NLP tools. By the end of the course, students will be expected to develop their own research project focused on studying social media language. Proficiency in Python programming is required for this course. Prerequisite(s): COMP 123 or permission of the instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 479-01 32451<\/span><\/td>\n Network Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>01:10 pm-02:10 pm\n <\/td>\n \n Room: <\/span>THEATR 203\n <\/td>\n \n Instructor: <\/span>Andrew Beveridge\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with MATH 479-01 (32452)*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n The modern Information Age has produced a wealth of data about the complex networks that tie us together. In response, the field of Network Science has arisen, bringing together mathematics, computer science, sociology, biology, economics and other fields. This course will explore the fundamental questions and the mathematical tools of Network Science. This includes: the structure of complex networks, including connectedness, centrality and "long tails"\u037e community detection\u037e random\/strategic models for network formation\u037e diffusion\/contagion and "tipping points" on networks\u037e and algorithms for analyzing complex networks. Prerequisite(s): COMP 123,\u00a0MATH 236,\u00a0MATH 279\u00a0and one of:\u00a0COMP 221, MATH 354\/STAT 354,\u00a0MATH 375, or MATH 379.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Writing WP\n \n \n Quantitative Thinking Q2\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 480-01 32453<\/span><\/td>\n Bodies and Minds: AI Robotics<\/td>\n \n Days: <\/span> T R \n <\/td>\n \n Time: <\/span>03:00 pm-04:30 pm\n <\/td>\n \n Room: <\/span>OLRI 258\n <\/td>\n \n Instructor: <\/span>Susan Fox\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course examines two distinct aspects of work in robotics: the physical construction of the robot's "body" and the creation of robot control programs that form the robot's "mind." It will study the strengths and weaknesses of a variety of robot sensors, including sonar, infrared, touch, GPS, and computer vision. It will also examine both reactive and deliberative approaches to\u00a0robot control programs. The course will include hands-on work with multiple robots, and a semester-long course project in robotics.\u00a0This course involves programming in Python; students should have a basic familiarity with Python or be prepared to learn Python during the course. This course counts as the capstone. Prerequisite(s): COMP 221\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n <\/tbody>\n <\/table>\n<\/div>\n\n \n\n \n\t

Fall 2026<\/h2>\n

Visit the Registrar's Class Schedule for live registration information<\/a><\/p>\n

\n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n \n
Num. \/ Sec. \/ CRN<\/th>\n Name<\/th>\n Days<\/th>\n Time<\/th>\n Room<\/th>\n Instructor<\/th>\n <\/th>\n \n <\/tr>\n <\/thead>\n
COMP 112-01 10183<\/span><\/td>\n Introduction to Data Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>09:40 am-10:40 am\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Amin Alhashim\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with STAT 112-01 (10184); seats saved for: 4 seniors, 6 juniors, 8 sophomores, 6 First-Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course provides an introduction to the handling, analysis, and interpretation of the big datasets now routinely being collected in science, commerce, and government. Students achieve facility with a sophisticated, technical computing environment. The course aligns with techniques being used in several courses in the natural and social sciences, statistics, and mathematics. The course is intended to be accessible to all students, regardless of background.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Quantitative Thinking Q2\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 112-02 10185<\/span><\/td>\n Introduction to Data Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>10:50 am-11:50 am\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Amin Alhashim\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with STAT 112-02 (10186); seats saved for: 4 seniors, 6 juniors, 8 sophomores, 6 First-Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course provides an introduction to the handling, analysis, and interpretation of the big datasets now routinely being collected in science, commerce, and government. Students achieve facility with a sophisticated, technical computing environment. The course aligns with techniques being used in several courses in the natural and social sciences, statistics, and mathematics. The course is intended to be accessible to all students, regardless of background.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Quantitative Thinking Q2\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 112-03 10187<\/span><\/td>\n Introduction to Data Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>12:00 pm-01:00 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Getiria Onsongo\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with STAT 112-03 (10188); seats saved for: 4 seniors, 6 juniors, 8 sophomores, 6 First-Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course provides an introduction to the handling, analysis, and interpretation of the big datasets now routinely being collected in science, commerce, and government. Students achieve facility with a sophisticated, technical computing environment. The course aligns with techniques being used in several courses in the natural and social sciences, statistics, and mathematics. The course is intended to be accessible to all students, regardless of background.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Quantitative Thinking Q2\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 112-04 10189<\/span><\/td>\n Introduction to Data Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>03:30 pm-04:30 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Getiria Onsongo\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with STAT 112-04 (10190); seats saved for: 4 seniors, 6 juniors, 8 sophomores, 6 First-Years*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course provides an introduction to the handling, analysis, and interpretation of the big datasets now routinely being collected in science, commerce, and government. Students achieve facility with a sophisticated, technical computing environment. The course aligns with techniques being used in several courses in the natural and social sciences, statistics, and mathematics. The course is intended to be accessible to all students, regardless of background.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Quantitative Thinking Q2\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 123-01 10191<\/span><\/td>\n Core Concepts in Computer Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>10:50 am-11:50 am\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Elizabeth Ernst\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course introduces the field of computer science, including central concepts such as the design and implementation of algorithms and programs, testing and analyzing programs, the representation of information within the computer, and the role of abstraction and metaphor in computer science. The exploration of these central ideas will draw examples from a range of application areas including multimedia processing, turtle graphics, and text processing. Course work will use the Python programming language.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 123-02 10192<\/span><\/td>\n Core Concepts in Computer Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>12:00 pm-01:00 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Elizabeth Ernst\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course introduces the field of computer science, including central concepts such as the design and implementation of algorithms and programs, testing and analyzing programs, the representation of information within the computer, and the role of abstraction and metaphor in computer science. The exploration of these central ideas will draw examples from a range of application areas including multimedia processing, turtle graphics, and text processing. Course work will use the Python programming language.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 127-01 10193<\/span><\/td>\n Object-Oriented Programming and Abstraction<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>09:40 am-10:40 am\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Joslenne Pe\u00f1a\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n What happens as software grows in complexity? How do we break a program into manageable pieces? How do we write readable, maintainable code? This course is an introduction to the building blocks of software design: abstraction, decomposition, and encapsulation. Using object-oriented programming in Java, we will create graphics, games, and simulations, and explore natural language processing. Topics may include: classes, objects, polymorphism, inheritance, testing, refactoring, events, closures, streams, immutability, parallel programming, and version control. The course culminates in a student-designed project. Prerequisite(s): COMP 123\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 127-02 10194<\/span><\/td>\n Object-Oriented Programming and Abstraction<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>10:50 am-11:50 am\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Joslenne Pe\u00f1a\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n What happens as software grows in complexity? How do we break a program into manageable pieces? How do we write readable, maintainable code? This course is an introduction to the building blocks of software design: abstraction, decomposition, and encapsulation. Using object-oriented programming in Java, we will create graphics, games, and simulations, and explore natural language processing. Topics may include: classes, objects, polymorphism, inheritance, testing, refactoring, events, closures, streams, immutability, parallel programming, and version control. The course culminates in a student-designed project. Prerequisite(s): COMP 123\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 127-03 10195<\/span><\/td>\n Object-Oriented Programming and Abstraction<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>02:20 pm-03:20 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Getiria Onsongo\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n What happens as software grows in complexity? How do we break a program into manageable pieces? How do we write readable, maintainable code? This course is an introduction to the building blocks of software design: abstraction, decomposition, and encapsulation. Using object-oriented programming in Java, we will create graphics, games, and simulations, and explore natural language processing. Topics may include: classes, objects, polymorphism, inheritance, testing, refactoring, events, closures, streams, immutability, parallel programming, and version control. The course culminates in a student-designed project. Prerequisite(s): COMP 123\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 128-01 10196<\/span><\/td>\n Data Structures<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>09:40 am-10:40 am\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Abby Marsh\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course familiarizes students with the fundamental data structures in computer science. Using the Java programming language, students will study existing data structure implementations, implement their own data structures, and develop data-intensive applications. The course covers stacks, queues, lists, trees, heaps, hash tables, graphs, and the common algorithms that use these data structures. Students will also receive an introduction to basic complexity analysis (Big-O), learn the time complexity of different data structure operations, and gain experience in calculating the time complexity of programs that use data structures. Prerequisite(s): COMP 127\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 128-02 10197<\/span><\/td>\n Data Structures<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>10:50 am-11:50 am\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Abby Marsh\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course familiarizes students with the fundamental data structures in computer science. Using the Java programming language, students will study existing data structure implementations, implement their own data structures, and develop data-intensive applications. The course covers stacks, queues, lists, trees, heaps, hash tables, graphs, and the common algorithms that use these data structures. Students will also receive an introduction to basic complexity analysis (Big-O), learn the time complexity of different data structure operations, and gain experience in calculating the time complexity of programs that use data structures. Prerequisite(s): COMP 127\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 194-01 10421<\/span><\/td>\n Thinking Internationally About (and With) AI and ChatGPT<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>01:10 pm-02:10 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>David Moore\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with INTL 294-01 (10420)*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n The sudden recent rise of LLM-based artificial intelligence (AI), notably but not only ChatGPT, is having deep sociocultural, political, economic, and educational effects. In this course we will think about, and with, AI in a global frame. After asking \u201cwhat is AI?\u201d and reviewing its history, we will explore AI topics including environment, labor, higher education, cognitive surrender, consciousness, personhood, recursivity, hallucination, geopolitics, warfare, alignment, existential risk, the post-Mac professions, and AI in film and literature. Rather than keep AI at a distance, we\u2019ll work with it: carefully, skeptically, critically, together. But often we\u2019ll avoid screens altogether.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Writing WP\n \n \n Internationalism\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 194-02 10897<\/span><\/td>\n Philosophy of AI<\/td>\n \n Days: <\/span> T R \n <\/td>\n \n Time: <\/span>01:20 pm-02:50 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Bixin Guo\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with PHIL 394-01 (10541)*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n Artificial Intelligence is one of the most exciting and fastest-moving technological fields today. This course examines philosophical questions related to AI. We will explore big-picture questions such as whether AIs can be conscious, whether we can control them, whether there might be an intelligence explosion. What, if anything, distinguishes intelligence from computation, prediction, or pattern recognition? How should we think about AI agency, autonomy, and responsibility? We will also consider ethical and social issues involving large language models, transparency and explainability, the ethical status of robots, and the ethics of deploying AI in high-stakes domains. No programming experience required.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Humanities\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 194-03 10898<\/span><\/td>\n Radical Software<\/td>\n \n Days: <\/span> T R \n <\/td>\n \n Time: <\/span>01:20 pm-02:50 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>STAFF\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with MCST 294-02 (10890)*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This hybrid theory\/practice seminar will trace the history of radical, activist, and countercultural uses of software and digital technology. From the milieu surrounding the Whole Earth Catalog, to hacker collectives such as Anonymous, to recent art and activism, we will explore efforts that have attempted to deploy software and its networks as anti-authoritarian or counter-hegemonic techniques. We will examine concepts that undergird the commitments of such actions, such as liberalism, freedom, sovereignty, prefigurative politics, and direct action. We will consider industry discourse to ask whether and how we might distinguish between radical software and corporate marketing messages around innovation and \u201cdisruption.\u201d Readings will include texts by authors such as McKenzie Wark, Fred Turner, Gabriella Coleman, Alex Galloway, and Ruha Benjamin. Coursework will include hands-on projects comprising creative and critical use and misuse of software, such as coding custom web browser extensions and USB keystroke injection attacks. No prior computer programming experience is necessary.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 194-F1 10198<\/span><\/td>\n Creative Coding<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>01:10 pm-02:10 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Paul Cantrell\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*First-Year Course only*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n Varies by semester. Consult the department or class schedule for current listing.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 194-F2 10199<\/span><\/td>\n Making, Prototyping and Physical Computing<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>01:10 pm-02:10 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Lauren Milne\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*First-Year Course only*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n Varies by semester. Consult the department or class schedule for current listing.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 212-01 10200<\/span><\/td>\n Intermediate Data Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>12:00 pm-01:00 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Amin Alhashim\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Cross-listed with STAT 212-01 (10201)*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This second course in the data science curriculum emphasizes advanced data wrangling and manipulation, interactive visualization, writing functions, working with data in databases, version control, and data ethics. Through open-ended and interdisciplinary projects, students practice the constant feedback loop of asking questions of the data, manipulating the data to help answer the question, and then returning to more questions. Prerequisite(s): STAT 112\u00a0and\u00a0COMP 123\u00a0and\u00a0STAT 155;\u00a0STAT 253\u00a0recommended but not required.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 221-01 10202<\/span><\/td>\n Algorithm Design and Analysis<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>09:40 am-10:40 am\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Lian Duan\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course offers an in-depth introduction to the design and analysis of algorithms. Students will work with algorithms in pseudocode, and will learn formal and informal methods for analyzing algorithm efficiency and correctness. Topics may include recursion, divide and conquer, dynamic programming, greedy methods, branch and bound, randomized, probabilistic, and parallel algorithms. Application areas include string processing, graphs, geometric problems, and optimization. This course will introduce computability topics including regular expressions, grammars and parsing, automata, nondeterminism, and NP completeness. Prerequisite(s): COMP 128\u00a0(or COMP 124, if previously taken) and MATH 279, or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 221-02 10203<\/span><\/td>\n Algorithm Design and Analysis<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>08:30 am-09:30 am\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Lian Duan\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course offers an in-depth introduction to the design and analysis of algorithms. Students will work with algorithms in pseudocode, and will learn formal and informal methods for analyzing algorithm efficiency and correctness. Topics may include recursion, divide and conquer, dynamic programming, greedy methods, branch and bound, randomized, probabilistic, and parallel algorithms. Application areas include string processing, graphs, geometric problems, and optimization. This course will introduce computability topics including regular expressions, grammars and parsing, automata, nondeterminism, and NP completeness. Prerequisite(s): COMP 128\u00a0(or COMP 124, if previously taken) and MATH 279, or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 225-01 10204<\/span><\/td>\n Software Design and Development<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>01:10 pm-02:10 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Bret Jackson\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course is an introduction to the problem of building software with humans and for humans. Students work in teams to design and implement a semester-long user-facing software project of their own invention. There are no limitations on topic or technology; on the contrary, students are responsible for imagining possibilities, articulating goals, and researching and selecting suitable technologies. The format resembles a studio art class, with in-class discussion guided by sharing and critiquing classmates' ongoing work. Topics include communication, division of labor, user-centered design, human-computer interaction, product management, project management, iterative development, engineering tradeoffs, separation of concerns, code readability and maintainability, refactoring, testing, and version control. Teams give a public demonstration of their working projects at the end of the semester. Prerequisite(s): COMP 127\u00a0(COMP 128\u00a0recommended), or COMP 124 if previously taken, or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 240-01 10205<\/span><\/td>\n Computer Systems<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>02:20 pm-03:20 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Susan Fox\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course is an introduction to how computer systems work, including how a computer represents data, how code is compiled into instructions for the CPU, and how memory is organized. Students will learn to use the C programming language and assembly language. Prerequisite(s): COMP 127\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 364-01 10206<\/span><\/td>\n Human-Computer Interaction<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>02:20 pm-03:20 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Lauren Milne\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n From doors we can't figure out how to open to websites we can't figure out how to navigate, we've all encountered counter-intuitive designs. So how do we create design systems that inspire joy instead of frustration? And how do we ensure that we design for everyone, including people who may be very different from ourselves? This course will teach techniques to improve our design of user interfaces, by centering the human in the design process. It will provide an introduction to the field of human-computer interaction and the design and evaluation of user interfaces. Students will learn methods for designing and prototyping interactive systems and some of the principles of creating good design based on human cognition. The class will be a mix of lectures, in-class activities and design critiques. The central focus of the course is a group project, in which students will formulate a design problem, explore potential design opportunities and tradeoffs, and iteratively evaluate and improve upon a digital prototype of their design. Prerequisite(s): COMP 123\u00a0or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 381-01 10207<\/span><\/td>\n Programming Languages<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>10:50 am-11:50 am\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Paul Cantrell\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n Why do people create different programming languages? What characteristics do languages have in common? What design decisions differentiate them, and what tradeoffs motivate those decisions? How do languages affect the style of code we write, our development processes, and the ways we think about software? In this course, we will examine a wide variety of programming languages, many briefly and a few in depth. We will compare how they approach topics such as type systems, abstraction, composition, state and mutability, access control, flow control, function dispatch, closures, metaprogramming, concurrency, memory management, compilation, and runtime environment. Prerequisite(s): COMP 128\u00a0\u00a0(COMP 240\u00a0and\u00a0COMP 361\u00a0useful but not required)\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 382-01 10762<\/span><\/td>\n Computing Futures<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>01:10 pm-02:10 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Joslenne Pe\u00f1a\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Permission of Instructor required*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n Those who pursue technology-based education like Computer Science learn a multitude of technical practices, techniques, logic,and languages to build and design future technologies. These technologies are solutions to world problems or may be hobbyist innature. Regardless, artifacts produced by Computer Scientists, Engineers, Programmers, and other similar stakeholders havesuffered immeasurably through lack of training and awareness on social issues. As a result, we observe in society the numeroustechnologies that currently exist to perpetuate harmful ideologies (-isms), oppressive power structures, and injustices onvulnerable and minority populations. Should these technologies be redesigned or thrown out all together? How can we connectthe design and development of technologies to the behaviors of minoritized identities? This course introduces students to criticalthinking through design frameworks and social constructs, while also developing their ability to analyze how software, tools, andassociated processes and practices can reinforce and exacerbate inequality in society. Once we confront the ways in whichtechnologies contribute to systems of inequality, we will begin to identify relevant problems and solutions to contribute to amore equal, just society. (Formerly known as Computer Science and Social Justice.) Offered every other spring. Prerequisite(s): COMP 123\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Writing WP\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 440-01 10208<\/span><\/td>\n Collective Intelligence<\/td>\n \n Days: <\/span> T R \n <\/td>\n \n Time: <\/span>01:20 pm-02:50 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Shilad Sen\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This course introduces the theory and practice of data science applied to online communities such as Wikipedia, Facebook, and Twitter. Students will read and discuss recent academic research papers that analyze behavior on these websites and use computational simulation, machine learning, and data-mining techniques to analyze massive behavioral datasets in areas such as recommender systems, natural language processing, and tagging systems. This course counts as the capstone. Prerequisite(s): COMP 221; or both COMP 127 and STAT 253\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Quantitative Thinking Q3\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 456-01 10209<\/span><\/td>\n Projects in Data Science<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>09:40 am-10:40 am\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Bret Jackson\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*Permission of instructor required; cross-listed with STAT 456-01 (10210)*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n This third course in the data science curriculum is a capstone course that emphasizes team-based learning through open-ended data science projects. Working with a team throughout the course of the semester you will take on an interdisciplinary in-depth data science project and gain experience in developing and refining research questions, identifying and wrangling datasets, and clearly presenting results and conclusions. Mini-lectures by the instructor, guest speakers, and students will present advanced topics that supplement and support team-based learning. Counts as a capstone course for the Computer Science major and the Data Science major. Prerequisite(s): COMP 212\u00a0and\u00a0STAT 253\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 484-01 10211<\/span><\/td>\n Introduction to Artificial Intelligence<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>03:30 pm-04:30 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Susan Fox\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

*3 seats saved for juniors*<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n An introduction to the basic principles and techniques of artificial intelligence. Topics will include specific AI techniques, a range of application areas, and connections between AI and other areas of study (i.e., philosophy, psychology). Techniques may include heuristic search, automated reasoning, machine learning, deliberative planning and behavior-based agent control. Application areas include robotics, games, knowledge representation, and natural language processing. This course involves programming in Python; students should have a basic familiarity with Python or be prepared to learn Python during the course. This course counts as the capstone. Prerequisite(s): COMP 221; or (COMP 127 and STAT 253); or permission of instructor.\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n Writing WP\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n

COMP 487-01 10212<\/span><\/td>\n Computer Security and Privacy<\/td>\n \n Days: <\/span>M W F \n <\/td>\n \n Time: <\/span>01:10 pm-02:10 pm\n <\/td>\n \n Room: <\/span> \n <\/td>\n \n Instructor: <\/span>Abby Marsh\n <\/td>\n \n \n <\/td>\n <\/tr>\n
\n

<\/p>\n

\n
\n \n Details\n <\/a>\n
\n

\n An introduction to computer security and privacy. Topics will include privacy, threat modeling, software security, web tracking, web security, usable privacy and security, authentication, anonymity, network security, social engineering, the relationship of the law to security and privacy, and ethics. This course will include hands-on experience with security exploits in a Linux environment and student-led discussions of research papers. Students will complete a capstone project in a security- or privacy-related topic of their choice. Prerequisite(s): COMP 240\n <\/p>\n

\n General Education Requirements:<\/strong>\n \n \n <\/p>\n

\n Distribution Requirements:<\/strong>\n \n \n Natural science and mathematics\n \n \n <\/p>\n

\n \n Course Materials<\/strong>\n <\/a>\n <\/p>\n <\/div>\n <\/div>\n <\/div>\n <\/td>\n <\/tr>\n \n <\/tbody>\n <\/table>\n<\/div>\n\n \n\n \n \n \n\n \n\n \n<\/div>","protected":false},"excerpt":{"rendered":"","protected":false},"author":1,"featured_media":0,"parent":258,"menu_order":0,"comment_status":"open","ping_status":"open","template":"","meta":{"_acf_changed":false,"footnotes":""},"class_list":["post-257","page","type-page","status-publish","hentry"],"acf":[],"_links":{"self":[{"href":"https:\/\/www.macalester.edu\/mscs\/wp-json\/wp\/v2\/pages\/257","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.macalester.edu\/mscs\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.macalester.edu\/mscs\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.macalester.edu\/mscs\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.macalester.edu\/mscs\/wp-json\/wp\/v2\/comments?post=257"}],"version-history":[{"count":2,"href":"https:\/\/www.macalester.edu\/mscs\/wp-json\/wp\/v2\/pages\/257\/revisions"}],"predecessor-version":[{"id":1583,"href":"https:\/\/www.macalester.edu\/mscs\/wp-json\/wp\/v2\/pages\/257\/revisions\/1583"}],"up":[{"embeddable":true,"href":"https:\/\/www.macalester.edu\/mscs\/wp-json\/wp\/v2\/pages\/258"}],"wp:attachment":[{"href":"https:\/\/www.macalester.edu\/mscs\/wp-json\/wp\/v2\/media?parent=257"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}