This course is a variation on Introduction to Programming and Algorithms (COMP1100). The purpose of this variation is to provide an insight into how basic Computer Science material links into current research as well as to provide “behind the scene” perspectives and a more foundational approach to the material. It will do so by asking deeper technical and theoretical questions (compared to COMP1100) and by widening the horizon towards open and challenging questions and current research fields. This course is meant as a solid foundation for your future Computer Science endeavours on any level.
Learning Outcomes
Upon successful completion, students will have the knowledge and skills to:
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 various data structures including lists and trees and their associated algorithms, and be able to appropriately use these data structures in programs.
- Understand how data structures and algorithms are employed in various research areas in computer science.
- Have some appreciation of current issues in computer science research.
Indicative Assessment
Assignments (40%); Final exam (60%)
The ANU uses Turnitin to enhance student citation and referencing techniques, and to assess assignment submissions as a component of the University's approach to managing Academic Integrity. While the use of Turnitin is not mandatory, the ANU highly recommends Turnitin is used by both teaching staff and students. For additional information regarding Turnitin please visit the ANU Online website.
Workload
Forty two one-hour lectures, ten two-hour tutorial/laboratory sessions.
Assumed Knowledge
Students are assumed to have achieved a level of knowledge of mathematics comparable to at least ACT Specialist Mathematics Major/Minor or NSW Mathematics Extension 1 or equivalent. No programming, Computer Science or IT experience or skills are requiredAreas of Interest
- Business Information Systems
- Bioinformatics
- Computer Science
- Mathematics
- Information Technology
- Software Engineering
- Advanced Computing
- Information Systems
- Information - Intensive Computing
- Intelligent Systems
- Software Development
- Algorithms and Data
- Artifical Intelligence
- Computer Systems
- Computer Engineering
- Computational Foundations
Majors
Minors
Fees
Tuition fees are for the academic year indicated at the top of the page.
If you are a domestic graduate coursework or international student you will be required to pay tuition fees. Tuition fees are indexed annually. Further information for domestic and international students about tuition and other fees can be found at Fees.
- Student Contribution Band:
- 2
- Unit value:
- 6 units
If you are an undergraduate student and have been offered a Commonwealth supported place, your fees are set by the Australian Government for each course. At ANU 1 EFTSL is 48 units (normally 8 x 6-unit courses). You can find your student contribution amount for each course at Fees. Where there is a unit range displayed for this course, not all unit options below may be available.
| Units | EFTSL |
|---|---|
| 6.00 | 0.12500 |
Course fees
- Domestic fee paying students
| Year | Fee |
|---|---|
| 2016 | $3276 |
- International fee paying students
| Year | Fee |
|---|---|
| 2016 | $4368 |
Offerings, Dates and Class Summary Links
ANU utilises MyTimetable to enable students to view the timetable for their enrolled courses, browse, then self-allocate to small teaching activities / tutorials so they can better plan their time. Find out more on the Timetable webpage.
Class summaries, if available, can be accessed by clicking on the View link for the relevant class number.
First Semester
| Class number | Class start date | Last day to enrol | Census date | Class end date | Mode Of Delivery | Class Summary |
|---|---|---|---|---|---|---|
| 2387 | 15 Feb 2016 | 26 Feb 2016 | 31 Mar 2016 | 27 May 2016 | In Person | N/A |
