CSC 207 Introduction to Algorithm Exam 2025
About this paper
CSC 207: First Examination 2024/2025, 13/02/2025, University of Buea: Section A, 23 MCQs (one item flagged as having two equally valid answers -- Kruskal's and Prim's both being classical MST algorithms -- with Kruskal's selected as the primary answer); Section B, an employee-bonus algorithm using an OVERTIME-minus-(2/3)xABSENT five-tier payment schedule; Section C (35 marks): Question1 (5 justified Yes/No items), Question2 (4 code-output traces, two of which involve the double-increment trap, independently traced), Question3 (a swapElements() single-bubble-pass algorithm, verified against the paper's own worked example), and Question4 (Stack LIFO definition/example, a full set of Stack ADT method proposals, and a reverseList() built on top of the Stack).
Opens this paper in the app on your phone.
University of Buea
Faculty of Science - FS
Computer Science - CSC
Introduction to Algorithm
Exam · First Semester · Level 200
From this paper
- 26.
Fractional knapsack problem is solved most efficiently by which of the following algorithm? a) Backtracking b) Greedy algorithm c) Dynamic programming d) Divide and conquer
- 27.
Which of the following is false about the Kruskal’s algorithm? a) It constructs MST by selecting edges in increasing order of their weights b) It is a greedy algorithm c) It uses union-find data structure d) It can accept cycles in the MST
At a glance
- Course code
- CSC207 (CSC 207)
- Type
- Exam
- Year
- 2025
- Level
- Level 200
- Semester
- First Semester
- Proposed solution
- Included
Where it's from
University
University of BueaFaculty
Faculty of Science - FSDepartment
Computer Science - CSCMathematics - MATPhysics - PHY
Read CSC207 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?