Data-structures and Algorithms
Why should I study this course?
What will I learn?
- Dealing with Complexity
- Abstract Data Types, Classes, Polymorphism, SVN
- Execution Time Management
Linear Data Structures
- Vectors and Enumerations
- Linked Lists
Non-Linear Data Structures
- Search Trees
- Priority Queues
- Hash Tables
- Skip Lists
What should I know before I enrol?
How will my performance be assessed?
Your performance in the course will be assessed in three ways:
- Practical exercise marks will contribute between
20% and 30% to your final score.
- The final exam usually contributes the remainder of
- Tutorials are not usually assessed.
However, we do record your attendance.
The precise details of assessment vary from year to year, and will
be explained at the first lecture.
What comes next?
There are a number of courses that follow on from Data-structures and Algorithm:
- Programming Techniques examines clever sort algorithms, and more
complex data structures that are used for processing graphs.
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"
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