CSC 207 Introduction to Algorithm Exam 2021

About this paper

CSC 207: First Semester Examination, Saturday 22/05/2021 (instructors Dr. William Shu / Mr. Roger Mawoh), University of Buea: Q1, a List-rearranging algorithm trace table (initial List 43,25,37,81,18,70,64,96,52,4, using a '>' adjacent-swap pass), re-application of the algorithm to the rearranged list, an ascending-sort modification with invariant/termination/Big-O analysis; Q2, an Agent CALCUL call-by-value/call-by-name program trace, a BNF-to-syntax-diagram conversion plus error-checking of three assignment statements, and a discussion of pseudo-algorithms' termination/determinism/correctness requirements; plus a reused question-bank block of 7 further MCQs (summation-loop operation count and growth order, a stack push/pop trace, sorting-algorithm input-order sensitivity, a PrintItems linked-list recursive-print trace, a grade-capping missing-code selection, and a FIFO-collection data-structure choice).