School of Computing · ANU College of Systems and Society
This programming course teaches basic concepts in imperative and object-oriented programming and corresponding data structures. 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. The Advanced version of this course (COMP1140 offered in Semester 2 only) covers these topics in more depth, allowing students to deepen their understanding and experience. Students can start in COMP1140 and then drop back to COMP1110 during the semester. You cannot change from COMP1110 into COMP1140 after week 2.
Assignments and In-Person activities
Learning outcomes 1, 2, 3, 4, 5, 7
Final Exam and in-term test(s)
Learning outcomes 1, 2, 3, 4, 6
Lectures, tutorials/laboratory sessions, presentations, assessments and self-study to a total of 130 hours.
See Structured Programming COMP1110 website