- Code COMP1130
- Unit Value 6 units
- Offered by Research School of Computer Science
- ANU College ANU College of Engineering and Computer Science
- Course subject Computer Science
- Areas of interest Business Information Systems, Bioinformatics, Computer Science, Mathematics, Information Technology More...
- Academic career UGRD
- Prof John Lloyd
- Mode of delivery In Person
First Semester 2014
See Future Offerings
This course includes COMP1100 and extends it with 12 one-hour lecture/tutorial/laboratory sessions. It introduces students to various areas of research in computer science, especially those research areas represented in the School of Computer Science. A number of research groups in the School will be responsible for various parts of the course. Each part will consist of some introductory lectures on the data structures and algorithms most relevant to the research area and an overview lecture on the research problems, techniques, and applications of the area. Specific technical material to be covered includes lists, trees, induction, recursion, the Big-Oh notation, and the running time of programs.
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.
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.
Forty two one-hour lectures, ten two-hour tutorial/laboratory sessions.
Aho, Alfred V. & Ullman Jeffrey D. Foundations of Computer Science, C Edition, 1995.
Assumed KnowledgeStudents 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 required
Areas of Interest
- Business Information Systems
- Computer Science
- 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
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. Students continuing in their current program of study will have their tuition fees indexed annually from the year in which you commenced your program. Further information for domestic and international students about tuition and other fees can be found at Fees.
- Student Contribution Band:
- 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.
- Domestic fee paying students
- International fee paying students
Offerings and Dates
|Class number||Class start date||Last day to enrol||Census date||Class end date||Mode Of Delivery||Class Summary|
|2925||17 Feb 2014||07 Mar 2014||31 Mar 2014||30 May 2014||In Person||N/A|