School of Computer Science

Module 06-21921 (2013)

Fundamentals: Data Structures

Level 4/M C

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

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

Outline

The module will explore fundamental data structures and associated algorithms, and their representation in high-level programming languages. The module is particularly suitable for MSc students who have little previous background in Computer Science.


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:

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


Restrictions


Taught with

  • 06-21977 - ICY Data Structures & Algorithms

Teaching methods

2 hrs lectures/tutorials per week

Contact Hours: 24


Assessment

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

Supplementary (where allowed): 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