— Algorithm Design & Analysis
This version has ended; see updated course, below. Course Description: Complexity of algorithms, bounds on complexity, analysis methods. Searching, sorting, pattern matching, graph algorithms. Algorithm design techniques: divide-conquer, greedy, dynamic programming. Approximation methods. NP-complete problems.
Prerequisites & course information
This version has ended; see updated course, below. Course Description: Complexity of algorithms, bounds on complexity, analysis methods. Searching, sorting, pattern matching, graph algorithms. Algorithm design techniques: divide-conquer, greedy, dynamic programming. Approximation methods. NP-complete problems. 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). ECS 122A — Algorithm Design & Analysis (4 units) Course Description: Complexity of algorithms, bounds on complexity, analysis methods. Searching, sorting, pattern matching, graph algorithms. Algorithm design techniques: divide-conquer, greedy, dynamic programming. Approximation methods. NP-complete problems. Prerequisite(s): ECS 020 ; (ECS 060 or ECS 032B 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, and Applied Physics 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). ECS 122A — Algorithm Design & Analysis (4 units) Course Description: Complexity of algorithms, bounds on complexity, analysis methods. Searching, sorting, pattern matching, graph algorithms. Algorithm design techniques: divide-conquer, greedy, dynamic programming. Approximation methods. NP-complete problems. Prerequisite(s): ECS 020 ; (ECS 060 or ECS 032B 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, and Applied Physics Majors only. Grade Mode: Letter. General Education: Science & Engineering (SE). This course version is effective from, and including: Winter Quarter 2027.
Sources
- Course catalogue ↗2026-2027