Algorithms & Numerical Methods - ELE00028I

« Back to module search

  • Department: Electronic Engineering
  • Module co-ordinator: Dr. Janet Clegg
  • Credit value: 20 credits
  • Credit level: I
  • Academic year of delivery: 2017-18
    • See module specification for other years: 2018-19

Module occurrences

Occurrence Teaching cycle
A Autumn Term 2017-18 to Summer Term 2017-18

Module aims

Subject content aims:

  • To develop students' understanding of and expertise in software design and

implementation by providing solid grounding in the theory and applications of data

structures and algorithms

  • To introduce students to numerical methods

Graduate skills aims:

  • To develop skills in the application of applied numeracy and algebraic techniques

Module learning outcomes

After successful completion of this module, students will:

  • Understand the role of algorithm and data structure design in software, and be

able to appraise and articulate design choices in terms of algorithm efficiency as

well as correctness, reliability and maintainability

  • Know the definitions and roles of important abstract data types: lists, stacks,

queues, tables, trees and graphs, and be able to implement, debug and validate

important abstract data types

  • Understand examples of the trade­offs between different types of implementation

for abstract data types for example the implementation of a table with unordered

and ordered arrays, a binary search tree or a hash table and analyse the

computational cost of each

  • Know of and be able to implement standard algorithms in sorting (including

quicksort, radix sort and heapsort), searching (including binary search), tree

traversal, and graph analysis

  • Be able to describe, understand and implement a range of numerical methods,

indicating their strengths, weaknesses and areas of application

  • Understand basic numerical methods in MATLAB and design and implement

optimisation algorithm in MATLAB

Graduate skills learning outcomes

After successful completion of this module, students will:

  • Be able to explain commonly­encountered technical concepts concisely and

accurately

  • Be able to select and apply a range of mathematical techniques to solve problems

Assessment

Task Length % of module mark
Essay/coursework
Programming Assignment
N/A 50
University - closed examination
Algorithms & Numerical Methods
1.5 hours 50

Special assessment rules

None

Reassessment

Task Length % of module mark
Essay/coursework
Programming Assignment
N/A 50
University - closed examination
Algorithms & Numerical Methods
1.5 hours 50

Module feedback

Feedback on the examination performance will be provided within six weeks. Feedback

on submitted code will be provided within six weeks of submission. Formative feedback is

provided in seminars.

Indicative reading

Computational Methods in Elementary Numerical Analysis, JL Morris, Wiley - Any edition

Software Design for Engineers and Scientists J A Robinson, Newnes - Any edition



The information on this page is indicative of the module that is currently on offer. The University is constantly exploring ways to enhance and improve its degree programmes and therefore reserves the right to make variations to the content and method of delivery of modules, and to discontinue modules, if such action is reasonably considered to be necessary by the University. Where appropriate, the University will notify and consult with affected students in advance about any changes that are required in line with the University's policy on the Approval of Modifications to Existing Taught Programmes of Study.