Module Search

COMP3557: DESIGN OF ALGORITHMS AND DATA STRUCTURES

Please ensure you check the module availability box for each module outline, as not all modules will run in each academic year. Each module description relates to the year indicated in the module availability box, and this may change from year to year, due to, for example: changing staff expertise, disciplinary developments, the requirements of external bodies and partners, and student feedback. Current modules are subject to change in light of the ongoing disruption caused by Covid-19.

Type	Open
Level	3
Credits	10
Availability	Available in 2024/2025
Module Cap	None.
Location	Durham
Department	Computer Science

Prerequisites

COMP2181 Theory of Computation

Corequisites

None

Excluded Combinations of Modules

None

Aims

The aim of the module is to equip students with the ability to design and analyse efficient algorithms and data structures.

Content

To be chosen from the following:
hashing (universal, perfect, Cuckoo, Bloom filters)
treaps
skip lists
splay trees
basic models and algorithms for sub-linear space (streaming)
basic models and algorithms for sub-linear time (e.g., property testing)
basic PRAM (shared-memory parallel) algorithms and techniques

Learning Outcomes

Subject-specific Knowledge:

On completion of the module, students will be able to demonstrate:
a knowledge about various important problem solving paradigms in the broad area of algorithmic design.
an understanding of how to measure, transfer and handle data
an ability to apply techniques and methods from the relevant topics to tackle fundamental algorithmic problems;
an ability to conduct review and self-study to further their knowledge beyond the taught material.

Subject-specific Skills:

On completion of the module, students will be able to demonstrate:
an ability to apply methods and techniques from various algorithmic design paradigms
an ability to apply methods and techniques from discrete mathematics
an ability to reason with and and apply methods of mathematical proof

Key Skills:

On completion of the module, students will be able to demonstrate:
an ability to think critically;
an ability to work with abstract problems;
an ability to undertake general problem solving.

Modes of Teaching, Learning and Assessment and how these contribute to the learning outcomes of the module

Lectures enable the students to learn new material relevant to the design of efficient algorithms and data structures, as well as their applications.
Formative and summative assessments assess the application of methods and techniques, and examinations in addition assess an understanding of core concepts.

Teaching Methods and Learning Hours

Activity	Number	Frequency	Duration	Total
lectures	22	2 per week	1 hour	22
preparation and reading				78
total				100

Summative Assessment

Component: Examination		Component Weighting: 100%
Element	Length / Duration	Element Weighting	Resit Opportunity
Examination	2 hours	100	No

Formative Assessment

Example formative exercises are given during the course. Additional revision lectures may be arranged in the module's lecture slots in the 3rd term.

More information

If you have a question about Durham's modular degree programmes, please visit our FAQ webpages, Help page or our glossary of terms. If you have a question about modular programmes that is not covered by the FAQ, or a query about the on-line Undergraduate Module Handbook, please contact us.

Prospective Students: If you have a query about a specific module or degree programme, please Ask Us.

Current Students: Please contact your department.