CS Module Handbook 2015 Final PDF

School of Computer Science
UNDERGRADUATE MODULES FOR 2015-2016

Full Year
Module
Software Engineering Group Project
Individual Dissertation Single/Joint Honours
Planning, Search and Artificial Intelligence
Programming
Module Code
G52GRP
G53IDS/J
G52PSA
Level
2
3
2
Autumn Semester Computer Science Modules

Module
Computer Fundamentals
Mathematics for Computer Scientists
Programming and Algorithms
Systems and Architecture
Software Engineering Methodologies
Algorithms and Data Structures
Introduction to Formal Reasoning
Software Application Development
Human Computer Interaction
Introduction to Image Processing
Computers in the World
Module Code
G51CSF
G51MCS
G51PGA
G51SYS
G52SEM
G52ADS
G52IFR
G52SAD
G52HCI
G52IIP
G53CWO
Level
1
1
1
1
2
2
2
2
2
2
3
Software Quality Management
G53SQM
Autonomous Robotic Systems
G53ARS
Compilers
G53CMP
Autumn Semester Compulsory Business Modules for Joint Honours

Module
Entrepreneurship and Business
Business Economics
Work and Society
Contemporary Economic Policy
Designing and Managing Organisations
Strategic Management I
Human Resource Management I
Module Code
N11440
N11607
N11612
N12107
N12617
N13410
N13425
Level
1
1
1
2*
2
3
3
*Note : N12107 is offered as N11107, level 1 module in Malaysia Campus
Page 1 of 31
Spring Semester Computer Science Modules

Module
Programming Paradigms
Databases and Interfaces
Introduction to Software Engineering
Fundamentals of Artificial Intelligence
Computer Communications and Networks
Machines and their Languages
C++ Programming
Operating Systems and Concurrency
Computer Security
New Media Design
Machine Learning
Module Code
G51PGP
G51DBI
G51FSE
G51FAI
G52CCN
G52MAL
G52CPP
G52OSC
G53SEC
G53NMD
G53MLE
Level
1
1
1
1
2
2
2
2
3
3
3
Spring Semester Compulsory Business Modules for Joint Honours

Module
Consumers and Markets
Organisational Behaviour
New Venture Creation
Economics of Business Decisions
Organising and Managing in Practice
Strategic Management II
Human Resource Management II
Module Code
N11401
N11613
N11601
N12604
N12606
N13418
N13426
Level
1
1
1
2
2
3
3
Page 2 of 31
Notes:
1. Modules offered in any semester are subjected to change as they depend on staff
availability and sufficient number of students 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 Nottinghams 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
Page 3 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:
Tomas.Maul@nottingham.edu.my
3.
Summary of Content
Working in groups of around five to six people, youll 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; youll also have several
introductory one hour lectures.
4.
Lecture Programme
Lecture
No
1
2
3
4
5
6
7
8
Lecture Topic
Overview: Aims, Organization, Assessment
Team Working and Group meetings
Version Control
Characteristics of a good project
Course Information Review
Code Quality, Maintainability, Reusability, Debugging and Testing
Report Writing
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
Page 4 of 31

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

P: None; C: None; A: Dissertation 80%, Practical (Demo) 10%, Progress Presentation
(Autumn) 10%
2.
Lecturer
KR Selvaraj (Mr)
E-mail:
kr.selvaraj@nottingham.edu.my
3.
Summary of Content
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, youll 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
1
2
3
4
5
6
7
8
5.
Lecture Topic
Project Briefing
Information Skills
Literature Review
Plagiarism
Public Presentation Skills
Dissertation Report Preparation
TBA
TBA
Resources
No
1
Name of
Author(s)
Dawson,
Christian W
Year of
Publication
2000
Title of Book
The essence of
computing projects:
a student's guide
Edition
Publisher
Prentice Hall
Reference texts recommended by the supervisors as relevant to the project topics.

6.
Learning Outcomes
http://modulecatalogue.nottingham.ac.uk/Malaysia/asp/moduledetails.asp?crs_id=
501902&year_id=000115
Page 5 of 31
ISBN

G52PSA Planning, Search and Artificial Intelligence Programming (20
Credits) Full Year 2015-2016
1.

P: G51IAI; C: None; A: Coursework 25%, Written Examination 75%
2.
Lecturer
Chew Sze-Ker (Mr)
Contact: 03.89248140 (Office), BB59 (Room)
E-mail:
chew.sze-ker@nottingham.edu.my
3.
Summary of Content
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
Week No
Lecture Topic
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)
1
Stuart J.
Russell &
Peter
Norvig
6.
Year of
Publication
2010
Title of Book
Edition
Publisher
ISBN
Artificial Intelligence
:A Modern Approach
3rd
Prentice
Hall
0-136042597
Learning Outcomes
504364&year_id=000115
Page 6 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)
E-mail:
siang-yew.chong@nottingham.edu.my
3.
Summary of Content
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
Week No
1
2
3
4
5
6
7
8
9
10
11
5.
Resources
No
1
6.
Lecture Topic
Introduction, overview and module contents
Boolean Logic and Arithmetic
Sequential Logic and Machine Language
Computer Architecture and Assembler
Virtual Machine
High-level Language; Coursework 1
Compiler
Operating System
Basic networking and I/O
Coursework 2
Revision
Name of
Author(s)
N. Nisan &
S. Schocken
Year of
Publication
2005
Title of Book
(Primary)
The Elements of
Computing Systems:
Building a Modern
Computer from First
Principles
Edition
Publisher
ISBN
The MIT
Press
0-262640686
Learning Outcomes
http://modulecatalogue.nottingham.ac.uk/nottingham/asp/ModuleDetails.asp?crs_i
d=026182&year_id=000115
Page 7 of 31

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

P: None; C: None; A: Coursework 25%; Written Examination 75%
2.
Lecturer
Iman Yi Liao (Dr)
Contact: 03-87253438 (Office), BB63 (Room)
E-mail:
Iman.Liao@nottingham.edu.my
3.
Summary of Content
Youll 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. Youll spend around three hours per week
in lectures and tutorials for this module
4.
Weekly Programme
Week No
1
2
3
4
5
6
7
8
9
10
11
12
5.
Resources
No
1
6.
Lecture Topic
Introduction
Boolean algebra
Sets
Functions
Numbers theories
Matrices
Induction
Counting techniques (1)
Counting techniques (2)
Relations (1)
Relations (2)
Revision
Name of
Author(s)
Kenneth H.
Rosen
Year of
Publication
2007
Title of Book
(Primary)
Discrete Mathematics
and Its Applications
Edition
Publisher
ISBN
6th
McGraw-Hill
0-007124474
-3
Learning Outcomes
http://modulecatalogue.nottingham.ac.uk/Malaysia/asp/moduledetails.asp?crs_id=50
1884&year_id=000115
Page 8 of 31

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

P: None; C: G51CSA; A: Coursework 75%, Written Examination 25%
2.
Lecturer
Chew Sze-Ker (Mr)
Contact: 03.89248140 (Office Phone); BB59 (Room)
E-mail:
chew.sze-ker@nottingham.edu.my
3.
Summary of Content
Youll cover the basic concepts of programming including: problem solving;
debugging; elementary programming; functions and procedures; memory and
pointers; and data structures. Youll 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
Week No
1
2
3
4
5
6
7
8
9
10
5.
No
1
2.
6.
Lecture Topic
Introduction to C compiler/Getting started with GCC
Procedures, Parameters, Values and Variables
Operators and Precedence, Conditionals and Loops
Pointers and scanf()
Arrays and Strings, Linked List, Structures
Introduction to Algorithms, Big O Notation
String Processing
File Input/Output
Data Structures (Tree, heaps)
Data Structures (Sorting)
Resources
Name of
Author(s)
Kernighan,
Brian W.,
Dennis M.
Ritchie
Thomas H.
Cormen et al.
Year of
Publication
1988
Title of Book
Edition
Publisher
ISBN
The C
programming
language
2nd
Prentice
Hall
0-13110362-8
2009
Introduction to
Algorithms
3rd
MIT Press
0-26203384-4
Learning Outcomes
504547&year_id=000115
Page 9 of 31

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

P: None; C: G51CSF; A: Coursework 1 (50%), Exam 1: Written exam (25%), Exam
2: Online exam (25%).
2.
Lecturer
KR Selvaraj (Mr)
E-mail:
3.
Summary of Content
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
Week No
1
2
3
4
5
6
7
8
9
10
11
12
5.
Resources
No
1
6.
Lecture Topic
Routing and Forwarding in a network
Local Area Networks
Resource Allocation
Overview of Operating Systems and Operating System Principles
Digital logic and digital systems
Machine level representation of data
Assembly level machine organization
Memory system organization and architecture
Computational Paradigms, Cross-Layer, Communications,
Interfacing and Communication, State and State Machines
Parallel Decomposition, Communication and Coordination,
Parallel Architecture
Analog and Digital representation of data, image and image
compression techniques.
Revision
Name of
Author(s)
Hohl,
William
Year
Title of Book
2009
ARM Assembly
Language:
Fundamentals and
techniques
Ed
Publishers
Name
CRC
ISBN
Learning Outcomes
http://modulecatalogue.nottingham.ac.uk/Nottingham/asp/moduledetails.asp?crs_i
d=026181&year_id=000115
Page 10 of 31

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

P: G51ISO; C: None; A: Coursework 40%, Written Examination 60%
2.
Lecturer
Behrang Parhizkar (Hani) (Mr)
Contact: 017 330 1824 (Mobile), BB47 (Room)
E-mail:
Hani.Parhizkar@nottingham.edu.my
3.
Summary of Content
Building on the material presented in the Foundations of Software Engineering
module, youll cover three main aspects of the software development process in
depth: the system analysis and design process, the project management process
and software documentation. Youll spend around two hours per week in lectures for
this module.
4.
Weekly Programme
Week No
1
2&3
4&5
6&7
8&9
10 & 11
12
Lecture Topic
Introduction
UML software modeling
Agile and XP software development Coursework one due
Estimating , Scheduling, and project activity planning
Building a domain model, and software testing/verification
Software design/interface, web design, and teamwork
Revision
Coursework two due
5.
Resources
No
Name of
Author(s)
Fowler,
Martin
Year of
Publication
2000
Project
Manageme
nt
Institute
2008
6.
Title of Book
Edition
Publisher
ISBN
UML distilled :
a brief guide to
the standard
object
modeling
language
2nd
AddisonWesley
9780201657838
A Guide to the
Project
Management
Body of
Knowledge
4th
Project
Management
Institute
9781933890517
Learning Outcomes
3380&year_id=000115
Page 11 of 31

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

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)
E-mail:
Abdur.Rakib@nottingham.edu.my
3.
Summary of Content
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). Youll spend
around four hours per week studying for this module in lectures and computer labs.
4.
Weekly Programme
Week No
1
2
3&4
5
6&7
8&9
10
11
Lecture Topic
Introduction
Recursion and algorithm analysis
Abstract data types
Sorting algorithms
Graph Algorithms
Advanced data structures
Real-world application
Revision
5.
Resources
No
Name of
Author(s)
Mark Allen
Weiss
Year of
Publication
2012
Robert
Sedgewick
2003
6.
Coursework 1 due
Coursework 2 due
Title of Book
Edition
Publisher
ISBN
Data Structures
and Algorithm
Analysis in Java
3rd
Pearson
978-0-27375211-0
Algorithms in
Java Part 14/Part 5
3rd
Addison
Wesley
0201361205/
0201361213
Learning Outcomes
502770&year_id=000115
Page 12 of 31

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

P: G51FUN (2014-15); C: None; A: Coursework 1 25%, Coursework 2 25%, Written
Examination 50%
2.
Lecturer
Michael Chung (Mr)
E-mail:
michael.chung@nottingham.edu.my
3.
Summary of Content
Developing the themes of the year one module Mathematics for Computer Scientists
youll be introduced to a mathematically rigorous approach to program construction.
Youll 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. Youll spend around
five hours per week in lectures, tutorials and computer classes for this module.
4.
Weekly Programme
Week No
Lecture Topic
Introduction:
Course
content,
assessment, introduction to Coq
1
Coq Basics, Propositional Logic
2
More Coq, Classical Logic
3
Bool and Predicate Logic
4
General Predicate Logic
5
More Predicate Logic
6
Operations on sets
7
Peano Arithmetic
8
Some Algebra
9
Primitive recursion
10
The omega hotel, diagonalisation
11
Lists
12
5. Resources
No
Name of
Author(s)
1
Bertot, Yves
& Castran,
Pierre
6.
Year of
Publication
2004
Title of Book
Edition
Publisher
ISBN
Interactive Theorem
Proving and
Program
Development:
Coq'Art: The
Calculus of
Inductive
Constructions
1st
Springer
3540208542
Learning Outcomes
3381&year_id=000115
Page 13 of 31

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

P: G51ISO or equivalent; C: None; A: Code submission 50%, Engineering report 50%
2.
Lecturer
Chen Zhiyuan (Dr)
E-mail:
Zhiyuan.Chen@nottingham.edu.my
3.
Summary of Content
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
Week No
1
2
3
4
5
6
7
8
9
10
11
Lecture Topic
Introduction to the module
OO Programming Refresher (1/2)
OO Programming Refresher (2/2)
OO for Engineering (+ Unit Testing)
UML (OO Analysis/Design) + Software Application Implementation Live
Demo
Open Session (depending on student feedback)
Working on Collaborative Projects (Open Source Software Development)
From OO Principles to Design Patterns + Reverse Engineering Code /
Refactoring Code
GUI Programming (1/2)
GUI Programming (2/2)
Open Sessions (only if needed)
5.
Resources
No
Name of
Author(s)
Parsons,
David
Barclay,
Kenneth
Fowler
6.
Year of
Publication
2012
2004
1999
Title of Book
Foundational Java
Key Elements
and
Practical
Programming
Object
Oriented
Design with UML
and Java
Refactoring
Improving
the
Design of Existing
Code
Edition
Publisher
ISBN
Springer
97814471
24788
(hcover)
Elsevier
eBook
Wesley
eBook
Learning Outcomes
504553&year_id=000115
Page 14 of 31

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

P: None; C: None; A: Coursework 100%
2.
Lecturer
Marina Ng (Dr)
Contact: 03-89253412 (Office); DB06 (Room)
E-mail:
marina.ng@nottingham.edu.my
3.
Summary of Content
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
Week No
1
2
3
4
5
6
7
8
9
10
11
5.
No
1
6.
Lecture Topic
Understanding Users - The Cognitive Perspective
Understanding users - Ethnography
Gathering requirements
Designing GUIs
Participatory design and prototyping
Mobile and ubiquitous computing
Communication and collaboration
Evaluating Interfaces
The Future of the Interface
Revision
Resources
Name of
Author(s)
Helen
Sharp,
Yvonne
Rogers &
Jenny
Preece
Ben
Schneiderm
an &
Catherine
Plaisan
Year of
Publication
2007
2010
Title of Book
Edition
Publisher
ISBN
Interaction
Design: Beyond
Human
Computer
Interaction
2nd
Wiley
047001866-6
Designing the
User Interface:
Strategies for
Effective HumanComputer
Interaction
5th
AddisonWesley
032153735-1
Learning Outcomes
2987&year_id=000115
Page 15 of 31

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

P: G51MCS, G51PRG; C: None; A: Coursework 40%, Written Examination 60%
2.
Lecturer
Ho Sooi Hock (Mr)
E-mail:
ho.sooi-hock@nottingham.edu.my
3.
Summary of Content
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
Week No
1
2
3
4
5
6
7
8
9
10
11
5.
No
1
6.
Lecture Topic
Digital image fundamentals
Point and histogram processing
Spatial domain image filtering
Image sharpening, edge detection and Hough transform
Frequency domain & Fourier transform
Image filtering in the frequency domain
Image segmentation & representation
Object representation
Image coding and image compression
Revision and discussion of past exam papers
Resources
Name of
Author(s)
Gonzalez &
Woods
Year of
Publication
2008
Title of Book
Edition
Publisher
ISBN
Digital Image
Processing
3rd
Prentice
Hall
0-13168728-X
Efford
2000
Digital Image
Processing
Using Java
1st
AddisonWesley
0-20159623-7
Learning Outcomes
d=021218&year_id=000115
Page 16 of 31

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

2.
Lecturer
Tomas Maul (Dr) [Co-ordinator for Group Teaching]
Contact No: 03-89248232 (Office Phone); BB64 (Room)
E-mail:
3.
Summary of Content
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
Week No
1
2
3
4
5
6
7
8
9
10
11
5.
No
Lecture Topic
Ubiquity of Computers, New Developments & Rapid Changes
Software Safety
Computer Crime
Privacy
Freedom of Speech
Intellectual Property Issues
Computers in the Workplace
Evaluating & Controlling Technologies
Professionalism & Ethical Issues
Wrap Up & Discussion
Revision
Resources
Name of
Author(s)
Year of
Publication
Title of
Book
Edition
Publisher
ISBN
0-13600848-4
0-78036019-2
Sarah Baase
2008
A gift of fire
3rd
Prentice Hall
K. Bowyer
2001
Ethics
&
Computing
1st
Wiley-IEEE
Press
6.
Learning Outcomes
http://modulecatalogue.nottingham.ac.uk/malaysia/asp/moduledetails.asp?crs_id=50
3881&year_id=000115
Page 17 of 31

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

P: G52SEM; C: None; A: Coursework 40%, Written Examination 60%
2.
Lecturer
Tim Brailsford (Dr)
E-mail:
Tim.Brailsford@nottingham.edu.my
3.
Summary of Content
Through a two hour lecture each week, youll 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. Youll also review
recent industry trends on software quality assurance and testing.
4.
Weekly Programme
Week No
1
2
3
4
5
6
7
8
9
10
11
Lecture Topic
Introduction to SQA/Software Quality Factors
Components of SQA Systems
Pre-project Software Quality/Integrating quality Activities
Agile Development I
Agile Development II
Configuration Management I
Configuration Management II
Software Reviews
Software Testing Strategies/Implementation
Software Metrics
Revision
5.
Resources
No
Name of
Author(s)
Malik
Kamna
Year of
Publication
2006
Tian Jeff
2005
1
2
6.
Title of Book
Edition
Publisher
ISBN
Software Quality: a
practitioners
approach
Software Quality
Engineering: testing,
quality assurance
and quantifiable
improvement
1st
McGraw
Hill
1st
Wiley
0-070248737
0-013064282
Learning Outcomes
503592&year_id=000115
Page 18 of 31

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

P: G51PRG; C: None;
A: Coursework 50%, Written Examination 50%
2.
Lecturer
Tomas Maul (Dr)
E-mail:
3.
Summary of Content
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, youll 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
modules Moodle page for the definitive programme.
Lecture No
1
2
3
4
5
6
7
8
9
10
Lecture Topic
Introduction and Autonomous Robot = ?
Foundations of Robotic Systems; Architectures & Behaviours
Subsumption Architecture
Robot Hardware - Sensors and Actuators
PID Control
Fuzzy Logic Control
Localisation & Mapping
Machine learning approaches to autonomous robots 1
Machine learning approaches to autonomous robots 2
Revision
5.
Resources (suggested reading)
No
Name of
Author(s)
Siegwart et
al
Year of
Publication
2011
Title of Book
Edition
Publisher
ISBN
Introduction to
autonomous
mobile robots
An introduction
to
robotics
analysis,
systems,
applications
The
robotics
primer
2nd
MIT Press
0262015358
1st
Prentice
Hall
0130613096
1st
MIT Press
026263354X
Saeed
Niku
B.
2001
Maja
Mataric
J.
2007
6.
Learning Outcomes
4365&year_id=000115
Page 19 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)
E-mail:
3.
Summary of Content
Youll 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.
Youll spend around four hours each week in lectures and computer classes for this
module.
4.
Weekly Programme
Week No
1
2
3
4
5
6
7
8
9
10
11
5.
No
1
6.
Lecture Topic
Administrative Details and Introduction
Overview & Lexical Analysis
Syntax Analysis 1
Syntax Analysis 2
Semantic Analysis
Intermediate Code Generation 1
Intermediate Code Generation 2
Run-Time Organization
Code Generation
Code Optimization
Revision
Resources
Name of
Author(s)
Aho, Lam,
Sethi and
Ullman
Year of
Publication
2003
Title of Book
Edition
Compilers:
Principles,
Techniques &
Tools
2nd
Publishers
Name
Prentice Hall
ISBN
0-20110194-7
Learning Outcomes
http://modulecatalogue.nottingham.ac.uk/malaysia/asp/moduledetails.asp?crs_id=
503591&year_id=000115
Page 20 of 31

G51PGP Programming Paradigms (20 Credits) Spring 2015-2016
1.

P: G51MCS, G51PRG (2014-15); C: None; A: Coursework 25%, Written Examination
75%
2.
Lecturer
Michael Chung (Mr)
E-mail:
3.
Summary of Content
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
Week No
1
2
3
4
5
6
7
8
9
10
5.
No
1
2
6.
Lecture Topic
Introduction: Course content, assessment
From C to Java
Methods, classes and objects
Inheritance, Polymorphism, Interfaces and abstract classes
Strings, exception and files
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
Defining functions, list comprehension: Conditional expressions, guarded
equations, pattern matching, lambda expressions, sections, dependent
generators, guards
Recursive functions, higher-order functions: Recursion on lists, multiple
arguments, map, filter, foldr
Interactive programs: Primitive actions, sequencing actions
Defining types: Type declarations, data declarations
Resources
Name of
Author(s)
Graham
Hutton
Judith Bishop
Year of
Publication
2007
2001
Title of Book
Edition
Publisher
ISBN
Programming in
Haskell
Java Gently
1st
CUP
3rd
Pearson
0-52169269-5
9780201710502
Learning Outcomes
504549&year_id=000115
Page 21 of 31

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

P: G51MCS; C: None; A: Coursework 40%, Written Examination 60%
2.
Lecturer
Iman Yi Liao (Dr)
E-mail:
Iman.Liao@nottingham.edu.my
3.
Summary of Content
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
1
2
3
4
5
6
7
8
9
10
11
12
Topics
Introduction to Database Systems, The Relational Model
Database Models & Relational Database
Relational Algebra & Entity Relationship Modelling
Normalisation
SQL Data Definition
More SQL Data Definition Language (I)
More SQL Data Definition Language (II)
Data Administration and Security
Database Integrity and Security
Object-relational & Object-oriented Databases, XML and databases
Good and Bad Modern Databases
Revision
5.
Resources
No
Name of
Author(s)
Thomas
Connolly and
Carolyn
Begg,
6.
Elmasri
and SB
Navathe
Year of
Publication
2005
2004
Title of Book
Edition
Publisher
ISBN
Database Systems A Practical Approach

to Design,
Implementation, and
Management
Fundamentals of
Database Systems
3rd or
4th
AddisonWesley
0321210255
3rd or
4th
AddisonWesley
0321204484
Learning Outcomes
4551&year_id=000115
Page 22 of 31

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

P: Knowledge of C as in G51PRG; C: None; A: Coursework 75%; Exam 25%
2.
Lecturer
Tim Brailsford (Dr)
E-mail:
Tim.Brailsford@nottingham.edu.my
3.
Summary of Content
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
Week No
1
2
3
4
5
6
7
8
9
10
11
Lecture Topic
Introduction to Software Engineering (OOSE) Part 1
Modeling with UML
Requirement Elicitation
Object-orientation Analysis
Object-oriented System Design
Object-oriented Design (OOD) Part 1
Object-oriented Design (OOD) Part 2
Mapping Object Model to Code
Object Oriented Testing
Managing Software Project Part 1 (Configuration Management)
Managing Software Project Part 2 (Project Management)
Integration & Revision and review past examination questions
5.
Resources
No
Name of
Author(s)
Ian
Sommerville
Year of
Publication
2006
Title of
Book
Software
Engineering
Edition
Publisher
ISBN
8th
Addison
Wesley
0-3213-1379-9
Bernd
Bruegge
2013
Object
Oriented
Software
Engineering
using UML,
Patterns,
and Java
3rd
Pearson
Education
1292024011,
9781292024011
6.
Learning Outcomes
503378&year_id=000115
Page 23 of 31

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

2.
Lecturer
Ho Sooi Hock (Mr)
E-mail:
ho.sooi-hock@nottingham.edu.my
3.
Summary of Content
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
Week No
1
2
3
4
5
6
7
8
9
10
11
5.
No
1
2
6.
Lecture Topic
Reasons for AI; History of AI; Philosophy of AI
Problem formulation
Uninformed search BFS, DFS, UCS, DLS, IDS
Heuristic search techniques BFS, GFS and A*
Tutorials on search techniques; Discussion on courseworks
Game playing techniques
Introduction to neural networks
Constraint satisfaction problems
Knowledge representations
Revision
Resources
Name of
Author(s)
S. J. Russell &
Peter Norvig
Year of
Publication
2010
Title of Book
Edition
Publisher
ISBN
AI :A Modern
Approach
3rd
Prentice Hall
George F Luger
2008
AI:Structures
and strategies
for Complex
Problem Solving
6th
Addison
Wesley
0-13604259
-7
0-321545893
Learning Outcomes
d=026195&year_id=000115
Page 24 of 31

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

P: None; C: None; A: Written Examination 100%
2.
Lecturer
Ho Sooi Hock (Mr)
E-mail:
Ho.sooi-hock@nottingham.edu.my
3.
Summary of Content
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. Youll 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)
1
Douglas E.
Comer
6.
Year of
Publication
2015
Title of Book
Edition
Publisher
ISBN
Computer
Networks and
Internets
6th
Prentice
Hall
0-133587932
Learning Outcomes
http://modulecatalogue.nottingham.ac.uk/Nottingham/asp/moduledetails.asp?crs_id=
002252&year_id=000115
Page 25 of 31

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

P: G51FUN, G51MCS, G51PRG; C: None;
2.
Lecturer
Tomas Maul (Dr)
E-mail:
3.
Summary of Content
Youll investigate classes of formal language and the practical uses of this theory,
applying this to a series of abstract machines. Youll 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. Youll spend around two
hours per week in lectures studying for this module.
4.
Weekly Programme
Week No
1
2
3
4
5
6
7
8
9
10
11
5.
No
1
6.
Lecture Topic
Alphabets, words and languages.
Automata Theory; Deterministic and Non-deterministic Finite
Automata (DFAs and NFAs).
NFA & DFA equivalence and other matters.
Regular Expressions.
DFA Minimization and Proving Languages to be Not Regular.
Pushdown Automata (PDA).
Context-free Grammars (CFG).
PDAs, CFGs and Derivation trees.
Disambiguation and Parsing.
Context-sensitive grammars, Turing machines and Decidability.
Resources
Name of
Author(s)
John Hop Croft,
Rajeev Motwani,
Jeffrey.D.Ullman
Year of
Publication
2007
Title of Book
Edition
Introduction to
Automata
Theory,
Languages and
computation
3rd
Publishers
Name
Addison
Wesley
ISBN
0321476174
Learning Outcomes
2775&year_id=000115
Page 26 of 31

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

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)
E-mail:
abdur.rakib@nottingham.edu.my
3.
Summary of Content
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
Week No
1
2&3
4
5
6&7
8&9
10&11
12
Lecture Topic
Introduction
Pointers, Functions, The stack, Local, global and static variables,
Variable shadowing
Structs and unions, Dynamic memory allocation, Linked lists
The C pre-processor, Linkage and visibility, Class-preliminary
The this pointer, new and delete, Inheritance, Virtual functions
Function pointers, Overridden function, Virtual, non-virtual , and Pure
virtual functions, various forms of constructors
File organization, C++ Templates, C++ Exceptions, STL, Vectors, Lists,
Algorithms, and dynamic memory
Revision
Coursework due
5.
Resources
No
Name of
Author(s)
Herbert
Schildt
Year of
Publication
2003
Bjarne
Stroustrup
2013
Scott
Meyers
2003
6.
Learning Outcomes
503590&year_id=000115
Title of Book
Edition
Publisher
ISBN
C++: the
complete
reference
The C++
programming
language
Effective C++:
50 specific
ways to
improve your
programs and
designs
4th
McGrawHill
0072226803
4th
AddisonWesley
9780321563842
2nd
AddisonWesley
0201924889
Page 27 of 31

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

P: Knowledge of programming/OOP, C: None; A: CW 25% & Final Exam 75%
2.
Lecturer
KR Selvaraj (Mr)
E-mail:
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
1
2
3
4
5
6
7
8
9
10
11
12
Lecture Topics
Introduction and background, Memory Management Part I
Memory Management Part II
Processes Scheduling Part I
Processes Scheduling Part II
File Systems Part I
Input/output processes Part I
Concurrency & OS, Concurrent Programming
Hardware support for concurrency
Mutual Exclusion Problems, Semaphores, Monitors
Properties of Concurrent Algorithms
Multi-processor Implementations
Revision
5. Resources
No
Name of
Author(s)
Year of
Publication
Title of Book
Edit
ion
Andrew S.
Tanenbaum
2009
Modern Operating
Systems
3rd
M.Ben-Ari
2006
Principles of Concurrent
Programming
2nd
6.
Publish
ers
Name
Pearson
Prentice
Hall
ISBN
Addison
-Wesley
Learning Outcomes
d=025400&year_id=000115
Page 28 of 31

G53SEC Computer Security (10 Credits) Spring 2015-2016
1.

P: G52CCN or equivalent knowledge of computer networks; C: None;
2.
Lecturer
Michael Chung (Mr)
E-mail:
3.
Summary of Content
The module covers the following topics: access control, reference monitors, security
models, cryptography, cryptanalysis, network security and software security.
4.
Weekly Programme
Week No
1
2
3
4
5
6
7
8
9
10
11
5.
No
1
6.
Lecture Topic
Introduction & Overview
Foundations of Computer Security
Access Control
Reference Monitors
Security Models
Other Security Models
Cryptography 1
Cryptography 2
Network Security
Software Security
Student Presentations & Discussions
Resources
Name of
Author(s)
Dieter
Gollmann
Year of
Publication
2006
Title of Book
Edition
Publisher
ISBN
Computer
Security
2nd
John Wiley
Ross
Anderson
2008
Security
Engineering
2nd
Prentice-Hall
0470862939
0470068523
Learning Outcomes
502773&year_id=000115
Page 29 of 31

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

P: None; C: None; A: Coursework-1 25%, Coursework-2 75%
2.
Lecturer
Timothy Brailsford (Dr)
E-mail:
tim.brailsford@nottingham.edu.my
3.
Summary of Content
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
Week No
1
2
3
4
5
6
7
8
9
10
11
Lecture Topic
Introduction to Multimedia
Multimedia Authoring Systems; Interaction and Methaphor in Multimedia
Design
Graphics and Still Images Representation; Colour Science and Color
Models
Hypertext
Media Design: Text, Images, and Sound
Scalable Vector Graphics
Digital Audio
Architecture of Multimedia Systems
Synchronized Multimedia Integration Language
Digital Video
Intellectual Property Rights; Narrative
5.
Resources
No
Name of
Author(s)
Barfield, L
Year of
Publication
2004
Li, Z. &
Drew,M.
2004
6.
Title of Book
Edition
Publisher
ISBN
Design for New

Media:
Interaction
design for
multimedia and
the web
Fundamentals of
Multimedia
1st
Pearson
AddisonWesley
9780201596090
Pearson
PrenticeHall
9780130618726
Learning Outcomes
503387&year_id=000115
Page 30 of 31

G53MLE Machine Learning (20 Credits) Spring 2015-2016
1.

P: G51PRG, G51MCS/MFC or equivalent; C: None; A: 2 hour written examination
70%, Group programming assignment 30%
2.
Lecturer
Chen ZhiYuan (Dr)
E-mail:
Zhiyuan.Chen@nottingham.edu.my
3.
Summary of Content
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
Week No
1
2
3
4
5
6
7
8
9
10
11
Lecture Topic
Machine Learning, Preliminaries
Preprocessing-discretisation, Missing Values
Feature and Prototype Selection, Dimensionality Reduction
Classification
Clustering
Regression and Association Rules
Anomaly Detection
Time-series Data Mining, Text Mining
Image Processing
Deep Learning
'Big Data' Learning
5.
Resources
No
Name of
Author(s)
Tom
M.
Mitchell
Chris Bishop
1
2
6.
Year of
Publication
1997
2006
Title of Book
(Primary)
Machine Learning
Pattern Recognition
and
Machine
Learning
Editi
on
Publishers
Name
McGraw-Hill
Springer
ISBN
0070428
077
0387310
738
Learning Outcomes
4368&year_id=000115
Page 31 of 31

CS Module Handbook 2015 Final PDF

Hochgeladen von

Dokumentinformationen

Originalbeschreibung:

Originaltitel

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

CS Module Handbook 2015 Final PDF

Hochgeladen von

Copyright:

Verfügbare Formate

School of Computer Science

UNDERGRADUATE MODULES FOR 2015-2016

Autumn Semester Computer Science Modules

Software Quality Management

Autonomous Robotic Systems

Autumn Semester Compulsory Business Modules for Joint Honours

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

Spring Semester Computer Science Modules

Spring Semester Compulsory Business Modules for Joint Honours

School of Computer Science

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

School of Computer Science

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

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

School of Computer Science

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

School of Computer Science

Pre-requisites & Co-requisites; Assessment Details

School of Computer Science

Pre-requisites & Co-requisites; Assessment Details

School of Computer Science

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

School of Computer Science

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

School of Computer Science

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

School of Computer Science

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

School of Computer Science

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

School of Computer Science

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

School of Computer Science

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

School of Computer Science

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

School of Computer Science

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

School of Computer Science

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

School of Computer Science

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

Lecture Programme (provisional)

Resources (suggested reading)

School of Computer Science

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

School of Computer Science

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

School of Computer Science

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

Database Systems A Practical Approach

School of Computer Science

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

School of Computer Science

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

School of Computer Science

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

School of Computer Science

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

School of Computer Science

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

School of Computer Science