CSC 301 Data structure and Algorithms Resit 2026

About this paper

CSC 301: First Semester Resit Examination, Wednesday 04/03/2026, 08:00-10:00, Dr. Achankeng P. \& Mr. Kometa D., U-Block G, University of Buea, Faculty of Science, Dept of Computer Science: Section A's Binary-Tree/BST/Splaying/AVL/MST definitions, a fully-traced BST construction with a flagged duplicate key, a doubly-linked-list reconstruction via MakeListLeft/MakeListRight constructors from a legible figure, a fully-traced order-5 B-Tree node-split insertion, a flagged-illegible overlapping-arrow graph answered via the full Kruskal's-Algorithm method (noting Kruskal's builds a spanning tree rather than a point-to-point shortest path), and a complete, verified Dijkstra's-Algorithm single-source shortest-path trace on a clearly legible graph; Section B's Yes/No justifications, fill-in paragraph, Selection/Merge Sort demonstrations, Linear/Binary Search pseudocode, plus both offered electives answered -- a cyclic-array C Queue-struct method set with a read-and-display demo function, and an infix-to-postfix trace for a quadratic-discriminant-style expression alongside a full C MobileMoney-ADT design (Transfer/CheckBalance with pin-attempt blocking).