Module 21921 (2013)

Module Description - Fundamentals: Data Structures

The Module Description is a strict subset of the Syllabus Page, which gives more information

Module TitleFundamentals: Data Structures
SchoolComputer Science
Module Code06-21921
DescriptorCOMP/06-21921/LM C
Member of StaffSteven Vickers (coordinator), Paul Levy
LevelM C
Credits10
Semester2
Pre-requisitesNone
Co-requisitesNone
RestrictionsNone
Contact hours24
Delivery2 hrs lectures/tutorials per week
Description 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.
Outcomes
On successful completion of this module, the student should be able to:Assessed by:
Understand and distinguish between a range of abstract data types and their underlying representation Examination
Appreciate the difference between basic complexity classes of algorithms Examination
Assess and select the most appropriate abstract data types in solving a range of problems Continuous Assessment
AssessmentSessional: 1.5 hour examination (80%), continuous assessment (20%)
Supplementary (where allowed): 1.5 hour examination (100%)
TextsMark Allen Weiss, Data Structures and Algorithm Analysis in Java – Second Edition, 2007
Frank M. Carrano, Data Structures and Abstractions with Java – Second Edition, 2007