Print
Home  ›  Schedule of Classes  ›  Ecatalog Course Detail

Ecampus Schedule of Classes - All Terms

College of Engineering

CS 529 – Selected Topics in Theoretical Computer Science (1-5)

Topics of interest in algorithms and theory of computation. Topics include approximation algorithms, planar graph algorithms, distributed algorithms, combinatorial optimization, computational geometry. This course is repeatable for a maximum of 99 credits. This course may be subject to Enforced Prerequisites that restrict registration into the course. Check the offerings below for more information.

For more information, contact OSU Ecampus at 800-667-1465 (option 1) or ecampus.ess@oregonstate.edu.

Continue to Registration.

TermCRNSecCrP/NInstructorTypeStatusCapAvailWL CapWL Avail
W25360634014StaffOnline Open494900
Section Title: Special Topic: Cryptography
Registration Restrictions
Recommended: CS 515
College Limitations: +16 (Engr)
Level Limitations: +02 (Graduate)
Class Notes: Does not meet Graduate School's stand-alone requirement. This course requires online proctored testing, which may include testing fees and the use of security measures, such as a scan of your testing environment. Please carefully review online proctor test information at: https://ecampus.oregonstate.edu/services/proctoring .
Syllabus: Available in Canvas to students enrolled in this course. Computer Science syllabi may also be found on the Electrical Engineering and Computer Science classes page.
Find textbooks for CS 529 at the OSU Beaver Store (current term only). For questions related to course materials, contact the OSU Beaver Store.

Legend
= Signifies the course as a Baccalaureate Core Course.
= Signifies that fees may apply to the course.
+ = Include restriction.
- = Exclude restriction.
* = Prereq may be taken prior to or simultaneously with this course.