CSC 301 Data Structures and Algorithms Exam 2025

About this paper

CSC 301: First Semester Examination, Wednesday 29/01/2025, 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 handwritten margin traversal-order mnemonics, not used as the answer source. Section A's DSA-advantage/data-structure-chart/2D-array-storage/linked-list-vs-array items, a flagged-illegible node-value tree figure answered via general traversal/construction/deletion methods, Red-Black-tree/BST-vs-hash-table theory, a B-Tree definition, a flagged-illegible graph-representation figure answered via the general adjacency matrix/list methods, and a fully-traced BFS/DFS (Queue/Stack) demonstration on a clearly legible figure; Section B's match exercise, Yes/No justifications (including two merge-sort/binary-search corrections), fill-in paragraph, Insertion/Merge Sort demonstrations, Linear/Binary Search pseudocode, plus both offered electives answered -- a C Stack-struct method set with a linear-probing hash insertion, and an infix-to-postfix stack trace (cross-referenced in Paper 12) with Tractable/NP-problem theory.