Algorithm and Data-structure Analysis
- Course-codes: CompSci 2201
- Year-level: 2
- Study-units: 3
- Contact: 24 hrs lectures, and 6 hrs tutorials
Course offerings
2015 Semester 2
2015 Trimester 3
Why should I study Algorithm and Data-structure Analysis?
What will I learn?
You will learn about:
- Ideas of correctness and proof, to enable you to verify that
your programs do what you intend;
- Notions of complexity and analyisis, so that you can see how
the execution time of a programs depends on the size of the problem it is
solvingU;
- Approaches to problem solving;
- The notion of abstract-data-type, and its importance in modular
design;
- Recursion;
- ADT representations of stacks, queues, lists, sets, trees and
hash-tables; and
- THe concept of graphs, and graph traversal algorithms
What should I know before I enrol?
The exercises in this course require you to write programs
confidently in a high-level object-oriented language,
such as C++, or Java.
The required knowledge can be obtained from the course Object-oriented programming
which teaches programming How will my performance be assessed?
Your performance in the course will be assessed in three ways:
- Tutorial assignments will contribute between
20% and 30% to your final score.
- The final exam usually contributes the remainder of
the marks.
- SGDE will contribute to 5% of your final mark
The precise details of assessment vary from year to year, and will
be explained at the first lecture.
What comes next?
There course that naturally follows on from Algorithm and Data-structure
Analysis is::
What do students think of this course?
From time-to-time, we ask students to give their opinion of this course,
and allow the lecturers to respond to the evaluation.
The most recent results, labelled "courseEvaluation", and "courseResponse"
are here:
Handy links
Disclaimer
The information presented here should apply to most students.
It is possible, however, that special conditions may apply to you.
You can find out by reading the
University Calendar program rules
|
