Assess students' ability to analyze and compare time and space complexity trade-offs among the Naive, KMP, Rabin–Karp, and Boyer–Moore string-matching algorithms. Scope includes deriving worst-case and average-case running times, preprocessing and auxiliary space (failure tables, skip tables, rolling hashes), effects of alphabet size and hash collisions, and choosing the best algorithm given specific constraints and datasets; require concise complexity calculations and justification.