Note: This unit is an archived version! See Overview tab for delivered versions.
INFO1103: Introduction to Programming (2013 - Semester 2)
| Unit: | INFO1103: Introduction to Programming (6 CP) |
| Mode: | Normal-Day |
| On Offer: | Yes |
| Level: | Junior |
| Faculty/School: | School of Computer Science |
| Unit Coordinator/s: |
A/Prof Koprinska, Irena
|
| Session options: | Semester 1, Semester 2 |
| Versions for this Unit: |
| Campus: | Camperdown/Darlington |
| Pre-Requisites: | None. |
| Brief Handbook Description: | Programming in a legible, maintainable, reusable way is essential to solve complex problems in the pervasive computing environments. This unit will equip students with foundation of programming concepts that are common to widely used programming languages. The "fundamentals-first & objects-later" strategy is used to progressively guide this introductory unit from necessary and important building blocks of programming to the object-oriented approach. Java, one of the most popular programming languages, is used in this unit. It provides interdisciplinary approaches, applications and examples to support students from broad backgrounds such as science, engineering, and mathematics. |
| Assumed Knowledge: | None. |
| Lecturer/s: |
A/Prof Koprinska, Irena
|
||||||||||||||||||||
| Tutor/s: |
Alex Radu Joshua Akehurst Scott Maxwell Alexander Hogue David Wilcox Joshua Stretton |
||||||||||||||||||||
| Timetable: | INFO1103 Timetable | ||||||||||||||||||||
| Time Commitment: |
|
Attributes listed here represent the key course goals (see Course Map tab) designated for this unit. The list below describes how these attributes are developed through practice in the unit. See Learning Outcomes and Assessment tabs for details of how these attributes are assessed.
| Attribute Development Method | Attribute Developed |
| Algorithm-based approach to problem solving | Design (Level 1) |
| Basic programming and use of algorithms | Engineering/IT Specialisation (Level 1) |
| Problem solving will require locating and using information effectively and efficiently. | Information Seeking (Level 1) |
| Lab work will encourage collaboration, team work and communication. | Communication (Level 1) |
For explanation of attributes and levels see Engineering & IT Graduate Outcomes Table.
Learning outcomes are the key abilities and knowledge that will be assessed in this unit. They are listed according to the course goal supported by each. See Assessment Tab for details how each outcome is assessed.
Engineering/IT Specialisation (Level 1)| Assessment Methods: |
|
||||||||||||||||||||||||||||||
| Assessment Description: |
Task 1: a small programming task due in week 4 (3%) Task 2: a small programming task due in week 6 (7%) Practical test: in week 7, during the labs (20%) Assignment: due in week 11 (20%) Exam: during the examination period (50%) |
||||||||||||||||||||||||||||||
| Grading: |
|
||||||||||||||||||||||||||||||
| Policies & Procedures: | IMPORTANT: School policy relating to Academic Dishonesty and Plagiarism. In assessing a piece of submitted work, the School of IT may reproduce it entirely, may provide a copy to another member of faculty, and/or to an external plagiarism checking service or in-house computer program and may also maintain a copy of the assignment for future checking purposes and/or allow an external service to do so. Other policies See the policies page of the faculty website at http://sydney.edu.au/engineering/student-policies/ for information regarding university policies and local provisions and procedures within the Faculty of Engineering and Information Technologies. |
| Prescribed Text/s: |
Note: Students are expected to have a personal copy of all books listed.
|
Note that the "Weeks" referred to in this Schedule are those of the official university semester calendar https://web.timetable.usyd.edu.au/calendar.jsp
| Week | Description |
| Week 1 | Introduction. First Java program. |
| Week 2 | Variables. Conditional statements. |
| Week 3 | Loops. |
| Week 4 | Methods. |
| Week 5 | Arrays. Common array algorithms. |
| Week 6 | Using arrays with methods. Two-dimensional arrays. Array lists. |
| Week 7 | Objects and classes 1. |
| Assessment Due: Quiz | |
| Week 8 | Objects and classes 2. |
| Week 9 | Arrays and array lists of objects. Inheritance and polymorphism. |
| Week 10 | Objects, classes and methods - practice and case studies. |
| Week 11 | File input/output and exceptions. |
| Assessment Due: Assignment | |
| Week 12 | Recursion. |
| Week 13 | Interfaces. Revision. |
| Exam Period | Assessment Due: Final Exam |
Course Relations
The following is a list of courses which have added this Unit to their structure.
Course Goals
This unit contributes to the achievement of the following course goals:
| Attribute | Practiced | Assessed |
| Design (Level 1) | Yes | 0% |
| Engineering/IT Specialisation (Level 1) | Yes | 100.01% |
| Information Seeking (Level 1) | Yes | 0% |
| Communication (Level 1) | Yes | 0% |
These goals are selected from Engineering & IT Graduate Outcomes Table which defines overall goals for courses where this unit is primarily offered. See Engineering & IT Graduate Outcomes Table for details of the attributes and levels to be developed in the course as a whole. Percentage figures alongside each course goal provide a rough indication of their relative weighting in assessment for this unit. Note that not all goals are necessarily part of assessment. Some may be more about practice activity. See Learning outcomes for details of what is assessed in relation to each goal and Assessment for details of how the outcome is assessed. See Attributes for details of practice provided for each goal.
