Structured Programming - ANU Programs and Courses. Programs and Courses Search query Search ANU web, staff & maps Search current site content Search Programs and Courses Courses COMP6710 Course Structured Programming A graduate course offered by the Research School of Computer Science. COMP6710 Academic Year 2019 2022 2021 2020 2019 2018 2017 2016 2015 2014 Code COMP6710 Unit Value 6 units Academic Codes Offered by Research School of Computer Science ANU College ANU College of Engineering and Computer Science Classification Transitional Course subject Computer Science Academic career PGRD Course convener Dr Josh Milthorpe Dr Stephen Blackburn Mode of delivery In Person Co-taught Course COMP1110 Offered in First Semester 2019 Second Semester 2019 See Future Offerings Tweet Share on Facebook Wattle Share SELT Survey Results Overview Study Fees Class Code COMP6710 Unit Value 6 units Offered by Research School of Computer Science ANU College ANU College of Engineering and Computer Science Classification Transitional Course subject Computer Science Academic career PGRD Course convener Dr Josh Milthorpe Dr Stephen Blackburn Mode of delivery In Person Co-taught Course COMP1110 Offered in First Semester 2019 Second Semester 2019 See Future Offerings Tweet Share on Facebook Wattle Share SELT Survey Results Structured Programming (COMP6710) Introduction Learning Outcomes Indicative Assessment Workload Requisite and Incompatibility Prescribed Texts Fees Offerings and Dates This course introduces students to the fundamentals of software development with a substantial group software project at its center. Major foci are data structures, object oriented programming, and an introduction to software engineering. Students will extend their understanding of software productivity tools, using revision control for group work, and be introduced to test-driven development as an integral part of software construction. Students will be introduced to an industrial strength object oriented programming language, extending their understanding of the imperative programming paradigm with a solid grounding in object oriented programming. Inheritance, polymorphism, and parametric types are taught, as well as concepts such as boxing and auto boxing. The important role of standard libraries and their collection types will be emphasized. GUI programming will be introduced. The course includes a deeper treatment of data structures, using hash tables, trees and lists, which are used to provide concrete implementations of abstract library collection types. The theory of data structures and their time and space complexity will thus be tied to the practice of using standard collections such as those offered by object oriented languages. The foundations of software engineering including: major development paradigms (such as big plan up front, agile, and formal methods) and risk are introduced. Learning Outcomes Upon successful completion, students will have the knowledge and skills to: Upon completion of this course, the student will be able to: Apply fundamental programming concepts, using an object oriented programming language, to solve substantial problems Understand basic types and the benefits of static typing for object oriented programs Distinguish language definition from implementation, syntax and parsing from semantics and evaluation; understand how program state maps to memory (globals, local, heap) and the implications of heap reachability for memory management Develop, understand, test, and evolve substantial programs using a modern IDE, and associated configuration tools; use programming approaches that avoid common coding errors; practice fundamental defensive programming; perform individual and team program reviews; use established design principles to organize a software system Use, implement, and evaluate fundamental data structures and associated algorithms; create, implement, debug, and evaluate algorithms for solving substantial problems, including recursive, using divide-and-conquer and via decomposition; select and implement an abstract data type for a given problem Perform analysis of simple algorithms; select and use appropriate algorithmic approaches to solve problems (brute-force, divide-and-conquer, recursive backtracking, heuristic) Apply the even-driven programming paradigm to construct GUIs Deliver and evaluate basic technical documents, presentations, and group interactions, using appropriate tools Indicative Assessment Individual Assignment (5%), Group Assignment (25%), 2 Lab Tests (20%), Final Exam (50%) 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 31 hrs lectures + 8 x 2hrs of labs/tutorial Requisite and Incompatibility You are not able to enrol in this course if you have previously completed COMP6700 or COMP1110. Prescribed Texts Cay Horstmann,, Big Java, Wiley, 4th Edition, 2010 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 International Domestic fee paying students Year Fee 2019 $4320 International fee paying students Year Fee 2019 $5700 Note: Please note that fee information is for current year only. Offerings, Dates and Class Summary Links The list of offerings for future years is indicative only. Class summaries, if available, can be accessed by clicking on the View link for the relevant class number. 2019 2020 2021 First Semester Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary 4170 25 Feb 2019 04 Mar 2019 31 Mar 2019 31 May 2019 In Person N/A Second Semester Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary 7857 22 Jul 2019 29 Jul 2019 31 Aug 2019 25 Oct 2019 In Person N/A First Semester Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary 3338 24 Feb 2020 02 Mar 2020 08 May 2020 05 Jun 2020 In Person N/A Second Semester Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary 7542 27 Jul 2020 03 Aug 2020 31 Aug 2020 30 Oct 2020 In Person N/A First Semester Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary 3061 22 Feb 2021 01 Mar 2021 31 Mar 2021 28 May 2021 In Person N/A Second Semester Class number Class start date Last day to enrol Census date Class end date Mode Of Delivery Class Summary 5446 26 Jul 2021 02 Aug 2021 14 Sep 2021 29 Oct 2021 In Person N/A Responsible Officer: Registrar, Student Administration / Page Contact: Website Administrator / Frequently Asked Questions Contact ANU Campus Map Copyright Disclaimer Privacy Freedom of Information +61 2 6125 5111 The Australian National University, Canberra CRICOS Provider : 00120C ABN : 52 234 063 906
