- 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 Antony Hosking
- Mode of delivery In Person
First Semester 2018
See Future Offerings
This course is a variation on Programming for Problem Solving (COMP1100). It covers the same topics in more depth, allowing students to deepen their understanding and experience. They will understand the foundations of program semantics, program proof, and implementation of the programming language features that they have learned in the course.
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:
Use functional encapsulation mechanisms such as function closures and modular interfaces, and define and use higher-order functions operating over over-aggregate values.
Explain how typing rules define legal operations of a type, and write down the type rules for use of compound types.
Use big-O notation formally to give bounds on time and space complexity of algorithms.
Describe various heuristic problem-solving methods.
Assignments (30%), Lab Assessment (5%), Mid-Term Exam (10%), Final Exam (55%)
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.
WorkloadForty hours of lectures, twelve two-hour tutorial/laboratory sessions. At least the same amount of time will be required to work through the material, and prepare assignments and for labs.
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. 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:
- 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.
Offerings, Dates and Class Summary Links
Class summaries, if available, can be accessed by clicking on the View link for the relevant class number.
|Class number||Class start date||Last day to enrol||Census date||Class end date||Mode Of Delivery||Class Summary|
|2326||19 Feb 2018||27 Feb 2018||31 Mar 2018||25 May 2018||In Person||N/A|