Ecampus fact
Built for online
Choose from nearly 2,000 courses — all of them intentionally designed for online delivery.
Ecampus Schedule of Classes - All Terms
CS 514 – Algorithms: Design, Analysis, and Implementation (4)
Explores sorting and selection algorithms including divide-and-conquer, quicksort/quick select, merge sort, binary search trees, memorization, heaps and heapsort, priority queues, hashing, hashed heaps; asymptotic complexity analysis including the Master equation, tree method, amortization; Dynamic Programming on sequences, graphs, trees, and intervals; Graph algorithms including breadth-first search, depth-first search, topological sort, shortest path, minimum spanning tree, network flow. NP-hard and NP-Complete problems. 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.
Term | CRN | Sec | Cr | P/N | Instructor | Type | Status | Cap | Avail | WL Cap | WL Avail |
---|---|---|---|---|---|---|---|---|---|---|---|
F24 | 16410 | 400 | 4 | Ehsan, S. | Online | Open | 75 | 17 | 0 | 0 | |
Registration Restrictions Recommended: Experience with algorithms and CS 261 or an equivalent undergraduate Data Structures course with a minimum grade of B College Limitations: +16 (Engr) Level Limitations: +02 (Graduate) | |||||||||||
Class Notes: 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. | |||||||||||
F24 | 20157 | 401 | 4 | Ehsan, S. | Online | Open | 25 | 14 | 0 | 0 | |
Registration Restrictions Recommended: Experience with algorithms and CS 261 or an equivalent undergraduate Data Structures course with a minimum grade of B College Limitations: +16 (Engr) Level Limitations: +02 (Graduate) | |||||||||||
Class Notes: 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. |
Features and Navigation
Academic calendar
Currently it's fall term. See academic calendar for our quarter term schedule.
Winter term starts Jan. 6, 2025.
Spring term starts March 31, 2025.