CSC 301 Data structure and Algorithm Resit 2025
About this paper
CSC 301: University of Buea First Semester Resit Examination, Tuesday 11/03/2025, 2hrs, Dr. Achankeng P. \& Mr. Kometa D., U-Block G, University of Buea, Faculty of Science, Dept of Computer Science: Section A's 9 short-answer items (DS advantages, linked-list operations, DSA objectives, pointer and union C demo programs, threaded-binary-tree explanation, AVL balance-factor cases, B-tree root-split insertion, and a full Kruskal's Algorithm MST trace on a labelled weighted graph shown as a table); Section B's PriorityQueue C-struct method proposals (isEmpty/isFull/Enqueue/Dequeue), a stack-based array-reversal algorithm, Bubble/Selection Sort pseudocode, and a worked linear-probing-vs-chaining hash-table insertion with load-factor calculation.
Opens this paper in the app on your phone.
University of Buea
Faculty of Science - FS
Computer Science - CSC
Data structure and Algorithm
Resit · First Semester Resit · Level 300
From this paper
- 1.
Briefly describe three advantages of Data Structures. (2 marks)
- 2.
List five basic operations carried out in a Linked List. (2 marks)
At a glance
- Course code
- CSC301 (CSC 301)
- Type
- Resit
- Year
- 2025
- Level
- Level 300
- Semester
- First Semester Resit
- Proposed solution
- Included
Where it's from
University
University of BueaFaculty
Faculty of Science - FSDepartment
Computer Science - CSC
Read CSC301 2025 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?