CSC 207 Introduction to Algorithm and Complexity Exam 2026

About this paper

CSC 207: First Examination 2023/2024, University of Buea (printed exam date 28/01/2026, an internal inconsistency flagged rather than silently corrected -- see REPORT), Dept of Computer Engineering, instructors Nyanga B./Achankeng P.: Section A, Question one (32 MCQs on insertion/selection/bubble/binary-tree/quicksort/merge-sort properties and complexities, including a 4-way selection-sort-code identification question solved by checking both loop bound and comparison-operator correctness, and a greedy coin-denomination optimality question worked out by direct comparison of greedy vs optimal coin counts for each candidate sum) and Question two (an 8-function asymptotic tight-bound exercise, identical to Papers 6 and 10's); Section B (35 marks), Question1 (10 justified Yes/No items, identical to Paper 10's), Question2 (6 code-output traces, four reproduced from Papers 9/10 and two new -- including a modulo-by-zero source defect at the very first loop iteration, flagged rather than silently patched), Question3 (a Set ADT initSet/contains/insertElement exercise with the same off-by-one loop-bound defect already flagged in Paper 10) and Question4 (a Stack-based ReverseString() algorithm, identical to Paper 10's).