| |
Apr 28, 2026
|
|
|
|
|
2026-2027 UH Mānoa Catalog [DRAFT]
|
ICS 311 - Algorithms
Credits: 4
(4 1-hr Lec) Design and correctness of algorithms, including divide-and-conquer, greedy and dynamic programming methods. Complexity analyses using recurrence relations, probabilistic methods, and NP-completeness. Applications to order statistics, disjoint sets, B-trees and balanced trees, graphs, network flows, and string matching.
Prerequisites: ICS 211 , and [(ICS 241 or ECE 362 ) and (MATH 216 or MATH 242 or MATH 252A )] or (MATH 301 and MATH 372 ); or consent.
|
|
