Algorithms, Network and Optimization (ANO) Subplan Requirements
What is a Subplan?
A subplan is an optional enhancement to the Professional MS in Computer Science (MSCPS) degree program allowing students to demonstrate a high level of expertise in a sub-field of Computer Science.Ìý
Current students in the MSCPS program have the option to declare exactly one (1) subplan.
The ANO subplan will appear on the student’s transcript asÌýSpecialization in Algorithms, Network and Optimization; the subplan does not appear on the diploma.
Completing a Subplan
MSCPS students interested in adding a subplan must officially declare their subplan. Subplans are not automatically added, even if a student meets the requirements for the subplan.
If an MSCPS student officially declares a subplan, they are responsible for completing the subplan requirements in order to graduate with the MSCPS degree. If a student has otherwise completed the MSCPS requirements but not the subplan requirements, they will not be eligible to graduate until they complete the subplan requirements or drop the subplan before the deadline.
MSCPS students can declare a subplan after their first semester and no later than the add deadline of their final semester. No more than one change request (add/drop/swap) is permitted, pending extenuating circumstances. To declare a subplan, submit the Degree / Option Change request form (Forms & Policies).
Degree Requirements - MSCPS with ANO Subplan
The MSCPS with ANO subplan requires 30 credit hours of graduate coursework according to theÌýMSCPS degree requirements and the requirements for the ANO subplan:
- Breadth (BIN) courses (9 credit hours)
- Computer Science courses are listed in the three differentÌýbreadth bins.
- Students must earn a B or better (not a B-) in at leastÌýoneÌý5000-level course (not 6000 or higher) from each of theÌý³Ù³ó°ù±ð±ðÌýbins.
- By petition to the Graduate Committee, similar transferred graduate work done elsewhere may be used to satisfy part of this requirement.Ìý
- ProjectÌýcourses (6 credit hours)
- 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.
- ElectiveÌýcourses (15 credit hours)
- 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 Breadth and/or Elective courses towards the ANO subplan requirements. This means:
- Students may count an eligible course towards BOTH Breadth requirement AND a subplan requirement.
- If the student does not need to count an eligible course towards the Breadth requirement, the course can count towards BOTH an Elective requirement AND a subplan requirement.
- For example, if a student earned a ‘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.
Algorithms, Network and Optimization (ANO) Subplan Course Options
- CSCI 5114 -ÌýPractical Algorithmic Complexity ()
- CSCI 5254 - Convex Optimization (,ÌýSyllabus)
- CSCI 5352 -ÌýNetwork Analysis and Modeling (,ÌýSyllabus)
- CSCI 5434 -ÌýProbability for Computer Science (,ÌýSyllabus)
- CSCI 5444 -ÌýTheory of Computation (,ÌýSyllabus)
- CSCI 5454 -ÌýDesign & Analysis of Algorithms (,ÌýSyllabus)
- ​CSCI 5654 -ÌýLinear Programming (,ÌýSyllabus)
- CSCI 5676 -ÌýNumerical Optimization ()
- CSCI 6114 -ÌýComputational Complexity Theory ()
- CSCI 6214 -ÌýRandomized AlgorithmsÌý()
- CSCI 6314 -ÌýAlgorithmic EconomicsÌý()