Global Arc

1
Search International Offerings

You can now simultaneously browse international opportunities and on-campus courses; the goal is to plan coursework — before and/or after your trip — that will deepen your experiences abroad.

2
Add Your Favorites

Log in and add international activities and relevant courses to your Global Arc.

3
Get Advice

Download your Arc and share with your academic adviser, who can help you refine your choices.

4
Enroll, Apply and Commit

Register for on-campus classes through TigerHub, and apply for international experiences using Princeton’s Global Programs System.

5
Revisit and Continue Building

Return to the Global Arc throughout your Princeton career as you delve deeper into your interests. 

Search Clear
Go to My Global Arc

Refine search results

Subject

Displaying 3841 - 3850 of 4003
Close icon
Computer Science
Theory of Computation
Studies the limits of computation by identifying tasks that are either inherently impossible to compute, or impossible to compute within the resources available. Introduces students to computability and decidability, Godel's incompleteness theorem, computational complexity, NP-completeness, and other notions of intractability. This course also surveys the status of the P versus NP question. Additional topics may include: interactive proofs, hardness of computing approximate solutions, cryptography, and quantum computation. Two lectures, one precept. Prerequisite: 240 or 341, or instructor's permission.
COS 487 MAT 407
Close icon
Computer Science
Introduction to Analytic Combinatorics
Analytic Combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the scientific analysis of algorithms in computer science and for the study of scientific models in many other disciplines. This course combines motivation for the study of the field with an introduction to underlying techniques, by covering as applications the analysis of numerous fundamental algorithms from computer science. The second half of the course introduces Analytic Combinatorics, starting from basic principles.
COS 488 MAT 474
Close icon
Computer Science
Special Topics in Computer Science
These courses cover one or more advanced topics in computer science. The courses are offered only when there is an opportunity to present material not included in the established curriculum; the subjects vary from term to term. Three classes.
COS 495
Close icon
Computer Science
Special Topics in Computer Science
These courses cover one or more advanced topics in computer science. The courses are offered only when there is an opportunity to present material not included in the established curriculum; the subjects vary from term to term. Three classes.
COS 496
Close icon
Computer Science
Senior Independent Work (B.S.E. candidates only)
Offered in the fall, seniors are provided with an opportunity to concentrate on a "state-of-the-art" project in computer science. Topics may be selected from suggestions by faculty members or proposed by the student. B.S.E. candidates only.
COS 497
Close icon
Computer Science
Senior Independent Work (B.S.E. candidates only)
Offered in the spring, seniors are provided with an opportunity to concentrate on a "state-of-the-art" project in computer science. Topics may be selected from suggestions by faculty members or proposed by the student. B.S.E. candidates only.
COS 498
Close icon
Computer Science
Senior Independent Work-Resubmission
No description available
COS 498R
Close icon
Atelier
Princeton Atelier
-
ATL 494 CWR 494 LA
Close icon
Atelier
Princeton Atelier
-
ATL 495 THR 495 LA
Close icon
Atelier
Princeton Atelier
-
ATL 496 CWR 496 VIS 493 LA