UNSW Handbook Course - Introduction to Algorithms

Introduction to Algorithms - COMP3120


	Faculty: Faculty of Engineering
	School: School of Computer Science and Engineering
	Contact: Elgindy,Hossam
	Campus: Kensington Campus
	Career: Undergraduate
	Units of Credit: 3
	EFTSL: 0.062 (more info)
	Contact Hours per Week: 2.5
	Enrolment Requirements:
	Prerequisite: COMP2011 or COMP2711; Excluded: COMP3121, COMP9101.
	Session Offered: See Class Timetable
	Fee Band: 2 (more info)

Description

Design and algorithms using divide-and-conquer, greedy, inductive, parallel and systolic strategies. Models of computations. Correctness and complexity analysis. Time and space analysis: worst- and average- and amortised case algorithms. Algorithms: sorting and searching, trees, graphs and matrices.

Further Information

CSE class page: www.cse.unsw.edu.au/~cs3120

URL for this page:

© The University of New South Wales (CRICOS Provider No.: 00098G), 2004-2011. The information contained in this Handbook is indicative only. While every effort is made to keep this information up-to-date, the University reserves the right to discontinue or vary arrangements, programs and courses at any time without notice and at its discretion. While the University will try to avoid or minimise any inconvenience, changes may also be made to programs, courses and staff after enrolment. The University may also set limits on the number of students in a course.