CSC 207 introduction to algorithm CA 2024

About this paper

CSC 207: Test 1, 26/11/2024, University of Buea (a single-page scan bundled into the same source file as Paper 10's remaining pages; only its own content is reproduced here): Section A -- an OrderedSet ADT initSet()/contains() exercise (with an early-exit optimisation proposed for contains(), exploiting the set's declared ordering), an isPalindrome() algorithm, and 3 code-output traces (a switch-default fall-through, a fixed-index loop trace, and a single-increment multiples-of-3 trace, the last explicitly contrasted with this source set's recurring double-increment trap); Section B, the same student-ranking pseudocode/flowchart problem already built in Paper 6, cross-referenced rather than re-derived.