CEC 618 Advanced Data Structures & Algorithm Exam 2025
About this paper
CEC 618 Advanced Data Structures & Algorithm 2024/2025 exam, College of Technology, University of Buea: dynamic programming vs greedy algorithms.
Opens this paper in the app on your phone.
University of Buea
College of Technology - COT
Computer Engineering - CET
Advanced Data Structures & Algorithm
Exam · Second Semester · Masters
From this paper
In each of the following question, please specify if the statement is true or false. If the statement is true, explain why it is true. If it is false, explain what the correct answer is and why.
- 1.
When using linked list to perform insertion sort, each time we remove an element from the input list and insert it to the correct position in the linked list. Assume that we have n numbers to be sorted, the time complexity for sorting these numbers using the insertion sort algorithm is O(n 2).
At a glance
- Course code
- CEC618 (CEC 618)
- Type
- Exam
- Year
- 2025
- Level
- Masters
- Semester
- Second Semester
- Proposed solution
- Included
Where it's from
University
University of BueaFaculty
College of Technology - COTDepartment
Computer Engineering - CET
Read CEC618 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?