CSC 207 Introduction to Algorithm Exam 2024

About this paper

CSC 207: First Examination 2023/2024, 24/01/2024, University of Buea (a multi-section bundle scanned as one file): Section A, 24 MCQs (the first 6 identical to Paper 5's Question two, the remainder new -- call-by-reference variants, a swap-without-temp precondition puzzle, binary-search termination, a loop invariant, a recursive-function trace, homogeneous-data terminology, ADT definition, and full-binary-tree leaf counting); Section B Question one (an employee-wages algorithm/flowchart) and Question two (asymptotic notation, identical to Paper 3's Q1, cross-referenced); further Section B content comprising a REPEAT-loop power-computation trace, a List-rearranging trace using a '\textless' comparison (independently traced and explicitly distinguished from Paper 1's '\textgreater' version), an 8-function tight-bound-matching exercise, and a student-ranking pseudocode/flowchart problem (registration-cap warning, grade averaging, Excellent/Very Good/Good/Failed ranking).