Algorithms and Data Structures - CIS2206

Assessment 1: Written practice exercise

Formative assessment for this module will take the form of weekly exercises with appropriate feedback, including model solutions.

Written practice exercise

Assessment 1: In-Class Test

One 1.5hr unseen open book in-class test through the University’s VLE, covering algorithm efficiency and complexity, as well as data structure properties and uses.

In-Class Test

Assessment 2: Portfolio

Develop a portfolio of programming and theoretical exercises that cover relevant topics in data structures and algorithms, such as sorting and searching, linked lists, trees and graphs. A written evaluation of this portfolio will also be required (500 words indicatively).

Portfolio

<p>In this module you will be supported in expanding your programming skills to cover a range of standard data structures (e.g. lists, trees and graphs) and algorithms (e.g. searching, sorting and traversals) for both sequential and concurrent systems. You will also study how to analyse systems in order to determine their complexity, correctness and safety, and to calculate their efficiency.</p>

Requirements apply to students taking an IET accredited course. Please refer to the Programme Specification Document for details.

School of Computing and Engineering

<p>https://library.hud.ac.uk/readinglists/CIS2206</p>

Container 1

Computing and Information Systems

CIS2206 - Algorithms and Data Structures

Algorithms and Data Structures

Develop complex algorithms and data structures to solve practical problems.

Describe a range of useful data structures and algorithms, their properties and uses.

Analyse the correctness, complexity and efficiency of algorithms.

Discuss the classification of algorithms according to efficiency and complexity.