| Number | CMSC 245 |
| Title | Algorithms and Advanced Data Structure II |
| Description | Advanced topics in algorithmic graph theory, efficient polynomial and matrix algorithms, number-theoretic algorithms, string processing and computational geometry; design and analysis of parallel algorithms; the theory of NP-completeness and approximation algorithms. |
| Prerequisite | CMSC 244 |
| Semester offered | Second |
| Credit | 3 units |
| Hours/week | 3 hrs class |
At the end of the course, the student should be able to: