CSC 301 Data structure and algorithm CA 2024

About this paper

CSC 301: First Semester Test 1, Friday 28/11/2024, 1h30min, Dr Achankeng \& Mr Kometa, AMPHI 600, University of Buea, Faculty of Science, Dept of Computer Science: source carries a faint handwritten margin note and scratch marks, not used as the answer source (the Program = Algorithms + Data Structures relationship given in the solution is independently stated textbook knowledge, not copied from the handwriting). Section A's six Yes/No theory justifications (stack dynamic-sizing, string-as-ADT, linear-search sorting myth, ADT implementability, array-deletion growth rate, constant-vs-linear growth-rate interpretation), a non-cyclic-array priority-queue method proposal, a fully-traced infix-to-postfix conversion (with exponentiation) shown as a table, and an all-occurrences-count search pseudocode; Section B's computer-program definition, the Program/DS/Algorithm relationship, and two C pointer-behaviour demonstration programs (plain pointer and pointer-to-pointer; struct and union pointer access).