Semester 1, 2006
10-11, Monday, Central Lecture Block7
10-12 Friday, Mathews Theatre A
Last updated: 21:57 Thursday, 26 October, 2006
Congratulations to the Authors of the 10 Best Optimised Submissions of Assignment 3 !
Top 10 Assginment 3 Performances
In accordance with UNSW privacy provisions, Assignment 3 Specifications had required that students who do not agree to have their names published must email firstname.lastname@example.org to inform the course administration so, and if a student did so and ranks in Top 10 Assignment 3 Performances, his/her name would have been replaced by the place holder anonymous here.
|Student Name||Improvement over |
|Yuk Kwan Steven Wong||57
|Melody Xiaoxuan Wang||27
|Felix Yanzen Tjung||24
|Kin Pong Au Yeung||22
Special considerations -- Lecturer in charge is now
Dr Alan Blair
We have received a number of requests for special consideration.
University policy on such requests for
consideration due to misadventure or illness should be consulted
and followed. We are not permitted do this informally.
However, if the difficulty affects only one assignment, while it is still
necessary to complete your request on the standard form, after completion
submit it with all relevant documentation to the Student Center in
a sealed envelope marked Comp2011 : Dr Alan Blair, School of Computer
Science and Engineering.
Difficulties that affect more than one assignment must follow
the procedure in the cited URL.
Aims and Course Outline
This course covers elementary Java applied to the data structures
and associated algorithms that are basic to computer science and
information technology. It is the last semester that it is being
offered. The curriculum re-design introduced new courses that
incorporate similar content. The topic outline below is also the
approximate lecture schedule spread over 13 weeks.
A pass or better in this course is a certification that you
have the preparation for level 3XXX courses in computer science and IT as
offered by this School that assume competence in elementary Java
programming and intermediate data structures.
Specialist 2711 topics.
- Elements of Java and O-O programming.
- Analysis of algorithms.
- Stacks, queues and linked lists
- Trees, search orders.
- Priority queues and heaps.
- Binary search trees, nearly balanced trees, B-trees.
- Prefix code trees.
- Splay trees, Huffman codes, data compression.
- Skip lists.
- Sorting; quicksort, mergesort.
- Graph traversal, breadth and depth first.
- Shortest paths, minimum spanning trees.
- Directed graphs.
- Fast string matching.
- The Kraft inequality.
- Random variables, expectation, payoffs.
- Amortized complexity.
- Lower bounds, optimality.
This will be based on three assignments and a
final examination. The examinations for 2011 and 2711 will be
slightly different, reflecting the additional topics for 2711.
Assessment policies are outlined in the descriptions of each assignment.
The respective assignments are nominally marked out of 10, 15, and 10.
The final weighting ratio of assignments/examination
will be chosen so that each student will get the better mark
from either ratio of 35/65 or 30/70. You need NOT ask for this. It will
be done automatically by the marks processing suite.
Instructors and Contact Information
The lecturer is Professor Norman Foo (email@example.com).
There are four tutors and three consultants: for details
see the Tutors section below. All are reachable
by e-mail with ids listed there. The
administrator is Mr Krystian Ji, a graduate student.
Course and Assignment Questions
For general course questions please email firstname.lastname@example.org.
For questions specific to an assignment please email
cs2011.hwX@cse.unsw.edu.au where X is 1, 2 or 3 according to the
Administrative and Personal Problems
For administration related questions including
personal issues that
may constitute extenuating circumstances, please email Professor
Foo (email@example.com) for a confidential appointment.
All code examples for lectures and tutorials will be published in this directory.
While you are encouraged to make use of this forum, please note that:
This forum is not moderated. (i.e. the content of the discussions do not necessarily mean that they are correct.) Look at FAQs instead for "official"
Anything that is considered offensive will be taken out of the forum.
Do not use the forum for anything other than discussion among yourselves
on topics treated in this course.
Standard UNSW and CSE policies on plagiarism apply. While you are
encouraged to dicuss ideas with friends, to the extent of broad
design structures, all coding in assignments must be your own. We
use the very effective plagiarism detector on all submissions.
The individual assignments will appear here.
Not all sublinks are acessible at the moment, but will be very soon.
Closing: 6pm Friday 5 May.
- Questions on this assignment should be
emailed to firstname.lastname@example.org. The answers to
some questions will be used to construct the FAQ.
- Model answers for the
written questions in the assignment.
No sample examination will be distributed.
However the front pages of both
exams are available to show you the instructions
and overall exam format, and you can also see
three sample questions.
Be warned that these questions do not necessarily indicate the depth
of knowledge that the examination will explore. A good way to review
material is by looking at the Tutorial questions for the entire
semester, which is perhaps a better indication of the depth expected.
Examination Timetable for CSE courses.
Tutorial 12, week 13, is the last tutorial for the
For the week of 6 June consultations are as before, i.e.
Mon 14:00 NICTA -- Norman;
Wed 14:00 NICTA -- Krystian;
Thur 15:00 K17-204 -- Shai;
Fri 14:00, NICTA -- Krystian. (Note change to venue for Thur.)
Beginning the week of 12 June, up to and including
Tuesday 20 June there are more consultation hours;
these consultations run for 1 hour from the times stated below, and
will be held in either in K17-204 or in NICTA.
Mon 14:00 NICTA -- Norman
Tues 16:00 K17-204 -- Ka Shu
Wed 13:00 K17-204 -- Johan
Wed 14:00 NICTA -- Krystian
Thur 15:00 K17-204 -- Shai
Fri 14:00, NICTA -- Krystian
Fri 15:00, K17-204 -- Shai
How to get to NICTA.
Michael T. Goodrich and Roberto Tamassia,
Data Structures and Algorithms in Java, 4th Edition, 2005, John Wiley & Sons, New York.
Algorithms in Action
- a website hosted by the University of Melbourne,
featuring Java animations of sorting and searching algorithms
(use the login "guest" and password "unsw").
CRICOS Provider Number: 00098G