ENROLL Course Search

NOTE: There are some inconsistencies in the course listing data - ITS is looking into the cause.

Alternatives: For requirement lists, please refer to the current catalog. For up-to-the-minute enrollment information, use the "Search for Classes" option in The Hub. If you have any other questions, please email registrar@carleton.edu.

NOTE: Course Section Search in ENROLL will be discontinued starting May 1st. Course Search will continue to work on the Academic Catalog and in Workday.
Saved Courses (0)

Your search for courses for 18/FA and with code: MATHDISCRETE found 3 courses.

Revise Your Search New Search

CS 252.00 Algorithms 6 credits

Closed: Size: 34, Registered: 37, Waitlist: 0

Leighton 304

MTWTHF
9:50am11:00am9:50am11:00am9:40am10:40am

Requirements Met:

Other Tags:

Synonym: 51293

David Liben-Nowell

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.

Prerequisite: Computer Science 201 and Computer Science 202 (Mathematics 236 will be accepted in lieu of Computer Science 202)

CS 254.00 Computability and Complexity 6 credits

Open: Size: 34, Registered: 20, Waitlist: 0

Boliou 104

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm

Requirements Met:

Other Tags:

Synonym: 51294

Josh Davis

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 finite-state automata, pushdown automata, and Turing machines; formal languages, including regular expressions and context-free grammars; computability and uncomputability; and computational complexity, particularly NP-completeness.

Prerequisite: Computer Science 111 and Computer Science 202 (Mathematics 236 will be accepted in lieu of Computer Science 202)

MATH 333.00 Combinatorial Theory 6 credits

Closed: Size: 30, Registered: 30, Waitlist: 0

CMC 206

MTWTHF
11:10am12:20pm11:10am12:20pm12:00pm1:00pm

Requirements Met:

Other Tags:

Synonym: 51371

Eric Egge

The study of structures involving finite sets. Counting techniques, including generating functions, recurrence relations, and the inclusion-exclusion principle; existence criteria, including Ramsey's theorem and the pigeonhole principle. Some combinatorial identities and bijective proofs. Other topics may include graph and/or network theory, Hall's ("marriage") theorem, partitions, and hypergeometric series.

Prerequisite: Mathematics 236 or instructor permission

Search for Courses

This data updates hourly. For up-to-the-minute enrollment information, use the Search for Classes option in The Hub

Instructional Mode
Class Period
Courses or labs meeting at non-standard times may not appear when searching by class period.
Requirements
You must take 6 credits of each of these.
Overlays
You must take 6 credits of each of these,
except Quantitative Reasoning, which requires 3 courses.
Special Interests