Algorithms and Programming Techniques - COMP3121


	Faculty: Faculty of Engineering
	School: School of Computer Science and Engineering
	Course Outline: www.cse.unsw.edu.au/~cs3121
	Campus: Kensington Campus
	Career: Undergraduate
	Units of Credit: 6
	EFTSL: 0.12500 (more info)
	Indicative Contact Hours per Week: 5
	Enrolment Requirements:
	Prerequisite: COMP2011 or COMP2711 or COMP2911.
	Equivalent: COMP3120, COMP3821, COMP9101, COMP9801
	Excluded: COMP3821
	Fee Band: 2 (more info)
	Further Information: See Class Timetable

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.