Modules

Due to Covid-19 restrictions, learning and teaching activities on campus as described in the module descriptors are currently restricted. Learning and teaching will be enabled through a mixture of scheduled online activity where you will be able to engage with your tutor and classmates in real-time and unscheduled guided activity where you will be required to complete activities and tasks at a time which best suits you. Teaching will take place on campus, wherever possible, and where this is safe to happen.

Definitive information on module delivery during 2020/21 will be provided on Module Moodle Sites. For specific enquiries please contact the module leaders directly.

Core Module Information
Module title:	Algorithms and Data Structures
SCQF level:	09:
SCQF credit value:	20.00
ECTS credit value:	10
Module code:	SET09417
Module leader:	Christos Chrysoulas
School	School of Computing
Subject area group:	Software Engineering

Prerequisites

To study this module you will need the learning equivalent to the module listed or have passed this module. An examples of equivalent learning include experience of programming in a suitable high level programming language.

Description of module content:

Performance analysis and approximations for algorithms will be considered. The big “O” notation will be looked at to estimate space and time requirements for some classical algorithms and data structures. This will include the partition of problems into constant, linear and exponential growth properties of the associated algorithms. Iterative and recursive algorithms and their relationships will form a core of investigating various searching and sorting methods.
The usual useful linear data structures such Arrays, Lists, Queues and Stacks, their capabilities, performance and uses will be studied. Several associative data structures such as Sets, Dictionaries by Hash Tables and Binary Trees will be analysed to evaluate their capabilities and performance characteristics.

Learning Outcomes for module:

Upon completion of this module you will be able to
LO1: Evaluate the performance of an algorithm based on the size of a problem input
LO2: Examine and evaluate the algorithms that work on various data structures
LO3: Evaluate and discuss the capabilities of data structures to applicable problems
LO4: Demonstrate a working knowledge of a relevant data structures API
LO5: Design, develop and evaluate data structures and algorithms
LO6: Evaluate and design encoding algorithms, including cryptographic, hashing, and compression

Full Details of Teaching and Assessment

2020/1, Trimester 2, Face-to-Face,
VIEW FULL DETAILS

Occurrence:	002
Primary mode of delivery:	Face-to-Face
Location of delivery:	MERCHISTON
Partner:
Member of staff responsible for delivering module:	Christos Chrysoulas
Module Organiser:

Learning, Teaching and Assessment (LTA) Approach:

The student is required to be employed as a Graduate Apprentice based in and around Edinburgh to be eligible to complete
this module, in this format. This module is offered in day release (GA) study mode and will be delivered during the period that
students are attending classes from 9 am to 5 pm, one day per week. The delivery of the module is in line with normal university
delivery models. The traditional lecture materials will be delivered in a blended form using online materials, while in-class time
is devoted to practical exercises, projects, or discussions. The module is designed around online and student-centred learning
in practice with an emphasis on building a learning community. The module is introduced by an induction workshop which
introduces students to the online resources and explains the assessment process.
' There will be a combination of traditional lecture/practical format classes supplemented with significant use of a detailed
study guide and web-based resources LOs 1-5.
' This module will be delivered using a combination of lectures, practicals and tutorials during the face to face monthly
sessions supported by online activities and directed study. The practicals offer the students a chance to practice their
programming skills (LOs 1, 4 & 5) and the tutorials will be used to emphasise those aspects of software development which
need discussion and debate, such as problem-based reasoning, software design and test case design(LOs 1, 2, 3 & 5).
' Students are expected to do further reading, significant amounts of directed study and practical work and substantial
independent learning using the detailed study guide and web-based resources. LOs 1-5.

Formative Assessment:

To support formative feedback, the Software Engineering subject group utilise a lab based teaching approach across their provision. During these lab sessions, staff will discuss and evaluate student progress and provide feedback on how well they are progressing with their work. All modules in the subject group also require students to demonstrate their coursework on submission to provide further formative feedback on how the work could be improved.

Summative Assessment:

A summative assessment occurs near the middle of the module which covers LOs 1-5 (partial 1, 2, 3 & 5). This will comprise an appropriate practical assessment exercise. A formal examination will be set at the end of the module to assess the theoretical aspects of the subject matter (LOs 1, 2, 3 & 5).

Student Activity (Notional Equivalent Study Hours (NESH))
Mode of activity	Learning & Teaching Activity	NESH (Study Hours)
Face To Face	Tutorial	21
Independent Learning	Guided independent study	177
Face To Face	Centrally Time Tabled Examination	2
	Total Study Hours	200
	Expected Total Study Hours for Module	200

Assessment
Type of Assessment	Weighting %	LOs covered	Week due	Length in Hours/Words
Practical Skills Assessment	40	1-5	10	HOURS= 40, WORDS= 0
Centrally Time Tabled Examination	60	1,2,3,5	14/15	HOURS= 2, WORDS= 0
Component 1 subtotal:	40
Component 2 subtotal:	60
Module subtotal:	100

Indicative References and Reading List - URL:

Contact your module leader

Module Name Search

Edinburgh Napier University

Modules

Related information