Search Results
Your search for courses · during 25SP · tagged with CS Required for Major · returned 9 results

CS 111 Introduction to Computer Science 6 credits
This course will introduce you to computer programming and the design of algorithms. By writing programs to solve problems in areas such as image processing, text processing, and simple games, you will learn about recursive and iterative algorithms, complexity analysis, graphics, data representation, software engineering, and objectoriented design. No previous programming experience is necessary.
 Spring 2025
 FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning

NOT open to students who have completed any of the following course(s): CS 201 or greater with a grade of C or better.

CS 201 Data Structures 6 credits
Think back to your favorite assignment from Introduction to Computer Science. Did you ever get the feeling that “there has to be a better/smarter way to do this problem”? The Data Structures course is all about how to store information intelligently and access it efficiently. How can Google take your query, compare it to billions of web pages, and return the answer in less than one second? How can one store information so as to balance the competing needs for fast data retrieval and fast data modification? To help us answer questions like these, we will analyze and implement stacks, queues, trees, linked lists, graphs, and hash tables. Students who have received credit for a course for which Computer Science 201 is a prerequisite are not eligible to enroll in Computer Science 201.
 Spring 2025
 FSR, Formal or Statistical Reasoning QRE, Quantitative Reasoning

Student has completed any of the following course(s): CS 111 – Introduction to Computer Science with a grade of C or better or a score of 4 or better on the Computer Science A AP exam or equivalent. Not open to students that have taken CS 200 – Data Structures with Problem Solving.

CS 202 Mathematics of Computer Science 6 credits
This course introduces some of the formal tools of computer science, using a variety of applications as a vehicle. You’ll learn how to encode data so that when you scratch the back of a DVD, it still plays just fine; how to distribute “shares” of your floor’s PIN so that any five of you can withdraw money from the floor bank account (but no four of you can); how to play chess; and more. Topics that we’ll explore along the way include: logic and proofs, number theory, elementary complexity theory and recurrence relations, basic probability, counting techniques, and graphs.
 Spring 2025
 FSR, Formal or Statistical Reasoning

Student has completed any of the following course(s): CS 111 – Introduction to Computer Science with a grade of C or better or received a score of 4 or better on the AP Computer Science exam AND MATH 101 – Calculus with Problem Solving or MATH 111 – Introduction to Calculus or greater with a grade of C or better or greater or received a score of 4 or better on the Calculus AB AP exam or received a score of 4 or better on the Calculus BC AP exam or received a score of 5 or better on the Mathematics IB exam or equivalent.

CS 202.00 Spring 2025
 Faculty:Eric Alexander 🏫 👤
 Size:28
 M, WAnderson Hall 329 12:30pm1:40pm
 FAnderson Hall 329 1:10pm2:10pm

CS 208 Introduction to Computer Systems 6 credits
Are you curious what’s really going on when a computer runs your code? In this course we will demystify the machine and the tools that we use to program it. Our broad survey of how computer systems execute programs, store information, and communicate will focus on the hardware/software interface, including data representation, instruction set architecture, the C programming language, memory management, and the operating system process model.
 Spring 2025
 FSR, Formal or Statistical Reasoning

Student has completed any of the following course(s): CS 200 – Data Structures with Problem Solving or CS 201 – Data Structures with a grade of C or better or equivalent.

CS 208.01 Spring 2025
 Faculty:Tanya Amert 🏫 👤
 Size:28
 M, WLeighton 305 1:50pm3:00pm
 FLeighton 305 2:20pm3:20pm

CS 251 Programming Languages: Design and Implementation 6 credits
What makes a programming language like “Python” or like “Java”? This course will look past superficial properties (like indentation) and into the soul of programming languages. We will explore a variety of topics in programming language construction and design: syntax and semantics, mechanisms for parameter passing, typing, scoping, and control structures. Students will expand their programming experience to include other programming paradigms, including functional languages like Scheme and ML.
 Spring 2025
 FSR, Formal or Statistical Reasoning

Student has completed any of the following course(s): CS 200 – Data Structures with Problem Solving or CS 201 – Data Structures with a grade of C or better or equivalent.

CS 251.00 Spring 2025
 Faculty:David Musicant 🏫 👤
 Size:28
 M, WLanguage & Dining Center 104 9:50am11:00am
 FLanguage & Dining Center 104 9:40am10:40am

CS 251.02 Spring 2025
 Faculty:Bridger Herman 🏫 👤
 Size:34
 M, WLeighton 305 11:10am12:20pm
 FLeighton 305 12:00pm1:00pm

CS 252 Algorithms 6 credits
A course on techniques used in the design and analysis of efficient algorithms. We will cover several major algorithmic design paradigms (greedy algorithms, dynamic programming, divide and conquer, and network flow). Along the way, we will explore the application of these techniques to a variety of domains (natural language processing, economics, computational biology, and data mining, for example). As time permits, we will include supplementary topics like randomized algorithms, advanced data structures, and amortized analysis.
 Spring 2025
 FSR, Formal or Statistical Reasoning

Student has completed any of the following course(s): CS 200 – Data Structures with Problem Solving or CS 201 – Data Structures AND CS 202 – Mathematics of Computer Science or MATH 236 – Mathematical Structures with a grade of C or better or equivalent. MATH 236 will be accepted in lieu of Computer Science 202.

CS 252.00 Spring 2025
 Faculty:Eric Alexander 🏫 👤
 Size:34
 M, WHulings 316 9:50am11:00am
 FHulings 316 9:40am10:40am

CS 254 Computability and Complexity 6 credits
An introduction to the theory of computation. What problems can and cannot be solved efficiently by computers? What problems cannot be solved by computers, period? Topics include formal models of computation, including finitestate automata, pushdown automata, and Turing machines; formal languages, including regular expressions and contextfree grammars; computability and uncomputability; and computational complexity, particularly NPcompleteness.
 Spring 2025
 FSR, Formal or Statistical Reasoning

Student has completed any of the following course(s): CS 200 – Data Structures with Problem Solving or CS 201 – Data Structures AND CS 202 – Mathematics of Computer Science or MATH 236 – Mathematical Structures with a grade of C or better or equivalent. MATH 236 will be accepted in lieu of Computer Science 202.

CS 254.00 Spring 2025
 Faculty:Layla Oesper 🏫 👤
 Size:34
 M, WHulings 316 12:30pm1:40pm
 FHulings 316 1:10pm2:10pm

CS 257 Software Design 6 credits
It’s easy to write a mediocre computer program, and lots of people do it. Good programs are quite a bit harder to write, and are correspondingly less common. In this course, we will study techniques, tools, and habits that will improve your chances of writing good software. While working on several mediumsized programming projects, we will investigate code construction techniques, debugging and profiling tools, testing methodologies, UML, principles of objectoriented design, design patterns, and user interface design.
 Spring 2025
 FSR, Formal or Statistical Reasoning

Student has completed any of the following course(s): CS 200 – Data Structures with Problem Solving or CS 201 – Data Structures with a grade of C or better or equivalent.

CS 257.01 Spring 2025
 Faculty:Jeff Ondich 🏫 👤
 Size:28
 M, WAnderson Hall 329 8:30am9:40am
 FAnderson Hall 329 8:30am9:30am

CS 257.02 Spring 2025
 Faculty:Anya Vostinar 🏫 👤
 Size:28
 M, WAnderson Hall 329 11:10am12:20pm
 FAnderson Hall 329 12:00pm1:00pm

MATH 111 Introduction to Calculus 6 credits
An introduction to the differential and integral calculus. Derivatives, antiderivatives, the definite integral, applications, and the fundamental theorem of calculus.
Not open to students who have received credit for MATH 101
 Spring 2025
 FSR, Formal or Statistical Reasoning

Student has received a score of 111 on the Carleton Math Placement exam. Not open to students who have received credit for Mathematics 101 or received a score of 4 or better on the Calculus AB AP exam or received a score of 4 or better on the Calculus BC AP exam or received a score of 5 or better on the Calculus IB exam. For more information, see the Mathematics' web page.