This programme focuses on advanced techniques for the development of software systems, with an emphasis on the construction and management of internet-oriented, agent-oriented and large software systems. It is built around taught core modules such as software design and architecture and a group project that provides experience of working in a syndicate to design, implement and document a substantial software product.
These modules are complemented by a range of optional modules that relate to various aspects of computing. The final part of the programme is an individual project which is closely linked with the Department's research activities.
Lectures; tutorials; seminars; laboratory sessions; optional career planning workshops. Assessed through: coursework; written examinations; final project report.
To convey an understanding of the basic elements of software measurement and testing, in particular focusing on automated test data generation and with a discussion of the relative strengths and weakness of each technique.
To be able to describe, apply and critique several well-known software metrics. To be able to describe and apply several well-known software testing techniques. To be able to compare testing techniques and present arguments relating to the most appropriate choice thereof.
Measurement: Representation and modelling, Scales, Structural Measures
Unit testing: Control Flowgraph Based testing including Data Flow based testing
Finding test cases using test data generation techniques. Coverage
Slicing and static analysis techniques
Industrial applications and industrial relevance of testing
Comparative software testing techniques
To explore the practice of software architecting as applied to the development of enterprise systems. To learn about software architecture, architecture patterns, frameworks, design patterns, pattern languages, layers of change, the architecting process and the practical process of software design and implementation. Ideas are put into practical perspective through an introduction to the UML2 superstructure, enterprise component middleware.
To be able to function as a software architect; to have an advanced knowledge of the issues, techniques and processes involved in architecture design; ability to design .NET-based enterprise software systems; expert proficiency in the UML2 superstructure to design architectures; to be able to work with and design metamodels and model transformations.
Components and connectors in the UML2 superstructure Architectural styles Domain-specific metamodels and case studies A metamodel for enterprise components
Semantics through the OCL
Metamodelling with the Meta Object Facility Model driven engineering and model-driven architecture
To describe some techniques employed in the characterisation of agents and multi-agent systems. To provide a critical introduction to theories and methods regarding multi-agent computer systems and their component agents.
On completion of the module, you will be expected to have acquired: A thorough, systematic understanding of key features of current theories and methods regarding multi-agent systems and their component agents; A sound appreciation of the conceptual issues involved in the characterisation of agents and their abilities; Knowledge of some of the main techniques employed in the formal characterisation of agents and multi-agent systems; An ability to critically evaluate current work in this field, and to evaluate the principal theories and methods.
Topics will be selected from:
Intelligent agents and their design
Knowledge in multi-agent systems
The Belief-Desire-Intention model of rational agents
Reactive and hybrid agent architectures
Agent Communication: KQML, FIPA
Auctions and Negotiations Game Theory Argumentation based Reasoning and Communication
Agent-based methodologies Applications
The aim of this module is to define, analyse and compare abstract models of computation and their associated programming paradigms.
On successfully completing the module you should be able to demonstrate a deep knowledge and understanding of the fundamentals of formal languages and the principal models of computation and be able to work with theoretical/research-based knowledge at the forefront of the subject; judiciously apply and combine tools and techniques (frequently in novel ways) to solve a range of complex subject-specific problems with minimal direction; analyse subject material, draw inferences, and find relationships that demand that innovative thinking be engaged in and creativity be exhibited in formulating solutions; critically evaluate, exercise judgement, and compare and contrast relevant material with minimal guidance and to consider and argue for alternative, novel approaches; demonstrate a high degree of independence in managing your own learning and reflecting upon it in order to complete research tasks autonomously.
Introduction to abstract models of computation
Finite Automata, Push-Down Automata and applications to parsing
To provide you with an introduction and overview to the computational aspects of parallel and distributed computing. To introduce several important parallel computing models that capture the essence of existing and proposed types of synchronous and asynchronous parallel computers. To study typical models for distributed computing. To study a few typical algorithms for each model, selected from various basic areas such as sorting, selection, graphs, matrices, numerical problems, and computational geometry. To provide an important skill for those who may work with large applications since these usually must be implemented on a parallel or distributed system, due to their memory space and speed requirements.
On successfully completing this module you should understand a number of different models of parallel and distributed computing and understand the basic techniques for designing algorithms in these models.
PART I: Parallel Models and Algorithms
Models of Parallel Computation:
PRAMs; Scan Vector Model; Complexity measures
Designing Parallel Algorithms:
Basic PRAM techniques; Doubling technique; Summation trees and prefix summation
Graph models of networks; Network properties; Searching and sorting on meshes
Sorting and Searching on PRAMs:
Merge sort; Compare-exchange sorts; Batcher‟s sorting algorithms; Computing the Median
List ranking; Tree contraction; Connected components; Minimum spanning tree; All-pairs shortest path
Convex hulls; Closest pair of points; Visibility
PART II: Distributed Models and Algorithms
Concepts of distributed computation:
Termination; Failure tolerance; Network topology
Random walks; Introduction to Markov processes; Random walks (hitting time, cover time (s.t)-connectivity
Broadcasting; Robust distributed networks
This module will cover different approaches for building internet applications and the choice of design techniques and technologies involved from a software engineering perspective, considering issues of efficiency, modularity and maintainability.
You will gain the ability to design and implement internet-based applications in a modular manner, using appropriate languages and techniques. You will also gain the ability to specify and design medium-sized enterprise information systems using appropriate languages and techniques.
Model-driven architecture and application to internet applications
Server-side processing techniques: JSP, Servlets, database interfaces, sessions, connection pools
Modularity and maintainability of internet applications
Java EE architecture and patterns
Type Weighting Marking Model
Written examination (2 hours), January 100%
Formative assessments: Tutorial exercise sheets and online quizzes
Module Pass Mark: 50%
To provide an overall understanding of the communication models and languages underlying the Web. To provide an in-depth understanding of technologies and standards allowing the Web to be extended so that software can interact with the data available on it. To provide an understanding of security threats to Internet applications and the main technologies used to tackle them. To give students an understanding of the motivations behind Web technologies, suitable for them to evalaute current and future options.
A student successfully completing this module will:
Development of Knowledge and Understanding
Have a comprehensive and detailed knowledge of the languages, standards
and communication technologies underlying the Web and recent
developments in this area;
Understand the security mechanisms used to protect Web applications
from unauthorised use;
Understand how protocols and languages combine to solve communication
Understand how data across the web can be interlinked in a manner that
Be able to analyse Web-related problems using appropriate techniques
and evaluating alternatives;
Be able to design solutions to such problems and evaluate the success of
those solutions, possibly developing novel approaches;
Apply their knowledge of the Web and its languages to these solutions;
Know how to access and evaluate different sources of information regarding
Web standards, and technology standards more generally;
Have experience of solving technical, Web-related problems, and arguing
for solutions to them;
Be able to apply their knowledge of languages to meet appropriate software
Technological basis of the Web
Web languages fundamentals
XML validation with schemas
Web service languages
Security on the Web
Public and private key encryption
Distributed computation on Web data
L. Shklar and R. Rosen, Web Application Architecture, 2nd Edition, Wiley, 2009, ISBN: 978-0470518601
D. Gourley and B. Totty, HTTP: The Definitive Guide, O'Reilley, 2002,
J. Rhoton and R. Haukioja, Cloud Computing Architected, 2011,
E.T. Ray, Learning XML, 2nd Edition, O'Reilley, 2003, ISBN: 0-596-00420-6
Coulouris, J.D. and T. Kindberg, Distributed Systems: Concepts and Design, 4th Edition, Addison-Wesley, 2005, ISBN: 0-321-26354-5
S. Garfinkel, Web Security, Privacy and Commerce, O'Reilley, 2001,
Bachelors degree with 2:1 honours degree (or international equivalent) in computer science, mathematics, physics, chemistry, electrical engineering, or a joint degree in two such subjects.
Competence in a high level programming language such as Pascal, C, C++, Java, etc, to the level expected at the end of the first year of a BSc honours degree in computer science.
We may lower entry qualifications for students with substantial relevant work experience.
Your application will be reviewed by an admissions tutor and we aim to respond to applications within four to six weeks, although this may take longer during busy and holiday periods.
Please submit a one page personal statement with your application, explaining why you wish to apply for this programme and why you feel it matches your interests, academic background, and, if relevant, your career plans. Please include transcripts of subjects taken in the relevant degrees and copies of all certificates and relevant qualifications mentioned in your application.