CEC 305 Data Structures and Algorithm Exam 2023

About this paper

CEC 305: First Examination 2022/2023, 13/01/2023 (instructor Nyanga Bernard), University of Buea: Section A, 24 True/False statements on binary search, sorting, linked lists, hashing, trees and Dijkstra's algorithm (a verbatim classic CS data-structures true/false quiz); Section B, 48 four/five-option MCQs on ADTs, sorting algorithms, pointers/dynamic memory, linked lists, stacks/queues, hashing, trees and graphs; Section C, a two-part long-answer question: (Q1) DFS/BFS traversal trees of an 8-vertex graph, statements of Prim's and Kruskal's algorithms and the definition of a spanning tree, the adjacency matrix (with self loops) of a second, directed 6-vertex graph, and a Prim's-algorithm minimum spanning tree of that same graph -- the second graph's own edges are unweighted and directed, so a unit-weight, direction-ignoring assumption is adopted and flagged to make the MST question well-defined; (Q2) pre-order and in-order traversal of a 15-node binary tree spelling out words from the opening sentence of Kafka's Metamorphosis (GREGOR/AWOKE/DISCOVER/...), and a full call-by-call recursion trace (values, call stack, printf output) of a classic recursive ruler-tick-mark-printing C function on input (0,8,3).