Exam2025Proposed solution included
CEC 223 Algorithm and Complexity Exam 2025
About this paper
CEC 223: First Examination, 29 Jan 2025, University of Buea: 39-item MCQ on sorting, pseudocode and NP-completeness, plus a bonus-payment and a binary-search algorithm/flowchart.
Opens this paper in the app on your phone.
University of Buea
College of Technology - COT
Computer Engineering - CET
CEC2232025
Algorithm and Complexity
Exam · First Semester · Level 200
From this paper
SECTION A: Write the letter with the correct answer. Each Question carries 0.75 marks.
1.Which of the following sorting algorithms is known for its stability? A) Quick sort B) Merge sort C) Heap sort D) Selection sort
- 2.
What is the time complexity of the binary search algorithm? A) O(n) B) O(log n) C) O(n log n) D) O(n 2)
At a glance
- Course code
- CEC223 (CEC 223)
- Type
- Exam
- Year
- 2025
- Level
- Level 200
- Semester
- First Semester
- Proposed solution
- Included
Where it's from
University
University of BueaFaculty
College of Technology - COTDepartment
Computer Engineering - CET
Read CEC223 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?