Computer Engineering & Computer Science (CECS)
*428. Analysis of Algorithms (3)
- Prerequisite: CECS 328.
- Applications of standard combinatorial techniques to applied programming problems. Rigorous analysis of correctness/complexity of algorithms. Advanced graph algorithms are emphasized. Topics include shortest paths on graphs, sorting, string matching, union find problem, divide-and-conquer technique, and weighted-edge problem.
- (Lecture 2 hours, laboratory 3 hours.) Letter grade only (A-F).
View the course offerings:
Computer Engineering &Computer Science (CECS)
Additional Official Program Information
- Links to CSULB catalog and schedule of classes
*Note: although every effort is made to keep this Web site
up to date, you should also consult the printed catalog for official
information and program requirements, which may vary depending on the
year you enter(ed) the program.
CECS Graduate Courses 519/619 - 590/690
CECS Graduate Courses 621/521 - 698