Module 21921 (2013)
Syllabus page 2013/2014
06-21921
Fundamentals: Data Structures
Level 4/M C
Steven Vickers (coordinator)
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus
The Module Description is a strict subset of this Syllabus Page. (The University module description has not yet been checked against the School's.)
Relevant Links
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: | Assessed by: | |
| 1 | Understand and distinguish between a range of abstract data types and their underlying representation | Examination |
| 2 | Appreciate the difference between basic complexity classes of algorithms | Examination |
| 3 | Assess and select the most appropriate abstract data types in solving a range of problems | Continuous Assessment |
Restrictions, Prerequisites and Corequisites
Restrictions:
None
Prerequisites:
None
Co-requisites:
None
Teaching
Teaching Methods:
2 hrs lectures/tutorials per week
Contact Hours:
Assessment
- Sessional: 1.5 hour examination (80%), continuous assessment (20%)
- Supplementary (where allowed): 1.5 hour examination (100%)
Recommended Books
| Title | Author(s) | Publisher, Date |
| Data Structures and Algorithm Analysis in Java Second Edition | Mark Allen Weiss | Pearson International Edition, 2007 |
| Data Structures and Abstractions with Java Second Edition | Frank M. Carrano | Prentice Hall, 2007 |
Detailed Syllabus
- Data, Data Type and Abstract Data Type (ADT)
- Specification and Representation of an ADT
- Lists as an ADT and their representation
- Index Lists
- Stacks and Queues and their representation
- Tree Structures binary and higher order
- Binary Search Trees and Balanced Trees
- Graphs and their representation
Last updated: 21 Aug 2009
Source file: /internal/modules/COMSCI/2013/xml/21921.xml
Links | Outline | Aims | Outcomes | Prerequisites | Teaching | Assessment | Books | Detailed Syllabus