CEC 305 Data Structures and Algorithm Exam 2023

About this paper

CEC 305: A 4-page First Resit Examination for Data Structures and Algorithm (CEC305), University of Buea College of Technology, Dept of Computer Engineering, instructor Nyanga B., 23/02/2023, 2 hours. Section A: 15 True/False questions covering hashing, sorting, linked lists, stacks, trees and graphs. Section B: 37 multiple-choice questions covering abstract data types, collections, graph representations, searching/sorting, stacks/queues, hashing, trees and graph theory concepts, including an Ackermann-function evaluation and a postfix-expression evaluation. Section C: a single multi-part question -- (a) depth-first and breadth-first traversal recursion trees for a given 8-vertex graph starting at node 0; (b) statements of Prim's and Kruskal's algorithms and the definition of a spanning tree; (c) the adjacency matrix (with self loops) for a given directed 6-vertex graph; (d) a full step-by-step Prim's-algorithm minimum spanning tree computation for a given 9-vertex weighted graph.