Complexity analysis, core data structures, and the standard sorting/graph algorithms — with a split analysis/implementation exam.
Download course · 49 MBRenamed from CSE1305. Content unchanged.
Two separate tracks, Analysis and Implementation. Week 5: formative, ungraded midterms in both. Week 10: summative finals. Passing requires Analysis Final ≥5 AND Implementation Final ≥5; Final Grade = average of the two, which must be ≥5.8 overall — falling short on either track fails the course regardless of the average. Analysis exam: ~50% MC + 50% open (recurrences, proofs, algorithm design); one handwritten A4 cheat sheet allowed. Implementation exam: WebLab coding tasks; non-compiling code scores 0. Resit uses the best of original/resit per track under the same passing rule.