School of Computer Science

Module 06-21921 (2011)

Fundamentals: Data Structures

Level 4/M C

James Yandle Semester 2 10 credits
Co-ordinator: Steven Vickers
Reviewer: Eike Ritter

The Module Description is a strict subset of this Syllabus Page.

Aims

The aims of this module are to:

  • Give an overview of fundamental data structures and algorithms.
  • Explain the relative strengths and limitations of the fundamental data structures

Learning Outcomes

On successful completion of this module, the student should be able to:

  • Understand and distinguish between a range of abstract data types and their underlying representation
  • Appreciate the difference between basic complexity classes of algorithms
  • Assess and select the most appropriate abstract data types in solving a range of problems

Teaching methods

2 hrs lectures/tutorials per week


Assessment

  • Sessional: 1.5 hour examination (80%), continuous assessment (20%)
  • Supplementary: 1.5 hour examination (100%)

Detailed Syllabus

  1. Data, Data Type and Abstract Data Type (ADT)
  2. Specification and Representation of an ADT
  3. Lists as an ADT and their representation
  4. Index Lists
  5. Stacks and Queues and their representation
  6. Tree Structures – binary and higher order
  7. Binary Search Trees and Balanced Trees
  8. Graphs and their representation

Programmes containing this module