|
UNIT OUTLINES 2005 |
| home > undergraduate > Algorithms 300 > Algorithms 300 Homepage |
|
Algorithms 300 (230.300) 6 points / Semester 1 Handbook Description The official Handbook entry Unit Aims An algorithm is a step-by-step description of a task, usually to be performed by a computer. Designing correct and efficient algorithms for the myriad of tasks we want a computer to do is the fundamental process of computer science. This course will expose the student to a selected collection of important algorithms, and to the techniques involved in analysing the efficiency of these algorithms. Although designing an algorithm for a new task is a highly creative process, it is hoped that this course will at least provide the would-be algorithm designer with an idea as to the kind of questions they should be addressing and the kind of results that can realistically be achieved. The generic attributes addressed by this unit include the ability to apply knowledge of basic science and engineering fundamentals, in-depth technical competence in algorithm design and implementation, and the ability to undertake problem identification, formulation and solution. A group project will be set emphasizing the need for students to develop the generic attribute of effective functioning as a team member or leader. The groups will be selected by the lecturer with the aim of creating diverse multi-cultural teams, as far as possible. Teaching Staff
Textbook Cormen, Leiserson, Rivest, and Stein., Introduction to Algorithms, MIT Press, 2001. Contact Hours With regards to formal contact hours, you will be expected to attend 26 hours of lectures and required to attend 6 hours of tutorials. The student would normally be expected to do an hour of additional reading per lecture, and on average (this will vary from week to week) 2 hours work per tutorial. A project in Java will be given which may occupy (on average) up to 4 hours work per week. An average student is expected to spend about 10 hours per week on this unit, although this will vary considerably according to student ability and enthusiasm. Assessment The assessment scheme for CS300 this year consists of laboratory exercises, tutorials, a project, and a final 3 hour examination. The tutorials address the generic attributes of technical competence in algorithm design and implementation. The project is loosely specified and thus addresses the need for students to identify problems, formulate and implement a solution in a team environment. Unsatisfactory Progress
Penalties The School of Computer Science and Software Engineering has adopted a policy on minimum penalties for late items of assessment. This is the default policy of all units unless indicated otherwise, in writing, by the specific unit coordinator. Plagiarism Plagiarism is broadly defined to be when any portion of the work presented for assessment, can be attributed to another party. The student making the submission should acknowledge what aspects of the presented work is not directly derived by them. For the purposes of plagiarism it is irrelevant that you have been given permission by someone to copy their work and present it as your own. Faculty Scaling Final assessment is subject to the Faculty Scaling Policy.
This information is correct as at 24-Feb-2005, but is subject to change from time to time. In particular, The University reserves the right to change the content and/or method of presentation and/or the method of assessment of any unit of study, to withdraw any unit of study or programme, and/or to vary arrangements for any programme. Copyright© 2005 School of Computer Science, & Software Engineering The University of Western Australia CRICOS Provider Code: 00126G Last updated: 24-Feb-2005 |