COURSE CODE: COMP 2211
COURSE TITLE: Analysis of Algorithms
SEMESTER: 2
CREDITS: 3
PRE-REQUISITES: COMP 1210, COMP 1126, COMP 1127 AND COMP 1161
RESTRICTION: FOR BSc SOFTWARE ENGINEERING STUDENTS ONLY
COURSE CONTENT:
Analysing algorithms (solving recurrence equations with the Master Theorem); Algorithm strategies (brute force, greedy, divide, and conquer, branch-and bound, heuristic; Iterated approximations (Newton = Raphson method, searching for roots of a polynomial {in one variable}); Fast exponentiation; Euclid’s algorithm; Discrete logarithm; RSA cryptograph; Heaps as implementations for priority queues; Sorting; Binary search trees; Red-Black trees; Hashing; Graphs and graph algorithms; Distributed computing (introduction { consensus vs. election algorithms}); NP Basic Computability: uncomputable functions, the halting problem implicated of uncomputability.
 
ASSESSMENT
Coursework           50%
Final Examination (2 Hours)           50%
Top of Page