CSC 301 Data structure and algorithm Resit 2022

About this paper

CSC 301: First Resit Examination 2022/2023, 23/02/2023, 2hrs, CRBLOCK II, Nyanga B. \& Peter A., University of Buea, Faculty of Science, Dept of Computer Science: substantially overlaps Paper 5's question bank (same graded-copy handwritten-answer issue, not used). Section A's 15 True/False items and Section B's MCQ items (1-12, 17-37) are cross-referenced directly from Paper 5's independently-derived answers rather than re-derived, since the item text is verbatim-identical; four new MCQ items (recursion data structure, BST descending-order traversal, an Ackermann-function value computed step by step, and a postfix-expression evaluation) are derived independently. Section C reuses Paper 5's DFS/BFS/Prim's-Kruskal's-statement/adjacency-matrix content (Figures 1-2 unchanged), with a new part (d) flagged: Figure 3's weighted 8-vertex graph has legible edge weights but vertex-circle numerals not reliably distinguishable in the scan, so a fabricated specific MST is avoided in favour of the full Prim's method plus a weight-based partial deduction (the largest weights are excluded, the smallest are included).