Outline

Overview

The focus of this unit will cover the ground up programming components necessary for study in the computer science discipline. Students will engage with procedural programming using two related programming languages. Students will further their understanding of internal operations as well as reasoning about processing, memory model and conventional programming practices. As an advanced offering, all the course contents of INFO1110 will be covered and there will be additional teaching materials and assessments.

Unit details and rules

Academic unit	Computer Science
Credit points	6
Prerequisites ?	None
Corequisites ?	None
Prohibitions ?	INFO1110 OR INFO1103 OR INFO1903 OR INFO1105 OR INFO1905
Assumed knowledge ?	ATAR sufficient to enter Dalyell program, or passing an online programming knowledge test, which will be administered during the O-week prior to the commencement of the semester.
Available to study abroad and exchange students	No

Teaching staff

Coordinator	John Stavrakakis, john.stavrakakis@sydney.edu.au
Tutor(s)	Alan Robertson, alan.robertson@sydney.edu.au

Type	Description	Weight	Due	Length
Final exam (Take-home short release)	Final examination (computer part) 3 hours computer programming exam.	30%	Formal exam period	3 hours
Outcomes assessed:
Oral exam ?	Final examination (Oral part) Answer questions presented by instructor in a viva voce examination	10%	Formal exam period	20 minutes (oral)
Outcomes assessed:
Small continuous assessment	Tutorial Quiz Solve programming problems. Weeks 3, 5, 7, 9, 11	10%	Multiple weeks	As directed by instructor.
Outcomes assessed:
Assignment	Online problem Solve programming problem. Weeks: 2, 4, 6, 8, 10	10%	Multiple weeks	7 days
Outcomes assessed:
Assignment	Assignment 1 Write a computer program from problem description	10%	Week 07 Due date: 26 Sep 2021 at 23:59	14 days
Outcomes assessed:
Tutorial quiz	Mid semester Quiz Answer theory questions on programming.	10%	Week 08 Due date: 08 Oct 2021 at 12:00	As directed by instructor.
Outcomes assessed:
Assignment	Assignment 2 Write a complete program from problem description.	20%	Week 13 Due date: 14 Nov 2021 at 23:59	21 days
Outcomes assessed:
= hurdle task ? = Type D final exam ?

Assessment summary

Online problem:

Weeks 2, 4, 6, 8, 10. Solve a programming problem and submit online.

In class quiz:

Weeks 3, 5, 7, 9, 11. Solve a programming problem and submit within the class as directed by the instructor.

Assignment 1 and 2:
Write a computer program from problem description. To be completed individually throughout the semester. Both assignments may require submission of code, tests, reports, oral presentations. Format and submission details of assignments to be provided on release.

Final examination:
The final exam covers all aspects of the course. Demonstrate knowledge in procedural programming. Reading and tracing through short programs. Writing short programs. Writing test cases and debugging with existing test cases. The final exam consists of a 3 hour computer examination followed by a 20 minute oral examination. Both must be completed.

Special consideration

Assignments - Approved special consideration will be granted an extension to the assignments and may be additionally be examined in an oral quiz, based on the assignment contents, that will contribute to the grade for that assignment.

Final examination – a replacement examination will be arranged, however the format may vary and further development may be required.

Conditions for pass in this course:

- At least 40% in the assessment grade

- Must complete both examinations (Computer + Oral)

- At least 40% in the final examination; i.e. 40% of (Computer exam mark + Oral exam mark)

- At least 50% total

It is a policy of the School of Computer Science that in order to pass this unit, 40% in the final exam. A student must also achieve an overall final mark of 50 or more. Any student not meeting these requirements may be given a maximum final mark of no more than 45 regardless of their average.

Additionally for this course, Students may be asked for further development of their assessments if they fail to attend at least 80% of their tutorials.

Assessment criteria

The University awards common result grades, set out in the Coursework Policy 2014 (Schedule 1).

As a general guide, a high distinction indicates work of an exceptional standard, a distinction a very high standard, a credit a good standard, and a pass an acceptable standard.

For more information see guide to grades.

Late submission

In accordance with University policy, these penalties apply when written work is submitted after 11:59pm on the due date:

Deduction of 5% of the maximum mark for each calendar day after the due date.
After ten calendar days late, a mark of zero will be awarded.

This unit has an exception to the standard University policy or supplementary information has been provided by the unit coordinator. This information is displayed below:

Online problem - No late submission permitted Tutorial quiz - No late submission permitted Mid semester quiz - No late submission permitted Assignments - 5% per day as per University guidelines

Academic integrity

The Current Student website provides information on academic integrity and the resources available to all students. The University expects students and staff to act ethically and honestly and will treat all allegations of academic integrity breaches seriously.

We use similarity detection software to detect potential instances of plagiarism or other forms of academic integrity breach. If such matches indicate evidence of plagiarism or other forms of academic integrity breaches, your teacher is required to report your work for further investigation.

Use of generative artificial intelligence (AI) and automated writing tools

You may only use generative AI and automated writing tools in assessment tasks if you are permitted to by your unit coordinator. If you do use these tools, you must acknowledge this in your work, either in a footnote or an acknowledgement section. The assessment instructions or unit outline will give guidance of the types of tools that are permitted and how the tools should be used.

Your final submitted work must be your own, original work. You must acknowledge any use of generative AI tools that have been used in the assessment, and any material that forms part of your submission must be appropriately referenced. For guidance on how to acknowledge the use of AI, please refer to the AI in Education Canvas site.

The unapproved use of these tools or unacknowledged use will be considered a breach of the Academic Integrity Policy and penalties may apply.

Studiosity is permitted unless otherwise indicated by the unit coordinator. The use of this service must be acknowledged in your submission as detailed on the Learning Hub’s Canvas page.

Outside assessment tasks, generative AI tools may be used to support your learning. The AI in Education Canvas site contains a number of productive ways that students are using AI to improve their learning.

Learning support

Simple extensions

If you encounter a problem submitting your work on time, you may be able to apply for an extension of five calendar days through a simple extension.  The application process will be different depending on the type of assessment and extensions cannot be granted for some assessment types like exams.

Special consideration

If exceptional circumstances mean you can’t complete an assessment, you need consideration for a longer period of time, or if you have essential commitments which impact your performance in an assessment, you may be eligible for special consideration or special arrangements.

Special consideration applications will not be affected by a simple extension application.

Using AI responsibly

Co-created with students, AI in Education includes lots of helpful examples of how students use generative AI tools to support their learning. It explains how generative AI works, the different tools available and how to use them responsibly and productively.

Weekly schedule

WK	Topic	Learning activity
Week 01	1. Introduction to the unit; 2. Fundamental concepts; 3. Introduction to terminal and Linux	Lecture (1 hr)
Week 01	1. Introduction to the unit; 2. Fundamental concepts; 3. Introduction to terminal and Linux	Computer laboratory (2 hr)
Week 02	1. Data types; 2. Variables, operators and expressions; 3. Branching	Lecture (1 hr)
Week 02	1. Data types; 2. Variables, operators and expressions; 3. Branching	Computer laboratory (2 hr)
Week 03	1. Array concept of addressable memory; 2. Lists and loops; 3. Further flow control; 4. Pointers and addressable memory	Lecture (3 hr)
Week 03	1. Array concept of addressable memory; 2. Lists and loops; 3. Further flow control; 4. Pointers and addressable memory	Computer laboratory (2 hr)
Week 04	1. Addressable memory; 2. Arrays, collections, testing; 3. More pointers; 4. Testing	Lecture (3 hr)
Week 04	1. Addressable memory; 2. Arrays, collections, testing; 3. More pointers; 4. Testing	Computer laboratory (2 hr)
Week 05	1. Basis of program design process; 2. Documentation and style ; 3. Make and Preprocessor	Lecture (3 hr)
Week 05	1. Basis of program design process; 2. Documentation and style ; 3. Make and Preprocessor	Computer laboratory (2 hr)
Week 06	1. Functions; 2. Testing; 3. Files	Lecture (2 hr)
Week 06	1. Functions; 2. Testing; 3. Files	Computer laboratory (2 hr)
Week 07	1. Files and basic input/output; 2. Exception handling; 3. Defining and using types	Lecture (1 hr)
Week 07	1. Files and basic input/output; 2. Exception handling; 3. Defining and using types	Computer laboratory (2 hr)
Week 08	1. More list and for loop; 2. Programming idioms ; 3. Reference semantics	Lecture (1 hr)
Week 08	1. More list and for loop; 2. Programming idioms ; 3. Reference semantics	Computer laboratory (2 hr)
Week 09	1. Testing; 2. Software design process; 3. Dictionaries; 4. Tuples	Lecture and tutorial (1 hr)
Week 09	1. Testing; 2. Software design process; 3. Dictionaries; 4. Tuples	Computer laboratory (2 hr)
Week 10	1. Modular programming; 2. Defining datatypes using aggregate structures; 3. Inheritance	Lecture (2 hr)
Week 10	1. Modular programming; 2. Defining datatypes using aggregate structures; 3. Inheritance	Computer laboratory (2 hr)
Week 11	1. Recursion	Lecture (1 hr)
Week 11	1. Reading, writing and tracing recursive code.	Computer laboratory (2 hr)
Week 12	1. Multidimensional arrays	Lecture (1 hr)
Week 12	1. Problems with 2D structures	Computer laboratory (2 hr)
Week 13	1. Course review; 2. Final Examination overview;	Lecture (1 hr)
Week 13	1. Revision	Computer laboratory (2 hr)

Attendance and class requirements

Canvas and Ed are both used in this course for separate purposes. Students are encouraged to engage with the discussions and support on Ed for their learning.
Students are expected to regularly visit these websites to learn of announcements and information concerning format and schedule of assessment. Canvas is a website that will be used to disseminate the lecture recordings and for publishing of results.

Study commitment

Typically, there is a minimum expectation of 1.5-2 hours of student effort per week per credit point for units of study offered over a full semester. For a 6 credit point unit, this equates to roughly 120-150 hours of student effort in total.

Required readings

All readings for this unit can be accessed through the Library eReserve, available on Canvas.

Robert Sedgewick, Kevin Wayne, Robert Donder – Introduction to Programming in Python: An Interdisciplinary Approach. Pearson Higher Ed USA, 2015. 9780134076430
Brian W. Kernighan and Dennis M. Ritchie – The C Programming Language. Prentice Hall. 1988. 0-13-110362-8
The C Programming Language (The White Book, K&R) (1978)
The Unix Programming Environment (1984)
Compilers: Principles, Techniques, and Tools (1986) (The Dragon Book)

Learning outcomes

Learning outcomes are what students know, understand and are able to do on completion of a unit of study. They are aligned with the University's graduate qualities and are assessed as part of the curriculum.

Outcomes
Graduate qualities

At the completion of this unit, you should be able to:

LO1. employ programming style conventions for writing consistently readable code
LO2. design and construct new functionality to existing procedural program or function
LO3. compose a structured algorithmic design to solve the descriptive problem specification
LO4. compose an entire procedural program from descriptive problem specification
LO5. translate general programming problems between two distinctly differing procedural programming languages
LO6. demonstrate an understanding of programming principles, data types, variables and operators, control-flow: simple statement, sequence, if-then-else, while, functions: stack, input/output, reference memory model
LO7. compose, analyse and trace procedural code, scoping/variable lifetime, memory of the stack, references and globals, data types, operations on data types
LO8. construct code cliches for input and manipulating arrays, including maximum, minimum, search or traverse, with actions on each element for counting or summation
LO9. construct and assess code for recursively-defined numerical functions, and for recursively described array manipulations
LO10. apply testing methods and assess programs through debugging, write a set of tests for a small program or function
LO11. explain compilation process and debugging mechanism
LO12. use standard library functions
LO13. explain processing, memory and internal operations of procedural programming

Graduate qualities

The graduate qualities are the qualities and skills that all University of Sydney graduates must demonstrate on successful completion of an award course. As a future Sydney graduate, the set of qualities have been designed to equip you for the contemporary world.

GQ1	Depth of disciplinary expertise Deep disciplinary expertise is the ability to integrate and rigorously apply knowledge, understanding and skills of a recognised discipline defined by scholarly activity, as well as familiarity with evolving practice of the discipline.
GQ2	Critical thinking and problem solving Critical thinking and problem solving are the questioning of ideas, evidence and assumptions in order to propose and evaluate hypotheses or alternative arguments before formulating a conclusion or a solution to an identified problem.
GQ3	Oral and written communication Effective communication, in both oral and written form, is the clear exchange of meaning in a manner that is appropriate to audience and context.
GQ4	Information and digital literacy Information and digital literacy is the ability to locate, interpret, evaluate, manage, adapt, integrate, create and convey information using appropriate resources, tools and strategies.
GQ5	Inventiveness Generating novel ideas and solutions.
GQ6	Cultural competence Cultural Competence is the ability to actively, ethically, respectfully, and successfully engage across and between cultures. In the Australian context, this includes and celebrates Aboriginal and Torres Strait Islander cultures, knowledge systems, and a mature understanding of contemporary issues.
GQ7	Interdisciplinary effectiveness Interdisciplinary effectiveness is the integration and synthesis of multiple viewpoints and practices, working effectively across disciplinary boundaries.
GQ8	Integrated professional, ethical, and personal identity An integrated professional, ethical and personal identity is understanding the interaction between one’s personal and professional selves in an ethical context.
GQ9	Influence Engaging others in a process, idea or vision.

Outcome map

Learning outcomes	Graduate qualities
Learning outcomes

Responding to student feedback

This section outlines changes made to this unit following staff and student reviews.

Students have more time to prepare for assignment 2

Additional information

Every week students should:

Read the required sections of literature
Attend and take notes for the Live lecture (Mondays)
Watch and take notes for the Online lecture (via Canvas website)
Watch and take notes for the Advanced Online lecture (via Canvas website)
Complete the Assignments (as required)
Prepare for the Lab by reviewing reading, lecture and lab questions
Attend and participate in weekly Lab with tutor (as timetabled)

Additionally:

Students should ask questions on edstem.org
Students are encouraged to engage with their teacher in the tutorial

Access to online assessments. Access to course contents: Lecture, Laboratory, online lessons, challenges etc. Access to important announcements, discussion and support forum.

Disclaimer

The University reserves the right to amend units of study or no longer offer certain units, including where there are low enrolment numbers.

To help you understand common terms that we use at the University, we offer an online glossary.

Current students

Overview

Overview

Unit details and rules

Teaching staff

Assessment

Assessment

Assessment summary

Assessment criteria

Late submission

Academic integrity

Learning support

Learning support

Simple extensions

Special consideration

Using AI responsibly

Weekly schedule

Weekly schedule

Attendance and class requirements

Study commitment

Required readings

Learning outcomes

Learning outcomes

Graduate qualities

Outcome map

Responding to student feedback

Responding to student feedback

Additional information

Additional information

Disclaimer

On this page

Useful links

Media

Student links

About us

Connect

Current students

INFO1910: Introduction to Programming (Advanced)

Semester 2, 2021 [Normal day] - Camperdown/Darlington, Sydney

Overview

Overview

Unit details and rules

Teaching staff

Assessment

Assessment

Assessment summary

Assessment criteria

Late submission

Academic integrity

Learning support

Learning support

Simple extensions

Special consideration

Using AI responsibly

Weekly schedule

Weekly schedule

Attendance and class requirements

Study commitment

Required readings

Learning outcomes

Learning outcomes

Graduate qualities

Outcome map

Responding to student feedback

Responding to student feedback

Additional information

Additional information

Disclaimer

On this page

Useful links

Media

Student links

About us

Connect