The pre-requisites listed in this catalog are those approved by the Curriculum Committee.
For pre-requisite information specific to an individual instance of a course, please see the schedule of classes. Click the Schedule Type to find available offerings of the course on the Schedule of Classes. |
CS 3511 - Algorithms Honors |
Techniques of design and analysis of efficient algorithms for standard computational problems. NP-Completeness Project. Credit not allowed for both CS 3511 and CS 3510.
3.000 Credit hours 3.000 Lecture hours Grade Basis: ALP All Sections for this Course Dept/Computer Science Department |