CSC 301 Data structure and algorithm Exam 2026
About this paper
CSC 301: First Semester Examination, Wednesday 28/01/2026, 13:00-15:00, Dr. Achankeng P. \& Mr. Kometa D., U-Block F/G, University of Buea, Faculty of Science, Dept of Computer Science: Section A's letter-arrangement Binary-Tree-vs-BST exercise, Binary-Tree/Red-Black-Tree property lists, a fully-traced 31-node binary tree reconstructed via MakeTree/EmptyTree constructors from a clearly legible source figure, a generic 6-vertex/8-edge incidence-matrix and adjacency-list representation, and a complete 5-pass Floyd-Warshall all-pairs shortest-path trace on a clearly legible 5-vertex weighted directed graph (verified against several hand-checked paths); Section B's match exercise, Yes/No justifications, fill-in paragraph, Insertion/Quick Sort demonstrations, Linear/Binary Search pseudocode, plus both offered electives answered -- a C Stack-struct method set with a hash-table insertion (cross-referenced from Paper 9/11) and an infix-to-postfix trace (also cross-referenced) alongside a from-scratch PriorityQueue structure definition and insertion pseudocode.
Opens this paper in the app on your phone.
University of Buea
Faculty of Science - FS
Computer Science - CSC
Data structure and algorithm
Exam · First Semester · Level 300
From this paper
Exercise I: Match the following Process/activities to the most appropriate data structure or al-
2.Can store many print jobs for a printer so that they are printed later b. Stack
- 3.
Store a list of most visited files in your computer c. Queue
At a glance
- Course code
- CSC301 (CSC 301)
- Type
- Exam
- Year
- 2026
- Level
- Level 300
- Semester
- First Semester
- Proposed solution
- Included
Where it's from
University
University of BueaFaculty
Faculty of Science - FSDepartment
Computer Science - CSC
Read CSC301 2026 in Shoracy.
- Every page, with zoom for diagrams and small print
- The proposed solution, one tap away
- Stays on your phone after the first open, even offline
Don't have the app yet?