This course provides Students with the opportunity to develop a solid understanding of programming that is essential before progressing to more advanced concepts. It is structured to demonstrate and provide the students with practice in the fundamentals of structured programming. It is designed for Postgraduate students who do not have a programming background.
Students will learn to use an industrial-strength object-oriented programming language and form basic mental models of how computer programs execute and interact with their environment. The course focuses on key aspects of solving programming problems: reasoning about a problem description to design appropriate data representations and function/method descriptions, to find examples, to write, test, debug, and otherwise evaluate the relevant code, and to present and defend their approach.
Students will learn to effectively use a large standard library and key standard data structures, including lists, trees, hash tables, and graphs. The course also introduces the basics of reasoning about the time and space complexity of algorithms, in particular as related to the above data structures.
Learning Outcomes
Upon successful completion, students will have the knowledge and skills to:
- Internalize computation thinking
- Apply fundamental programming concepts, using an object-oriented programming language, to solve practical programming problems
- Implement, debug, and evaluate algorithms for solving substantial problems; implement an abstract data type
- Apply basic algorithmic analysis to simple algorithms; use appropriate algorithmic approaches to solve problems
- Design, implement, and test data structures and code
- Understand their ethical responsibilities as a programmer with respect to Academic integrity, the use of Artificial Intelligence and authorship of code
- Present, explain, evaluate, and defend choices in design and implementations of programs and algorithms
Indicative Assessment
- Assignments (35) [LO 1,2,3,4,5,6,7]
- In-Class Activities (5) [LO 1,2,3,4,5,6,7]
- Final Exam and Mid-term test (60) [LO 1,2,3,4,5]
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
Lectures, workshops/laboratory sessions, presentations, and self-study to a total of 260 hours.
Requisite and Incompatibility
Prescribed Texts
See Class Summary
Assumed Knowledge
Students are expected to have a mathematics background that is equivalent to the ACT Mathematical Methods or NSW HSC Mathematics Advanced courses.
Fees
Tuition fees are for the academic year indicated at the top of the page.
Commonwealth Support (CSP) Students
If you 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). More information about your student contribution amount for each course at Fees.
If you are a domestic graduate coursework student with a Domestic Tuition Fee (DTF) place or international student you will be required to pay course tuition fees (see below). Course tuition fees are indexed annually. Further information for domestic and international students about tuition and other fees can be found at Fees.
Where there is a unit range displayed for this course, not all unit options below may be available.
| Units | EFTSL |
|---|---|
| 12.00 | 0.25000 |
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.