Algorithms and Programming Techniques - COMP3121
 
Faculty: Faculty of Engineering
 
 
School:  School of Computer Science and Engineering
 
 
Contact: 
Elgindy,Hossam
Ignjatovic,Aleksandar
 
 
Campus: Kensington Campus
 
 
Career: Undergraduate
 
 
Units of Credit: 6
 
 
EFTSL: 0.125 (more info)
 
 
Contact Hours per Week: 5
 
 
Enrolment Requirements:
 
 
Prerequisite: COMP2011 or COMP2711; Excluded: COMP9101, COMP3120.
 
 
Session Offered: See Class Timetable
 
 
Fee Band: 2 (more info)
 
 

Description


Correctness and efficiency of algorithms. Computational complexity: time and space bounds. Techniques for best-case, worst-case and average-case time and space analysis. Designing algorithms using induction, divide-and-conquer and greedy strategies. Algorithms: sorting and order statistics, trees, graphs, matrices. Intractability: classes P, NP, and NP-completeness, approximation algorithms.

Further Information