COMP1130 Data Structures and Algorithms I

First Year Course

Offered By	School of Computer Science
Academic Career	Undergraduate
Course Subject	Computer Science
Offered in	First Semester, 2010 and First Semester, 2011
Unit Value	6 units
Course Description	This course includes COMP1100 and extends it with 12 one-hour lecture/tutorial/laboratory sessions. The extra material is more mathematical than the content of COMP1100. It includes induction, recursion, the Big-Oh notation, and the running time of programs. Also covered are an analysis of the list and tree data structures, so that students are able to make appropriate use of these data structures in programs. The coding of these data structures and their associated algorithms is presented in the C programming language.
Learning Outcomes	Upon completion of this course, in addition to the learning outcomes of COMP1100, the student will be able to: Understand proof by induction, recursion, the running time of programs, and the Big-Oh notation. Understand the properties of list and tree data structures in some detail and be able to appropriately use these data structures in programs.
Indicative Assessment	Assignments (40%); Final exam (60%)
Workload	Forty two one-hour lectures, ten two-hour tutorial/laboratory sessions.
Areas of Interest	Computer Science
Requisite Statement	Enrolment in the Bachelor of Computer Science (Honours) or permission from Head of Computer Science.
Prescribed Texts	Aho, Alfred V. & Ullman Jeffrey D. Foundations of Computer Science, C Edition, 1995.

The information published on the Study at ANU 2010 website applies to the 2010 academic year only. All information provided on this website replaces the information contained in the Study at ANU 2009 website.