Ecampus Schedule of Classes - All Terms

College of Engineering

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

Continue to Registration.

TermCRNSecCrP/NInstructorTypeStatusCapAvailWL CapWL Avail
F23179984004StaffOnline Open494900
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:
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 514 at the OSU Beaver Store (current term only). For questions related to course materials, contact the OSU Beaver Store.

= 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.