The University of New South Wales

go to UNSW home page

Undergraduate Handbook

PRINT THIS PAGE
Data Structures and Algorithms - COMP1921
UNSW Computing

 
Faculty: Faculty of Engineering
 
 
School:  School of Computer Science and Engineering
 
 
Course Outline: www.cse.unsw.edu.au/~cs1921
 
 
Campus: Kensington Campus
 
 
Career: Undergraduate
 
 
Units of Credit: 6
 
 
EFTSL: 0.12500 (more info)
 
 
Indicative Contact Hours per Week: 6
 
 
Enrolment Requirements:
 
 
Prerequisite: COMP1911.
 
 
Excluded: COMP1400, COMP1711, COMP1721, COMP1911, COMP1917
 
 
Fee Band: 2 (more info)
 
 
Further Information: See Class Timetable
 
 

Description

Covers the topics of COMP1917 not covered in COMP1911. Including: approaches to problem solving, abstraction, low level structure of memory, memory allocation, stack frames, secure coding practice, recursion, linked lists.

Introduction to ADTs. Introduction to simple binary trees. Also reinforces concepts introduced in COMP1911: style, unti testing, team programming, groupwork.

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.