CEC 305 Data Structures and Algorithms Exam 2024

About this paper

CEC 305: First Examination 2023/2024, 17/01/2024 (printed date reads 17/01/2023, a year behind the printed exam year and month/year field; reproduced using the exam-year-consistent date, flagged) (instructor Nyanga B.), University of Buea: Section A, the same 32-question MCQ set as Paper 4's Section B (the source's own printed numbering duplicates '6' and skips '7', corrected here to a clean sequential 1-24 -- this paper's Section A only reproduces the first 24 of Paper 4's 32 Section-B questions, omitting items 25-32); Section B, four new True/False statements on self-referential classes, dynamic variables, and linked-list length/memory order; Section C: (Q1) DFS/BFS traversal trees of the same 8-vertex graph as Paper 4 and the adjacency matrix of the same directed 6-vertex graph (without the MST sub-question); (Q2) pre-order, post-order and in-order traversal of a 16-node variant of the Metamorphosis word-tree (AWOKE gains an extra leaf child 'A'); (Q3) Big-O worst-case analysis of two pseudocode functions (a triply-nested loop, and a halving tail-recursive function); (Q4) a hash-table exercise (linear probing, load factor, quadratic probing, and a discussion of table-size choice) -- identical in content to Paper 7's Section B Q1.