School of Computer Science - Nottingham€¦ · Computer Communications and Networks G52CCN 2 Machines and their Languages G52MAL 2 C++ Programm ing G52CPP 2 Operating Systems and

Page 1 of 31

School of Computer Science

UNDERGRADUATE MODULES FOR 2015-2016

Full Year

Module Module Code Level

Software Engineering Group Project G52GRP 2

Individual Dissertation Single/Joint Honours G53IDS/J 3

Planning, Search and Artificial Intelligence

Programming

G52PSA 2

Autumn Semester – Computer Science Modules


Computer Fundamentals G51CSF 1

Mathematics for Computer Scientists G51MCS 1

Programming and Algorithms G51PGA 1

Systems and Architecture G51SYS 1

Software Engineering Methodologies G52SEM 2

Algorithms and Data Structures G52ADS 2

Introduction to Formal Reasoning G52IFR 2

Software Application Development G52SAD 2

Human Computer Interaction G52HCI 2

Introduction to Image Processing G52IIP 2

Computers in the World G53CWO 3

Software Quality Management G53SQM 3

Autonomous Robotic Systems G53ARS 3

Compilers G53CMP 3

Autumn Semester – Compulsory Business Modules for Joint Honours


Entrepreneurship and Business N11440 1

Business Economics N11607 1

Work and Society N11612 1

Contemporary Economic Policy N12107 2*

Designing and Managing Organisations N12617 2

Strategic Management I N13410 3

Human Resource Management I N13425 3

*Note : N12107 is offered as N11107, level 1 module in Malaysia Campus

Page 2 of 31

Spring Semester – Computer Science Modules


Programming Paradigms G51PGP 1

Databases and Interfaces G51DBI 1

Introduction to Software Engineering G51FSE 1

Fundamentals of Artificial Intelligence G51FAI 1

Computer Communications and Networks G52CCN 2

Machines and their Languages G52MAL 2

C++ Programming G52CPP 2

Operating Systems and Concurrency G52OSC 2

Computer Security G53SEC 3

New Media Design G53NMD 3

Machine Learning G53MLE 3

Spring Semester – Compulsory Business Modules for Joint Honours


Consumers and Markets N11401 1

Organisational Behaviour N11613 1

New Venture Creation N11601 1

Economics of Business Decisions N12604 2

Organising and Managing in Practice N12606 2

Strategic Management II N13418 3

Human Resource Management II N13426 3

Page 3 of 31

Notes:

1. Modules offered in any semester are subjected to change as they depend on staff

availability and sufficient number of student’s enrolments.

2. The descriptions of the offered modules are current as and when this document is

prepared but they may be subjected to modifications or additions by the module

convenor.

3. Students may take modules offered by other Schools provided appropriate

approval has been obtained from the Course Director of the School of Computer

Science and the module convenor of the offering School, subjected to the

condition that there is no clash in the timetables and that all prerequisites and

corequisites of the selected module are met. A maximum of 20 credits of such

modules are allowed in each academic year.

4. This document provides summaries as well as important details of Computer

Science modules that are only relevant to the Malaysia Campus. Other

information not included in this document e.g. education aims, learning outcomes

as well as descriptions of other non-Computer Science modules, can be viewed at

the Nottingham’s Module Catalogue web site below:

http://modulecatalogue.nottingham.ac.uk/Malaysia/ // Malaysia Campus

http://modulecatalogue.nottingham.ac.uk/Nottingham/ // UK Campus

5. Module course notes, lecture handouts, laboratory instructions, courseworks and

their submission procedure are available in:

https://moodle.nottingham.ac.uk/login/index.php

http://modulecatalogue.nottingham.ac.uk/Malaysia/

http://modulecatalogue.nottingham.ac.uk/Nottingham/

https://moodle.nottingham.ac.uk/login/index.php

Page 4 of 31

G52GRP – Software Engineering Group Project (20 Credits) – Full Year 2015-2016

1. Pre-requisites (P) & Co-requisites (C); Assessment Details (A)

P: None; C: G52SEM; A: Coursework 100%

2. Lecturer

Tomas Maul (Dr)

Contact: 03-89248232 (Office Phone); BB64 (Room)

E-mail: [email protected]

3. Summary of Content

Working in groups of around five to six people, you’ll be assigned a supervisor who

will provide you with a short written description of a computer application to be

designed, programmed, and documented during the course of the module. Each

group will meet regularly with and without its supervisor; you’ll also have several

introductory one hour lectures.

4. Lecture Programme

Lecture

No Lecture Topic

1 Overview: Aims, Organization, Assessment

2 Team Working and Group meetings

3 Version Control

4 Characteristics of a good project

5 Course Information Review

6 Code Quality, Maintainability, Reusability, Debugging and Testing

7 Report Writing

8 Giving an Effective Presentation

5. Resources

Reference texts as relevant to the project topics.

6. Learning Outcomes

http://modulecatalogue.nottingham.ac.uk/malaysia/asp/moduledetails.asp?crs_id=

501894&year_id=000115


http://modulecatalogue.nottingham.ac.uk/malaysia/asp/moduledetails.asp?crs_id=501894&year_id=000115


Page 5 of 31

G53IDS/J – Individual Disseration (40/20 Credits) – Full Year 2015-2016


P: None; C: None; A: Dissertation 80%, Practical (Demo) 10%, Progress Presentation

(Autumn) 10%

2. Lecturer

KR Selvaraj (Mr)




Students are required to perform an individual project on a topic in computer

science. Each student has a supervisor who is a member of the academic staff. The

topic can be any area of the subject which is of mutual interest to both the student

and supervisor. Through a one hour lecture and a tutorial with your supervisor each

week, you’ll develop your own independent research project and written report.

Topics can range from purely theoretical studies to practical work building a system

for some third party, although most projects aim to provide a balance between the

theoretical and practical aspects of the subject. Guidelines on word length of

dissertation are flexible to accommodate differing types of project work (e.g. balance between theory and practice) undertaken.

4. Weekly Programme

Week No Lecture Topic

1 Project Briefing

2 Information Skills

3 Literature Review

4 Plagiarism

5 Public Presentation Skills

6 Dissertation Report Preparation

7 TBA

8 TBA

5. Resources

No Name of

Author(s)

Year of

Publication

Title of Book Edition Publisher ISBN

1 Dawson,

Christian W

2000 The essence of

computing projects:

a student's guide

Prentice Hall

Reference texts recommended by the supervisors as relevant to the project topics.


http://modulecatalogue.nottingham.ac.uk/Malaysia/asp/moduledetails.asp?crs_id=

501902&year_id=000115


http://modulecatalogue.nottingham.ac.uk/Malaysia/asp/moduledetails.asp?crs_id=501902&year_id=000115


Page 6 of 31

G52PSA – Planning, Search and Artificial Intelligence Programming – (20

Credits) Full Year 2015-2016


P: G51IAI; C: None; A: Coursework 25%, Written Examination 75%

2. Lecturer

Chew Sze-Ker (Mr)

Contact: 03.89248140 (Office), BB59 (Room)



You will be introduced to Artificial Intelligence (AI) algorithms and programming

techniques for search and planning. Topics covered include: classical search; search

with non-determinism and partial observability; local search; classical planning,

reasoning about actions; planning under uncertainty; conditional planning; planning

with time and resources; other typical AI problems and how to implement them in

an AI programming language.

4. Weekly Programme


Autumn - 1 Introduction to Search.

2 Local Search and Genetic Algorithms

3 Search and SAT, Search with Non-determinism and Partial Observability.

4 Logical Agents.

5 Situation Calculus.

6 Classical Planning.

7 Classical Planning 2 and Partial Order Planning.

8 Classical Planning: GraphPlan, SatPlan.

9 Classical Planning: Planning with Time and Resources.

10 Hierarchical Planning Planning in Non-Deterministic Domains.

Spring - 1 Prolog syntax, Prolog execution, Recursive programs

2 Lists

3 Backtracking, second order programming

4 Depth first search, iterative deepening search

5 Breadth first search, state representation

6 Non-path problems, forward planning

7 Regression planning, further regression

8 Partial order planning

9 Revision & Coursework Discussions

5. Resources

No Name of

Author(s)

Year of

Publication


1 Stuart J.

Russell &

Peter

Norvig

2010 Artificial Intelligence

:A Modern Approach

3rd

Prentice

Hall

0-13-

604259-

7



504364&year_id=000115




Page 7 of 31

G51CSF – Computer Fundamentals (10 Credits) – Autumn 2015-2016

1. Pre-requisites & Co-requisites; Assessment Details

P: Students who have previously taken G51PRG cannot take this module;

C: G51PGA; A: Coursework 1 40%, Coursework 2 35%, Written Examination 25%

2. Lecturer

Chong Siang Yew (Dr)

Contact: 03-89248148 (Office); BB57 (Room)



To give a broad understanding of the internal operation and structure of computer

and network systems and to show how a computer is built up from a relatively

simple digital circuit by successive elaboration to form a number of logical layers of

functionality, hence demonstrating that hardware and software are often equivalent

in this context. Students will be able to appreciate the typical facilities and

mechanisms that underlie the operation of various high-level programming

operations and facilities, and the key conceptual steps for the evolution or realization of a conventional stored-program digital computer.

4. Weekly Programme


1 Introduction, overview and module contents

2 Boolean Logic and Arithmetic

3 Sequential Logic and Machine Language

4 Computer Architecture and Assembler

5 Virtual Machine

6 High-level Language; Coursework 1

7 Compiler

8 Operating System

9 Basic networking and I/O

10 Coursework 2

11 Revision

5. Resources

No Name of

Author(s)

Year of

Publication

Title of Book

(Primary)

Edition Publisher ISBN

1 N. Nisan &

S. Schocken

2005 The Elements of

Computing Systems:

Building a Modern

Computer from First

Principles

The MIT

Press

0-262-

64068-

6


http://modulecatalogue.nottingham.ac.uk/nottingham/asp/ModuleDetails.asp?crs_i

d=026182&year_id=000115


http://modulecatalogue.nottingham.ac.uk/nottingham/asp/ModuleDetails.asp?crs_id=026182&year_id=000115

http://modulecatalogue.nottingham.ac.uk/nottingham/asp/ModuleDetails.asp?crs_id=026182&year_id=000115

Page 8 of 31

G51MCS – Mathematics for Computer Scientists (10 Credits) – Autumn 2015-2016


P: None; C: None; A: Coursework 25%; Written Examination 75%

2. Lecturer

Iman Yi Liao (Dr)

Contact: 03-87253438 (Office), BB63 (Room)



You’ll cover the basic concepts in mathematics which are of relevance to the

development of computer software. Topics which will be covered include: boolean

algebra; simple number theory; sets, functions and relations; sum and product;

and simple induction on natural numbers. You’ll spend around three hours per week

in lectures and tutorials for this module

4. Weekly Programme


1 Introduction

2 Boolean algebra

3 Sets

4 Functions

5 Numbers theories

6 Matrices

7 Induction

8 Counting techniques (1)

9 Counting techniques (2)

10 Relations (1)

11 Relations (2)

12 Revision

5. Resources

No Name of

Author(s)

Year of

Publication

Title of Book

(Primary)


1 Kenneth H.

Rosen

2007 Discrete Mathematics

and Its Applications

6th McGraw-Hill 0-007-

124474

-3


http://modulecatalogue.nottingham.ac.uk/Malaysia/asp/moduledetails.asp?crs_id=50

1884&year_id=000115




Page 9 of 31

G51PGA – Programming and Algorithms (20 Credits) – Autumn 2015-2016


P: None; C: G51CSA; A: Coursework 75%, Written Examination 25%

2. Lecturer

Chew Sze-Ker (Mr)

Contact: 03.89248140 (Office Phone); BB59 (Room)



You’ll cover the basic concepts of programming including: problem solving;

debugging; elementary programming; functions and procedures; memory and

pointers; and data structures. You’ll spend around six hours per week in lectures,

computer classes and tutorials. The basic concepts of programming including:

problem solving, compiling, editing, debugging, elementary programming,

conditionals, loops, functions and procedures, arrays and strings, direct and indirect

access, memory and pointers, iteration and recursion and data structures.

Please note: This is a non-compensatable module.

4. Weekly Programme


1 Introduction to C compiler/Getting started with GCC

2 Procedures, Parameters, Values and Variables

3 Operators and Precedence, Conditionals and Loops

4 Pointers and scanf()

5 Arrays and Strings, Linked List, Structures

6 Introduction to Algorithms, Big O Notation

7 String Processing

8 File Input/Output

9 Data Structures (Tree, heaps)

10 Data Structures (Sorting)

5. Resources

No Name of

Author(s)

Year of

Publication


1 Kernighan,

Brian W.,

Dennis M.

Ritchie

1988 The C

programming

language

2nd Prentice

Hall

0-131-10362-8

2. Thomas H.

Cormen et al.

2009 Introduction to

Algorithms

3rd MIT Press 0-262-03384-4



504547&year_id=000115




Page 10 of 31

G51SYS – Systems and Architecture (20 Credits) – Autumn 2015-2016


P: None; C: G51CSF; A: Coursework 1 (50%), Exam 1: Written exam (25%), Exam

2: Online exam (25%).

2. Lecturer

KR Selvaraj (Mr)




This module builds upon the basic understanding of the fundamental architecture of

computers and computer networks obtained in G51CSF, to show how it applies in

real systems. It will cover the principles of the lower level implementation of I/O

using polling and interrupts, and the use of exceptions and how the Operating

System uses these to manage resources, particularly as computers become

inherently more parallel. It will show how large networks such as the Internet are

constructed. It will consider how non-numeric data is represented in computer

systems. You will spend around five hours per week in tutorials, lectures and

computer classes for this module.

4. Weekly Programme


1 Routing and Forwarding in a network

2 Local Area Networks

3 Resource Allocation

4 Overview of Operating Systems and Operating System Principles

5 Digital logic and digital systems

6 Machine level representation of data

7 Assembly level machine organization

8 Memory system organization and architecture

9 Computational Paradigms, Cross-Layer, Communications,

Interfacing and Communication, State and State Machines

10 Parallel Decomposition, Communication and Coordination,

Parallel Architecture

11 Analog and Digital representation of data, image and image

compression techniques.

12 Revision

5. Resources

No Name of

Author(s)

Year Title of Book Ed Publisher’s

Name

ISBN

1 Hohl,

William

2009 ARM Assembly

Language:

Fundamentals and

techniques

CRC


http://modulecatalogue.nottingham.ac.uk/Nottingham/asp/moduledetails.asp?crs_i

d=026181&year_id=000115


http://modulecatalogue.nottingham.ac.uk/Nottingham/asp/moduledetails.asp?crs_id=026181&year_id=000115


Page 11 of 31

G52SEM – Software Engineering Methodologies (10 Credits) – Autumn 2015-2016


P: G51ISO; C: None; A: Coursework 40%, Written Examination 60%

2. Lecturer

Behrang Parhizkar (Hani) (Mr)

Contact: 017 330 1824 (Mobile), BB47 (Room)



Building on the material presented in the Foundations of Software Engineering

module, you’ll cover three main aspects of the software development process in

depth: the system analysis and design process, the project management process

and software documentation. You’ll spend around two hours per week in lectures for

this module.

4. Weekly Programme


1 Introduction

2 & 3 UML software modeling

4 & 5 Agile and XP software development Coursework one due

6 & 7 Estimating , Scheduling, and project activity planning

8 & 9 Building a domain model, and software testing/verification

10 & 11 Software design/interface, web design, and teamwork

12 Revision Coursework two due

5. Resources

No Name of

Author(s)

Year of

Publication


1

Fowler,

Martin

2000

UML distilled :

a brief guide to

the standard

object

modeling

language

2nd

Addison-

Wesley

978-

0201657838

2 Project

Manageme

nt

Institute

2008 A Guide to the

Project

Management

Body of

Knowledge

4th Project

Management

Institute

978-

1933890517



3380&year_id=000115





Page 12 of 31

G52ADS – Algorithms and Data Structures (10 Credits) – Autumn 2015-2016


P: G51ISO & G51MFC (2014-15) or equivalent programming experience and

knowledge of mathematics; C: None; A: Exam 75% Coursework 25%

2. Lecturer

Abdur Rakib (Dr)




We will study the basics of how to specify abstract data types and use them to

design programs. This includes the use of mathematical descriptions of the

computational resources needed to support algorithm design decisions. The topics

covered include recursion and algorithm analysis, Abstract data types (such as

stack, queue, tree), graph algorithms (such as Kruskal's algorithm, Prim's

algorithm), advanced data structures (such as Hash and Bloom filters). You’ll spend

around four hours per week studying for this module in lectures and computer labs.

4. Weekly Programme


1 Introduction

2 Recursion and algorithm analysis

3&4 Abstract data types

5 Sorting algorithms

6&7 Graph Algorithms Coursework 1 due

8&9 Advanced data structures

10 Real-world application

11 Revision Coursework 2 due

5. Resources

No Name of

Author(s)

Year of

Publication


1

Mark Allen

Weiss

2012 Data Structures

and Algorithm

Analysis in Java

3rd Pearson 978-0-273-

75211-0

2 Robert

Sedgewick

2003 Algorithms in

Java Part 1-

4/Part 5

3rd Addison

Wesley

0201361205/

0201361213



502770&year_id=000115




Page 13 of 31

G52IFR – Introduction to Formal Reasoning (10 Credits) – Autumn 2015-2016

1. Pre-requisites (P) & Co-requisites (C); Assessment Details (A) P: G51FUN (2014-15); C: None; A: Coursework 1 25%, Coursework 2 25%, Written

Examination 50%

2. Lecturer

Michael Chung (Mr)



3. Summary of Content Developing the themes of the year one module Mathematics for Computer Scientists

you’ll be introduced to a mathematically rigorous approach to program construction.

You’ll study topics such as: proofs in propositional logic and predicate logic; classical vs.

intuitionistic reasoning; basic operations on types; verification of list based programs;

and introduction to program specification and program correctness. You’ll spend around

five hours per week in lectures, tutorials and computer classes for this module.

4. Weekly Programme


1 Introduction: Course content, assessment, introduction to Coq

2 Coq Basics, Propositional Logic

3 More Coq, Classical Logic

4 Bool and Predicate Logic

5 General Predicate Logic

6 More Predicate Logic

7 Operations on sets

8 Peano Arithmetic

9 Some Algebra

10 Primitive recursion

11 The omega hotel, diagonalisation

12 Lists

5. Resources

No Name of

Author(s)

Year of

Publication


1 Bertot, Yves

& Castéran,

Pierre

2004 Interactive Theorem

Proving and

Program

Development:

Coq'Art: The

Calculus of

Inductive

Constructions

1st Springer 3-

5402-

0854-

2



3381&year_id=000115


http://www.labri.fr/perso/casteran/CoqArt/index.html



Page 14 of 31

G52SAD – Software Application Development (10 Credits) – Autumn 2015-2016


P: G51ISO or equivalent; C: None; A: Code submission 50%, Engineering report 50%

2. Lecturer

Chen Zhiyuan (Dr)




This module builds on your basic Java programming developed in Year 1. Topics

include: design diagrams and modelling; GUI programming; testing; software

engineering methodologies (including agile development), in the context of

understanding and refactoring other people's code. You will spend around two hours

per week in lectures and two hours per week in computer classes studying for this

module.

4. Weekly Programme


1 Introduction to the module

2 OO Programming Refresher (1/2)

3 OO Programming Refresher (2/2)

4 OO for Engineering (+ Unit Testing)

5 UML (OO Analysis/Design) + Software Application Implementation Live

Demo

6 Open Session (depending on student feedback)

7 Working on Collaborative Projects (Open Source Software Development)

8 From OO Principles to Design Patterns + Reverse Engineering Code /

Refactoring Code

9 GUI Programming (1/2)

10 GUI Programming (2/2)

11 Open Sessions (only if needed)

5. Resources

No Name of

Author(s)

Year of

Publication


1 Parsons,

David

2012 Foundational Java

– Key Elements

and Practical

Programming

Springer 97814471

24788

(hcover)

2 Barclay,

Kenneth

2004 Object Oriented

Design with UML

and Java

Elsevier eBook

3 Fowler 1999 Refactoring -

Improving the

Design of Existing

Code

Wesley eBook



504553&year_id=000115




Page 15 of 31

G52HCI – Human Computer Interaction (10 Credits) – Spring 2015-2016


P: None; C: None; A: Coursework 100%

2. Lecturer

Marina Ng (Dr)

Contact: 03-89253412 (Office); DB06 (Room)



This module is part of the Human-Computer Interaction theme in the School of

Computer Science.

The module provides an overview of the field of Human Computer Interaction,

which aims to understand people's interaction with technology and to apply this

knowledge in the design of usable interactive computer systems. The module will

introduce the concept of usability, examine different design approaches and

evaluation methods and illustrate the principles through an exploration of a number

of case studies.

4. Weekly Programme



2 Understanding Users - The Cognitive Perspective

3 Understanding users - Ethnography

4 Gathering requirements

5 Designing GUIs

6 Participatory design and prototyping

7 Mobile and ubiquitous computing

8 Communication and collaboration

9 Evaluating Interfaces

10 The Future of the Interface

11 Revision

5. Resources

No Name of

Author(s)

Year of

Publication


1 Helen

Sharp,

Yvonne

Rogers &

Jenny

Preece

2007 Interaction

Design: Beyond

Human

Computer

Interaction

2nd

Wiley 0-

4700-

1866-6

2 Ben

Schneiderm

an &

Catherine

Plaisan

2010 Designing the

User Interface:

Strategies for

Effective Human-

Computer

Interaction

5th

Addison-

Wesley

0-

3215-

3735-1



2987&year_id=000115




Page 16 of 31

G52IIP – Introduction to Image Processing (10 Credits) – Autumn 2015-2016


P: G51MCS, G51PRG; C: None; A: Coursework 40%, Written Examination 60%

2. Lecturer

Ho Sooi Hock (Mr)




This module includes the following topics:

overview of image processing and its applications, relations between image

processing and other related fields e.g. computer vision, computer graphics,

image analysis and digital photography

fundamentals of digital images, elements of visual perception and human visual

system, digital image formation and acquisition, colour models and processing

point processing, spatial filtering, image transforms and frequency domain

processing, edge detection, image segmentation, image coding and compression

4. Weekly Programme



2 Digital image fundamentals

3 Point and histogram processing

4 Spatial domain image filtering

5 Image sharpening, edge detection and Hough transform

6 Frequency domain & Fourier transform

7 Image filtering in the frequency domain

8 Image segmentation & representation

9 Object representation

10 Image coding and image compression

11 Revision and discussion of past exam papers

5. Resources

No Name of

Author(s)

Year of

Publication


1 Gonzalez &

Woods

2008 Digital Image

Processing

3rd

Prentice

Hall

0-13-

168728-X

2 Efford 2000 Digital Image

Processing

Using Java

1st

Addison-

Wesley

0-20-

159623-7



d=021218&year_id=000115




Page 17 of 31

G53CWO – Computers in the World (10 Credits) – Autumn 2015-2016



2. Lecturer

Tomas Maul (Dr) [Co-ordinator for Group Teaching]

Contact No: 03-89248232 (Office Phone); BB64 (Room)



The module examines the scope of applications of computers and computing in the

world at large from scientific supercomputers, through PCs, tablets, embedded

computers, etc. The module covers various topics such as: dependability of

computer-based systems and associated risks; legal liability, data protection and

intellectual property issues; social and cultural impacts of computing; the portrayal

of computers and computing in the popular media and in fiction; ethical issues in

computing; and professional issues including the role of professional bodies.

4. Weekly Programme


1 Ubiquity of Computers, New Developments & Rapid Changes

2 Software Safety

3 Computer Crime

4 Privacy

5 Freedom of Speech

6 Intellectual Property Issues

7 Computers in the Workplace

8 Evaluating & Controlling Technologies

9 Professionalism & Ethical Issues

10 Wrap Up & Discussion

11 Revision

5. Resources

No Name of

Author(s)

Year of

Publication

Title of

Book


1

Sarah Baase 2008 A gift of fire 3rd Prentice Hall 0-13-

600848-4

2 K. Bowyer 2001 Ethics &

Computing

1st Wiley-IEEE

Press

0-7803-

6019-2


http://modulecatalogue.nottingham.ac.uk/malaysia/asp/moduledetails.asp?crs_id=50

3881&year_id=000115






Page 18 of 31

G53SQM – Software Quality Management (10 Credits) – Autumn 2015-2016


P: G52SEM; C: None; A: Coursework 40%, Written Examination 60%

2. Lecturer

Tim Brailsford (Dr)




Through a two hour lecture each week, you’ll be introduced to concepts and

techniques for software testing and will be given an insight into the use of artificial

and computational intelligence for automated software testing. You’ll also review

recent industry trends on software quality assurance and testing.

4. Weekly Programme


1 Introduction to SQA/Software Quality Factors

2 Components of SQA Systems

3 Pre-project Software Quality/Integrating quality Activities

4 Agile Development I

5 Agile Development II

6 Configuration Management I

7 Configuration Management II

8 Software Reviews

9 Software Testing Strategies/Implementation

10 Software Metrics

11 Revision

5. Resources

No Name of

Author(s)

Year of

Publication


1 Malik

Kamna

2006 Software Quality: a

practitioner’s

approach

1st

McGraw

Hill

0-070-

24873-

7

2 Tian Jeff

2005 Software Quality

Engineering: testing,

quality assurance

and quantifiable

improvement

1st

Wiley 0-013-

06428-

2



503592&year_id=000115




Page 19 of 31

G53ARS – Autonomous Robotic Systems (20 Credits) – Autumn 2015-2016


P: G51PRG; C: None;

A: Coursework 50%, Written Examination 50%

2. Lecturer

Tomas Maul (Dr)




This module introduces you to the computer science of robotics, giving you an

understanding of the hardware and software principles appropriate for control and

localization of autonomous mobile robots. A significant part of the module is

laboratory-based, utilizing physical robotic hardware to reinforce the theoretical

principles covered. Spending around three to four hours each week in lectures and

practicals, you’ll cover a range of topics including basic behavioural control

architectures, programming of multiple behaviours, capabilities and limitations of

sensors and actuators, and filtering techniques for robot localization.

4. Lecture Programme (provisional)

Note that the following set of lectures is subject to revision. Please refer to the

module’s Moodle page for the definitive programme.

Lecture No Lecture Topic

1 Introduction and Autonomous Robot = ?

2 Foundations of Robotic Systems; Architectures & Behaviours

3 Subsumption Architecture

4 Robot Hardware - Sensors and Actuators

5 PID Control

6 Fuzzy Logic Control

7 Localisation & Mapping

8 Machine learning approaches to autonomous robots 1

9 Machine learning approaches to autonomous robots 2

10 Revision

5. Resources (suggested reading)

No Name of

Author(s)

Year of

Publication

Title of Book


1 Siegwart et

al


autonomous

mobile robots

2nd MIT Press 0262015358

2 Saeed B.

Niku

2001 An introduction

to robotics

analysis,

systems,

applications

1st Prentice

Hall

0130613096

3 Maja J.

Mataric

2007 The robotics

primer

1st MIT Press 026263354X



4365&year_id=000115




Page 20 of 31

G53CMP – Compilers (10 Credits) – Autumn 2015-2016

1. Pre-requisites (P) & Co-requisites (C);Assessment Details (A)

P: G51FUN, G52MAL; C: None; A: Coursework 25%, Written Examination 75%

2. Lecturer

Tomas Maul (Dr)




You’ll examine aspects of language and compiler design by looking at the

techniques and tools that are used to construct compilers for high level

programming languages. Topics covered include: parsing; types and type systems;

run-time organization; memory management; code generation; and optimization.

You’ll spend around four hours each week in lectures and computer classes for this

module.

4. Weekly Programme


1 Administrative Details and Introduction

2 Overview & Lexical Analysis

3 Syntax Analysis 1

4 Syntax Analysis 2

5 Semantic Analysis

6 Intermediate Code Generation 1

7 Intermediate Code Generation 2

8 Run-Time Organization

9 Code Generation

10 Code Optimization

11 Revision

5. Resources

No Name of

Author(s)

Year of

Publication

Title of Book Edition Publisher’s

Name

ISBN

1 Aho, Lam,

Sethi and

Ullman

2003 Compilers:

Principles,

Techniques &

Tools

2nd Prentice Hall 0-201-

10194-7


http://modulecatalogue.nottingham.ac.uk/malaysia/asp/moduledetails.asp?crs_id=

503591&year_id=000115





Page 21 of 31

G51PGP – Programming Paradigms (20 Credits) – Spring 2015-2016


P: G51MCS, G51PRG (2014-15); C: None; A: Coursework 25%, Written Examination

75%

2. Lecturer

Michael Chung (Mr)




In this module you'll learn the basic principles of the object-oriented and functional

approaches to programming, using the languages Java and Haskell. You'll also see

how they can be used in practice to write different kinds of programs.

4. Weekly Programme


1 Introduction: Course content, assessment

2 From C to Java

3 Methods, classes and objects

4 Inheritance, Polymorphism, Interfaces and abstract classes

5 Strings, exception and files

6 Haskell Platform and Type Information: Standard prelude, function

application, Haskell scripts, layout rule, Type errors, basic types, list types,

tuple types, function types – curried, polymorphic, overloaded, basic classes

7 Defining functions, list comprehension: Conditional expressions, guarded

equations, pattern matching, lambda expressions, sections, dependent

generators, guards

8 Recursive functions, higher-order functions: Recursion on lists, multiple

arguments, map, filter, foldr

9 Interactive programs: Primitive actions, sequencing actions

10 Defining types: Type declarations, data declarations

5. Resources

No Name of

Author(s)

Year of

Publication


1 Graham

Hutton

2007 Programming in

Haskell

1st CUP 0-521-

69269-5

2 Judith Bishop 2001 Java Gently 3rd Pearson 978-0201710502



504549&year_id=000115




Page 22 of 31

G51DBI – Databases and Interfaces (20 Credits) – Spring 2015-2016


P: G51MCS; C: None; A: Coursework 40%, Written Examination 60%

2. Lecturer

Iman Yi Liao (Dr)




This module is part of the Software Engineering theme in the School Computer

Science. It introduces database management systems, the design and use of

database systems. The relational database model and the structured database

query language (SQL) are covered. Throughout the module students are given

instruction in the use of a relational database management system. Topics covered

include: the relational model; entity-relationship modelling, normalisation, and

database security.

4. Weekly Programme

Week No Topics

1 Introduction to Database Systems, The Relational Model

2 Database Models & Relational Database

3 Relational Algebra & Entity Relationship Modelling

4 Normalisation

5 SQL Data Definition

6 More SQL – Data Definition Language (I)

7 More SQL – Data Definition Language (II)

8 Data Administration and Security

9 Database Integrity and Security

10 Object-relational & Object-oriented Databases, XML and databases

11 Good and Bad ‘Modern’ Databases

12 Revision

5. Resources

No Name of

Author(s)

Year of

Publication


1 Thomas

Connolly and

Carolyn

Begg,

2005 Database Systems -

A Practical Approach

to Design,

Implementation, and

Management

3rd or

4th

Addison-

Wesley

0-

3212-

1025-

5

2 Elmasri

and SB

Navathe

2004 Fundamentals of

Database Systems

3rd or

4th

Addison-

Wesley

0-

3212-

0448-

4



4551&year_id=000115




Page 23 of 31

G51FSE – Introduction to Software Engineering (10 Credits) – Spring 2015-2016


P: Knowledge of C as in G51PRG; C: None; A: Coursework 75%; Exam 25%

2. Lecturer

Tim Brailsford (Dr)




You will be introduced to the concept of software engineering and object oriented

programming (OOP) and will be taken through the software development process:

deciding exactly what should be built (Requirements & Specification), designing how

it should be built (Object Oriented Software Architecture), maintaining it (Software

Evolution and Maintenance). Lectures will focus on the software development

process, OOP and Object Oriented Design, while practical sessions will focus on OOP

which will be taught using Java.

4. Weekly Programme


1 Introduction to Software Engineering (OOSE) – Part 1

2 Modeling with UML

3 Requirement Elicitation

4 Object-orientation Analysis

5 Object-oriented System Design

6 Object-oriented Design (OOD) – Part 1

7 Object-oriented Design (OOD) – Part 2

8 Mapping Object Model to Code

9 Object Oriented Testing

10 Managing Software Project – Part 1 (Configuration Management)

11 Managing Software Project – Part 2 (Project Management)

Integration & Revision and review past examination questions

5. Resources

No Name of

Author(s)

Year of

Publication

Title of

Book


1 Ian

Sommerville

2006 Software

Engineering

8th

Addison

Wesley

0-3213-1379-9

2 Bernd

Bruegge

2013 Object

Oriented

Software

Engineering

using UML,

Patterns,

and Java

3rd

Pearson

Education

1292024011,

9781292024011



503378&year_id=000115




Page 24 of 31

G51FAI – Fundamentals of Artificial Intelligence (10 Credits) – Spring 2015-2016



2. Lecturer

Ho Sooi Hock (Mr)




This module aims to:

give a broad overview of the fundamental theories and techniques of AI

a peek into the history of AI and the key milestones, e.g. Turing Test and the

Chinese Room, MYCIN etc.

provide the student with the necessary knowledge to allow them to implement

common AI search techniques

introduce game playing and describe some of the techniques that are applicable

in this area (e.g. mini-max, alpha-beta pruning)

review the principles of neural networks in general and perceptron learning.

4. Weekly Programme



2 Reasons for AI; History of AI; Philosophy of AI

3 Problem formulation

4 Uninformed search – BFS, DFS, UCS, DLS, IDS

5 Heuristic search techniques – BFS, GFS and A*

6 Tutorials on search techniques; Discussion on courseworks

7 Game playing techniques

8 Introduction to neural networks

9 Constraint satisfaction problems

10 Knowledge representations

11 Revision

5. Resources

No Name of

Author(s)

Year of

Publication

Title of Book


1 S. J. Russell &

Peter Norvig

2010 AI :A Modern

Approach

3rd

Prentice Hall 0-13-

604259

-7

2 George F Luger 2008 AI:Structures

and strategies

for Complex

Problem Solving

6th

Addison

Wesley

0-321-

54589-

3



d=026195&year_id=000115




Page 25 of 31

G52CCN – Comp Communications and Networks (10 Credits) – Spring 2015-2016


P: None; C: None; A: Written Examination 100%

2. Lecturer

Ho Sooi Hock (Mr)




This module gives an overview of technologies including data transmission

techniques, Local Area Networks, Wide Area Networks, network security, and

network applications. Particular attention will be paid to the internet environment

and TCP/IP protocols. You’ll spend around two hours each week in lectures for this

module.

4. Weekly Programme`

Week No Topics

1 - 3 Part 1: Data Transmission

1. Introduction, Transmission media

2. Local asynchronous communication and RS-232

3. Long distance communication (carriers and modems)

4 - 6 Part 2: Packet Transmission

5. Packets, frames and error detection

6. Local Area Networks

7. Hardware addressing and frame types

8. LAN wiring and physical topology

9. Extending LANs

10.WAN technologies and routing

11. Ownership, service and performance

7 - 8 Part 3: Internetworking

12. Protocols and layering

13. Internetworking - concepts

14. IP addressing

15. IP datagrams

16. Future IP

17. Transport Control Protocol (TCP)

9 - 10 Part 4 : Introduction to Computer and Network Security

11 - 12 Part 5: Applications

18. Client-Server Interaction

19. The Socket API

20. Example applications

21. Revision

5. Resources

No Name of

Author(s)

Year of

Publication


1 Douglas E.

Comer

2015 Computer

Networks and

Internets

6th Prentice

Hall

0-1335-

87932


http://modulecatalogue.nottingham.ac.uk/Nottingham/asp/moduledetails.asp?crs_id=

002252&year_id=000115





Page 26 of 31

G52MAL – Machines and their Languages (10 Credits) – Spring 2015-2016


P: G51FUN, G51MCS, G51PRG; C: None;


2. Lecturer

Tomas Maul (Dr)




You’ll investigate classes of formal language and the practical uses of this theory,

applying this to a series of abstract machines. You’ll focus in particular on language

recognition, but will study a range of topics including: finite state machines; regular

expressions; context-free grammars; and Turing machines. You’ll spend around two

hours per week in lectures studying for this module.

4. Weekly Programme



2 Alphabets, words and languages.

3 Automata Theory; Deterministic and Non-deterministic Finite

Automata (DFAs and NFAs).

4 NFA & DFA equivalence and other matters.

5 Regular Expressions.

6 DFA Minimization and Proving Languages to be Not Regular.

7 Pushdown Automata (PDA).

8 Context-free Grammars (CFG).

9 PDAs, CFGs and Derivation trees.

10 Disambiguation and Parsing.

11 Context-sensitive grammars, Turing machines and Decidability.

5. Resources

No Name of

Author(s)

Year of

Publication

Title of Book Edition Publisher’s

Name

ISBN

1 John Hop Croft,

Rajeev Motwani,

Jeffrey.D.Ullman


Automata

Theory,

Languages and

computation

3rd

Addison

Wesley

0-

3214-

7617-

4



2775&year_id=000115




Page 27 of 31

G52CPP – C++ Programming (10 Credits) – Spring 2015-2016


P: Knowledge of C (e.g. from G51PRG Introduction to Programming up to 2014-15)

and of object oriented Java programming (e.g. from G51ISO 2014-15); C: None; A:

Exam 60%, CW 40%

2. Lecturer

Abdur Rakib (Dr)




We will cover the programming material and concepts necessary to obtain an

understanding of the C++ programming language. We will spend around four hours

per week in lectures and computer classes for this module and will be expected to

take additional time to practice and to produce your coursework.

4. Weekly Programme


1 Introduction

2&3 Pointers, Functions, The stack, Local, global and static variables,

Variable shadowing

4 Structs and unions, Dynamic memory allocation, Linked lists

5 The C pre-processor, Linkage and visibility, Class-preliminary

6&7 The this pointer, new and delete, Inheritance, Virtual functions

8&9 Function pointers, Overridden function, Virtual, non-virtual , and Pure

virtual functions, various forms of constructors

10&11 File organization, C++ Templates, C++ Exceptions, STL, Vectors, Lists,

Algorithms, and dynamic memory

12 Revision Coursework due

5. Resources

No Name of

Author(s)

Year of

Publication


1

Herbert

Schildt

2003 C++: the

complete

reference

4th

McGraw-

Hill

0072226803

2

Bjarne

Stroustrup

2013

The C++

programming

language

4th

Addison-

Wesley

9780321563842

3 Scott

Meyers

2003 Effective C++:

50 specific

ways to

improve your

programs and

designs

2nd Addison-

Wesley

0201924889



503590&year_id=000115




Page 28 of 31

G52OSC – Operating Systems and Concurrency (20 Credits) – Spring 2015-2016


P: Knowledge of programming/OOP, C: None; A: CW 25% & Final Exam 75%

2. Lecturer

KR Selvaraj (Mr)



3. Summary of Content:

This course covers the fundamental principles that underpin operating systems and

concurrency. Topics in operating systems that are covered include the architecture

of operating systems, process and memory management, storage, I/O, and

virtualisation. The principles of concurrency will be introduced from both the

perspective of an operating system and user applications. Specific topics on

concurrency include: hardware support for concurrency; mutual exclusion and

condition synchronisation; monitors; safety and liveness properties of concurrent algorithms, and the use of threads and synchronisation.

4. Weekly Programme

Week No Lecture Topics

1 Introduction and background, Memory Management Part I

2 Memory Management Part II

3 Processes Scheduling Part I

4 Processes Scheduling Part II

5 File Systems Part I

6 Input/output processes Part I

7 Concurrency & OS, Concurrent Programming

8 Hardware support for concurrency

9 Mutual Exclusion Problems, Semaphores, Monitors

10 Properties of Concurrent Algorithms

11 Multi-processor Implementations

12 Revision

5. Resources

No Name of

Author(s)

Year of

Publication

Title of Book Edit

ion

Publish

er’s

Name

ISBN

1 Andrew S.

Tanenbaum

2009 Modern Operating

Systems

3rd Pearson

Prentice

Hall

2 M.Ben-Ari

2006 Principles of Concurrent

Programming

2nd Addison

-Wesley



d=025400&year_id=000115




Page 29 of 31

G53SEC – Computer Security (10 Credits) – Spring 2015-2016


P: G52CCN or equivalent knowledge of computer networks; C: None;


2. Lecturer

Michael Chung (Mr)




The module covers the following topics: access control, reference monitors, security

models, cryptography, cryptanalysis, network security and software security.

4. Weekly Programme


1 Introduction & Overview

2 Foundations of Computer Security

3 Access Control

4 Reference Monitors

5 Security Models

6 Other Security Models

7 Cryptography 1

8 Cryptography 2

9 Network Security

10 Software Security

11 Student Presentations & Discussions

5. Resources

No Name of

Author(s)

Year of

Publication


1 Dieter

Gollmann

2006 Computer

Security

2nd John Wiley 0-

4708-

6293-

9

2 Ross

Anderson

2008 Security

Engineering

2nd

Prentice-Hall 0-

4700-

6852-

3



502773&year_id=000115




Page 30 of 31

G53NMD – New Media Design (10 Credits) – Spring 2015-2016


P: None; C: None; A: Coursework-1 25%, Coursework-2 75%

2. Lecturer

Timothy Brailsford (Dr)




This module aims to:

Provide a sound understanding of wide range of concepts, methods and

techniques of Operational Research and Artificial Intelligence that can help in

design of intelligent decision support systems. Present state-of-the-art of both advanced Operational Research and Artificial

Intelligence methods including multi-criteria decision making, decision making in

the presence of uncertainty, case-based reasoning, etc. Present a variety of examples from industrial and service sectors.

4. Weekly Programme


1 Introduction to Multimedia

2 Multimedia Authoring Systems; Interaction and Methaphor in Multimedia

Design

3 Graphics and Still Images Representation; Colour Science and Color

Models

4 Hypertext

5 Media Design: Text, Images, and Sound

6 Scalable Vector Graphics

7 Digital Audio

8 Architecture of Multimedia Systems

9 Synchronized Multimedia Integration Language

10 Digital Video

11 Intellectual Property Rights; Narrative

5. Resources

No Name of

Author(s)

Year of

Publication


1 Barfield, L 2004 Design for New

Media:

Interaction

design for

multimedia and

the web

1st

Pearson

Addison-

Wesley

978-

0201596090

2 Li, Z. &

Drew,M.

2004 Fundamentals of

Multimedia

-

Pearson

Prentice-

Hall

978-

0130618726



503387&year_id=000115





Page 31 of 31

G53MLE – Machine Learning (20 Credits) – Spring 2015-2016


P: G51PRG, G51MCS/MFC or equivalent; C: None; A: 2 hour written examination

70%, Group programming assignment 30%

2. Lecturer

Chen ZhiYuan (Dr)




Providing you with an introduction to machine learning, pattern recognition, and

data mining techniques, this module will enable you to consider both systems which

are able to develop their own rules from trial-and-error experience to solve

problems, as well as systems that find patterns in data without any supervision. In

the latter case, data mining techniques will make generation of new knowledge

possible, including very big data sets. This is now fashionably termed 'big data'

science. You'll cover a range of topics including: machine learning foundations;

pattern recognition foundations; artificial neural networks; deep learning;

applications of machine learning; data mining techniques and evaluating

hypotheses.

4. Weekly Programme


1 Machine Learning, Preliminaries

2 Preprocessing-discretisation, Missing Values

3 Feature and Prototype Selection, Dimensionality Reduction

4 Classification

5 Clustering

6 Regression and Association Rules

7 Anomaly Detection

8 Time-series Data Mining, Text Mining

9 Image Processing

10 Deep Learning

11 'Big Data' Learning

5. Resources

No Name of

Author(s)

Year of

Publication

Title of Book

(Primary)

Editi

on

Publisher’s

Name

ISBN

1 Tom M.

Mitchell

1997 Machine Learning McGraw-Hill 0070428

077

2 Chris Bishop 2006 Pattern Recognition

and Machine

Learning

Springer 0387310

738



4368&year_id=000115




Documents

School of Computer Science - Nottingham€¦ · Computer Communications and Networks G52CCN 2 Machines and their Languages G52MAL 2 C++ Programm ing G52CPP 2 Operating Systems and