CSC 301 Data structure and algorithms Resit 2024

About this paper

CSC 301: First Semester Resit Examination, Wednesday 17/01/2024, 13:00-15:00, Dr. Achankeng P. \& Mr. Kometa D., U-Block F/G, University of Buea, Faculty of Science, Dept of Computer Science: source carries a handwritten name/signature annotation in the margin, not transcribed. Seven short-answer items (DSA usefulness, contiguous/noncontiguous storage, cursor implementation, sentinel/heap concepts, linked-list vs.\ general-tree node representations, Kruskal's/Dijkstra's algorithm uses, topological sort, four pointer types, a flagged-illegible Floyd-Warshall source figure answered via the full general method, BFS/DFS sketches, and a fully-traced order-4 B-Tree construction for 1 through 15 plus a Red-Black Tree insertion fix-up explanation); Section B's match-the-activity exercise, Yes/No justification items, fill-in-the-blank paragraph, four sorting-algorithm demonstrations (Insertion/Selection/Bubble/Radix Sort) on one list, Linear/Binary Search pseudocode, a complete array-based C Stack ADT program, and a bonus linear-probing hash-table insertion.