CMSC 315

Design, analysis, and implementation of advanced computer algorithms. Emphasis is given to problem-solving techniques, including the greedy method, divide-and-conquer, and dynamic programming. Specific problem domains vary. Topics may include sorting, graphs, networks, computational geometry, NP-completeness, approximation algorithms, text processing, distributed systems, and numerical algorithms. Three lecture and one laboratory hour per week.