CSE 6332
Transcript Abbreviation:
Advanced Algs
Course Description:
Advanced graph algorithms, string algorithms, linear programming, matrix operations, Fourier transforms, randomized algorithms, approximation algorithms, geometric algorithms.
Course Levels:
Graduate (5000-8000 level)
Designation:
Elective
General Education Course:
(N/A)
Cross-Listings:
(N/A)
Credit Hours (Minimum if “Range”selected):
3.00
Max Credit Hours:
3.00
Select if Repeatable:
Off
Maximum Repeatable Credits:
(N/A)
Total Completions Allowed:
(N/A)
Allow Multiple Enrollments in Term:
No
Course Length:
14 weeks (autumn or spring)
12 weeks (summer only)
Off Campus:
Never
Campus Location:
Columbus
Instruction Modes:
In Person (75-100% campus; 0-24% online)
Prerequisites and Co-requisites:
Prereq: 6331 (780).
Electronically Enforced:
No
Exclusions:
Not open to students with credit for 790 or 794A.
Course Goals / Objectives:
Be familiar with advanced topics in algorithms such as advanced graph algorithms, string algorithms, linear programming, matrix operations, Fourier transforms, randomized algorithms, approximation algorithms, geometric algorithms
Master a subset of algorithms: Linear programming, advanced graph algorithms, approximation algorithms
Be familiar with how to design algorithms for problems in applications
Check if concurrence sought:
No
Contact Hours:
| Topic | LEC | REC out-of-class | REC in-class | Weekly LAB out-of-class | Weekly LAB in-class |
|---|---|---|---|---|---|
| Advanced graph algorithms | 8.0 | 0.0 | 0 | 0.0 | 0 |
| Linear programming | 5.0 | 0.0 | 0 | 0.0 | 0 |
| Fourier transforms and matrix operations | 5.0 | 0.0 | 0 | 0.0 | 0 |
| String algorithms | 5.0 | 0.0 | 0 | 0.0 | 0 |
| Randomized algorithms | 6.0 | 0.0 | 0 | 0.0 | 0 |
| Approximation algorithms | 7.0 | 0.0 | 0 | 0.0 | 0 |
| Geometric algorithms | 6.0 | 0.0 | 0 | 0.0 | 0 |
| Total | 42 | 0 | 0 | 0 | 0 |
Grading Plan:
Letter Grade
Course Components:
Lecture
Grade Roster Component:
Lecture
Credit by Exam (EM):
No
Grades Breakdown:
| Aspect | Percent |
|---|---|
| Homework | 30% |
| Midterm exam | 30% |
| Final Exam | 40% |
Representative Textbooks and Other Course Materials:
| Title | Author | Year |
|---|---|---|
| Introduction to Algorithms | T.H. Cormen, C. E. Leiserson, R. L. Rivest, C. Stein | |
| Course notes, papers | Supplied by the instructor |
ABET-CAC Criterion 3 Outcomes:
(N/A)
ABET-ETAC Criterion 3 Outcomes:
(N/A)
ABET-EAC Criterion 3 Outcomes:
(N/A)
Embedded Literacies Info: