— Algorithm Design & Analysis

Prerequisites & course information

This version has ended; see updated course, below. Course Description: Theory and practice of hard problems, and problems with complex algorithm solutions. NP-completeness, approximation algorithms, randomized algorithms, dynamic programming and branch and bound. Theoretical analysis, implementation and practical evaluations. Examples from parallel, string, graph, and geometric algorithms. Learning Activities: Lecture 3 hour(s), Discussion 1 hour(s). Enrollment Restriction(s): Pass One open to Computer Science, Computer Science Engineering, and Computer Engineering Majors only. Grade Mode: Letter. General Education: Science & Engineering (SE); Quantitative Literacy (QL). ECS 122B — Algorithm Design & Analysis (4 units) Course Description: Theory and practice of hard problems, and problems with complex algorithm solutions. NP-completeness, approximation algorithms, randomized algorithms, dynamic programming and branch and bound. Theoretical analysis, implementation and practical evaluations. Examples from parallel, string, graph, and geometric algorithms. Prerequisite(s): ECS 122A ; (ECS 060 or ECS 034 or ECS 036C ). Learning Activities: Lecture 3 hour(s), Discussion 1 hour(s). Enrollment Restriction(s): Pass One open to Computer Science, Computer Science Engineering, Computer Engineering Majors only. Grade Mode: Letter. General Education: Science & Engineering (SE). This course version is effective from, and including: Winter Quarter 2027. Learning Activities: Lecture 3 hour(s), Discussion 1 hour(s). Enrollment Restriction(s): Pass One open to Computer Science, Computer Science Engineering, and Computer Engineering Majors only. Grade Mode: Letter. General Education: Science & Engineering (SE); Quantitative Literacy (QL). ECS 122B — Algorithm Design & Analysis (4 units) Course Description: Theory and practice of hard problems, and problems with complex algorithm solutions. NP-completeness, approximation algorithms, randomized algorithms, dynamic programming and branch and bound. Theoretical analysis, implementation and practical evaluations. Examples from parallel, string, graph, and geometric algorithms. Prerequisite(s): ECS 122A ; (ECS 060 or ECS 034 or ECS 036C ). Learning Activities: Lecture 3 hour(s), Discussion 1 hour(s). Enrollment Restriction(s): Pass One open to Computer Science, Computer Science Engineering, Computer Engineering Majors only. Grade Mode: Letter. General Education: Science & Engineering (SE). This course version is effective from, and including: Winter Quarter 2027.