Lecturers:

Rafael Felix Alves (rafael.felixalves@adelaide.edu.au)
Tao Zhang (tao.zhang01@adelaide.edu.au)

On successful completion of this course students will be able to:

 

1	Design, implement and test algorithms using fundamental programming constructs and data structures.
2	Identify, evaluate and use information sources to support the practice of programming, including APIs, tutorials and documentation.
3	Explain and apply object-oriented concepts, including abstraction, interfaces, inheritance and polymorphism.
4	Determine and compare the runtime complexity of common searching and sorting techniques and their implementations – both iterative and recursive.
5	Identify and apply searching and sorting techniques (linear and binary search, selection, insertion, merge, quick, bucket sorts).
6	Identify and apply basic data structures: linked list, stack, queue, qraph, tree (ordered, binary, balanced).
7	Design, implement and test solutions to problems selecting appropriate data structures and basic algorithmic techiques (brute force, divide and conquer, transform and conquer, greedy).

There is no required text. The course will make use of various online resources.

In this course, we use an online discussion forum and learning environment available through the course MyUni Canvas page. Through Canvas you will be able to view videos, take online quizzes and access all course content.

This course makes extensive use of on-line learning and it will be very challenging to fully participate or perform at your best unless you regularly access the materials available in the online form. It is your responsibility to regularly check this forum for notices, and to participate in online activities.

This course is taught primarily face to face with active practical work interspersed with short examples and discussions. Students are expected to work on practicals and review course material between face to face sessions.

The information below is provided as a guide to assist students in engaging appropriately with the course requirements.
As a guide, a 6 unit course comprises a total of 288 hours work (this includes face-to-face contact, any online components, and self directed study)

Please review the topic schedule in MyUni.

Assessment Task	Weighting (%)	Individual/ Group	Formative/ Summative	Due (week)*	Hurdle criteria	Learning outcomes	CBOK Alignment**
Practicals	20	Individual	Formative	Weeks 1-12		1. 2. 3. 4. 5. 6. 7.	1.1 1.2 3.1 3.2 4.1
Quizzes	10	Individual	Summative	Weeks 3-12		2. 3. 4. 5. 6.	1.1 1.2
Prac exam	10	Individual	Summative	Weeks 3-12		1. 2. 3. 4. 5. 6. 7.	1.1 1.2 3.1 3.2 4.1
Final theory quiz	30	Individual	Summative	Week 13	Min 40%	2. 3. 4. 5. 6.	1.1 1.2
Final prac exam	30	Individual	Summative	Week 13	Min 40%	1. 2. 3. 4. 5. 6. 7.	1.1 1.2 3.1 3.2 4.1
Total	100

* The specific due date for each assessment task will be available on MyUni.
 
This assessment breakdown complies with the University's Assessment for Coursework Programs Policy.
 
This course has a hurdle requirement. Meeting the specified hurdle criteria is a requirement for passing the course.

**CBOK is the Core Body of Knowledge for ICT Professionals defined by the Australian Computer Society. The alignment in the table above corresponds with the following CBOK Areas:

1. Problem Solving
2. Professional Knowledge
3. Technology resources
4. Technology Building
5.  ICT Management

Students must achieve a minimum of 40% of the available marks in the Final Theory Quiz and a minimum of 40% of the available marks in the Final Practical Exam. If a student has a final mark for the course greater than 44 F but, fails to achieve both of these requirements, the final mark for the course will be reduced to 44 F.

Assessment: Practicals*
Weighting: 20%
Due Dates: please note schedule on course website. Some practicals will be undertaken during class time but some may be completed outside class times.
Submission Details: Submit using the School of Computer Science Web Submission System.
Task: Design, test and implement solutions to programming problems.
Scope: These assess your understanding of the course material covered during prior classes.
Criteria by which your assignment will be marked: design, functionality, testing and program style.
Learning objectives: 1,3,5,6,7

Assessment: Theory Quizzes^
Weighting: 10%
Due Dates: please note schedule on course website. Theory quizzes will be held during class time.
Submission Details: Online Quiz.
Task: Design, test and implement solutions to the practical problems.
Scope: These cover all topics up to the time of the quiz.
Criteria by which your assignment will be marked: Correctness of answers.
Learning objectives: 2,3,4,5,6

Assessment: Practical Exams^
Weighting: 10%
Due Dates: please note schedule on course website. Practical exams will be held during class time.
Submission Details: Submit using the School of Computer Science Web Submission System.
Task: Design, test and implement solutions to programming problems.
Scope: These cover all topics up to the time of the practical exam.
Criteria by which your assignment will be marked: design, functionality, testing and program style.
Learning objectives: 1,3,5,6,7

Assessment: Final Theory Quiz^
Weighting: 30%
Due Dates: The final theory exam will be scheduled during the final class time.
Submission Details: Online Quiz
Task: The theory exam assesses students depth of knowledge of programming constructs in general, tradeoffs of memory and cpu use in algorithms and data representation.
Scope: 60 minute online quiz. Covers material from all of the course.
Criteria by which your assignment will be marked: Correctness of answers.
Learning objectives: 2,3,4,5,6

Assessment: Final Practical Exam^
Weighting: 30%
Due Dates: The final practical exam will be scheduled during the main exam period.
Submission Details: Submit using the School of Computer Science Web Submission System.
Task: Design, test and implement solutions to programming problems.
Scope: 120 minute practical exam. Covers material from all of the course.
Criteria by which your assignment will be marked: design, functionality, testing and program style.
Learning objectives: 1,3,5,6,7
Practicals are both summative (assessing your understanding) and formative (used to give you feedback and help you prepare for practical exams). The theory quizzes and practical exams are all summative.

* During practicals, you are encouraged to collaborate with your classmates. This extends to discussing ideas, alternatives, possible solutions and questions about material discussed in class. It does not permit copying of code from classmates. All code you submit must be your own.

^Theory quizzes and practical exams are individual and you must not consult classmates in developing your solutions.

Programming Assignment Submission
All programming practicals must be submitted using the School of Computer Science Web Submission System. Programming assignments must not be emailed to the lecturer. If you are unable to submit a programming assignment, ask for help.

Note: programming assignments may be processed using external online plagiarism detection tools.

Backup Copy of Programming Assignments
All programming assignments must be stored in your SVN repository. Failure to use the repository and any subsequent loss of work will not be grounds for an extension.

Late Penalties
Failure to submit a programming assignment on time or by the agreed extension deadline will result in penalties. For each day or part-day that a programming assignment is late, the maximum mark that can be awarded is reduced by 25%. 

Extensions
Any request for an extension of time for the submission of a programming assignment should be made well before the due date to the Course Coordinator. Normally, extensions will only be granted for a maximum of two weeks from the original assignment submission date. Extensions will only be granted in cases of genuine extenuating circumstances and evidence, such as a medical certificate, must be provided.

Theory Quizzes and Practical Exams
If you are unable to take a theory quiz or attend a practical exam, you must contact the course coordinator as soon as practicable. If appropriate evidence can be provided, such as a medical certificate, alternative arrangements may be considered.