Exam2024Proposed solution included

CENP 3207 Algorithm and Complexity Exam 2024

About this paper

CENP 3207 Algorithm and Complexity exam (First semester, Level 300), College of Technology, The University of Bamenda: insertion sort, selection sort, greedy algorithms.

Open in Shoracy

Opens this paper in the app on your phone.

University of Bamenda

College of Technology - COLTECH

Computer Engineering - CEN

CENP32072024

Algorithm and Complexity

Exam · First Semester · Level 300

From this paper

  1. 3.

    What is the condition on the input for the complexity of insertion sort to be equal to O(n)? (n size of the input).

  2. 1.

    Is the final solution of the greedy algorithm always optimal?

Open in the app to read the full paper and its proposed solution.

View solutionOpen in Shoracy

At a glance

Course code
CENP3207 (CENP 3207)
Type
Exam
Year
2024
Level
Level 300
Semester
First Semester
Proposed solution
Included

Where it's from

  1. University

    University of Bamenda

  2. Faculty

    College of Technology - COLTECH

  3. Department

    Computer Engineering - CEN

Read CENP3207 2024 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
Open in Shoracy

Don't have the app yet?

Download on theApp StoreGet it onGoogle Play