Algorithms, Network and Optimization (ANO) Subplan Requirements
Degree Requirements
- Students enrolled in the Professional MS in Computer Science (MSCPS) program with the Algorithms, Network and Optimization (ANO) subplan must complete 30 credit hours of graduate coursework that align with the MSCPS degree requirements, including the requirements for the ANO subplan:
- 9 hours - Bin/Breadth courses
- You must earn a grade of ‘B’ or better to satisfy each of the three BIN/breadth course requirements.
- 6 hours - Project courses
- Students must complete both project courses from one project course sequence.
- Students must earn grades of ‘B’ or better in both courses.
- Students cannot count just one project course to the degree.
- 15 hours - Elective courses
- You may take up to two, approved, non-CS courses.
- Any non-Computer Science courses that can count towards a subplan will count against the two maximum allowable non-CS classes.
- ANO Subplan courses
- Must complete at least 12 credit hours of eligible ANO subplan courses with a grade of ‘B’ or better.
- Counting courses for the ANO subplan
- Students can satisfy subplan requirements by counting eligible BIN and/or Elective courses towards the ANO subplan requirements. This means:
- Students may count an eligible course towards BOTH a BIN/breadth requirement AND an ANO subplan requirement.
- If the student does not need to count an eligible course towards the breadth/bin requirement, the course can count towards BOTH an elective requirement AND an ANO subplan requirement.
- For example, if a student got a grade of ‘B’ or higher in CSCI 5434:
- …and still needed to complete their Bin 1 requirement - They could count CSCI 5434 as BOTH their Bin 1 course and as an ANO subplan course.
- …and already completed their Bin 1 requirement - they could count CSCI 5434 as BOTH an Elective course and as an ANO subplan course.
- Students can satisfy subplan requirements by counting eligible BIN and/or Elective courses towards the ANO subplan requirements. This means:
- 9 hours - Bin/Breadth courses
Algorithms, Network and Optimization (ANO) Subplan Course Options
- CSCI 5114 - Practical Algorithmic Complexity
- CSCI 5254 - Convex Optimization
- CSCI 5352 - Network Analysis and Modeling
- CSCI 5434 - Probability for Computer Science
- CSCI 5444 - Theory of Computation
- CSCI 5454 - Design & Analysis of Algorithms
- CSCI 5654 - Linear Programming
- CSCI 5676 - Numerical Optimization
- CSCI 6114 - Computational Complexity Theory
- CSCI 6214 - Randomized Algorithms
- CSCI 6314 - Algorithmic Economics