COMPUTING SCIENCE

Credit Points

20

Course Coordinator

Dr A D Preece

Pre-requisites

None

Notes

Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.

Overview

The Internet as an “information space” – how information available on the World-Wide Web and connected information sources has an impact on every aspect of our lives: work, education, shopping, entertainment, travel, etc. Case studies of successful Web sites. How to design effective information-rich Web sites. How to convert existing data for access via the Web, statically and on-demand. Providing dynamic content on the Web, including use of scripting and multimedia. Introduction to search engines, Web robots, and new Web technologies.

Structure

12 week course - 3 one-hour lectures, 1 one-hour tutorial and 2 one-hour practicals per week.

Assessment

1st Attempt: 1 one and a half-hour written examination (50%) and continuous assessment (50%). In order to pass the course, candidates must obtain a pass mark in the overall combination of examination and continuous assessment (with the above weights).
Resit: Held during August diet. One and a half-hour written examination (50%) plus one and a half-hour practical examination (50%).

Credit Points

20

Course Coordinator

To be advised.

Pre-requisites

None

Co-requisites

None

Notes

(i) Students should not take this course if they are currently registered for, or have already obtained Credit points in any of the following: CS 1008, CS 1301, CS 1508, CS 1801, CS 1003, CS 1005, CS 1502, CS 1503, TS 1001, LS 1510, LS 1511, LS1513.
(ii) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.
(iii) Advisers of Studies should note that CS 1011 and CS 1511 are identical courses.

Overview

The course follows the syllabus of the European Computer Driving License (ECDL). The subject matter is grouped into 7 modules:
(1) Basic Concepts of Information Technology; (2) Using the Computer and Managing Files; (3) Word Processing; (4) Spreadsheets; (5) Databases; (6) Presentations; (7) Information and Communication.

Structure

12 week course - 2 one-hour lectures; 3 one-hour practicals per week.

Assessment

1st Attempt: One 1.5 hour multiple-choice examination (25%) and continuous assessment (75%). Resit: Candidates only resit those components which they failed (CAS<9) at first attempt. Multiple-choice examination (25%) at resit is one and a half-hours; practical assessments are 45 minutes each.

Credit Points

20

Course Coordinator

Professor J R W Hunter

Pre-requisites

Familiarity with the Windows environment (i.e. Higher of A-level Computing or Information Systems, CS 1011, CS 1009, or equivalent experience).

Notes

Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.

Overview

This course is intended as a basic introduction to computer programming and is designed for students with or without previous programming experience. The programming language taught will be Java. Nature of computer languages and programs; Edit/Compile/Run; principles of object-critical programming; Classes and Objects (predefined): variables, methods, event handlers; Sequential execution; Variables; Simple Types: integer, real, boolean; String handling; Expressions; Control: if, repeat, while, for; Files; Visibility of identifiers; Methods; Arrays.

Structure

12 week course - 3 one-hour lectures, 1 one-hour tutorial and 1 two-hour practical per week.

Assessment

1st Attempt: 1 two-hour written examination (50%) and continuous assessment (50%). In order to pass the course, candidates must obtain a pass mark in the examination and in the overall combination of examination and continuous assessment (with the above weights). Resit: 50% continuous assessment carried forward from original attempt; 50% new written examination. Students must obtain a pass in the examination and the overall combination of exam and continuous assessment.

Credit Points

20

Course Coordinator

To be advised.

Pre-requisites

None

Co-requisites

None

Notes

(i) Students should not take this course if they are currently registered for, or have already obtained credit points in any of the following: CS 1008, CS 1301, CS 1508, CS 1801, CS 1003, CS 1005, CS 1502, CS 1503, TS 1001, LS1510, LS 1511, LS 1513.
(ii) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.
(iii) Advisers of Studies should note that CS 1011 and CS 1511 are identical courses.

Overview

The course follows the syllabus of the European Computer Driving License (ECDL). The subject matter is grouped into 7 modules:
(1) Basic Concepts of Information Technology; (2) Using the Computer and Managing Files; (3) Word Processing; (4) Spreadsheets; (5) Databases; (6) Presentations; (7) Information and Communication.

Structure

12 week course - 2 one-hour lectures; 3 one-hour practicals per week.

Assessment

1st Attempt: One 1.5 hour multiple-choice examination (25%) and continuous assessment (75%). Resit: Candidates only resit those components which they failed (CAS<9) at first attempt. Multiple-choice examination (25%) at resit is one and a half-hours; practical assessments are 45 minutes each.

Credit Points

15

Course Coordinator

Dr S P Townsend

Pre-requisites

CS 1507

Notes

Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.

Overview

This course identifies fundamental data structures and algorithms as the basic building blocks of software systems, and provides experience of their implementation and application using the Java programming language. Introduction to Design of algorithms. Recursion and simple analysis of recursive methods. Data Types & Abstraction. Use of the Java Collection Framework. Stacks, Queues, Deques and Lists. Hash tables. Trees. Search Trees. Heaps. Sets. Algorithmic paradigms and their applications. Implementation issues and efficiency measures.

Structure

12 week course - 2 one-hour lectures, 1 one-hour tutorial and 1 one-hour practical per week.

Assessment

1st Attempt: 1 two-hour written examination (75%) and continuous assessment (25%). In order to pass the course, candidates must obtain a pass mark in the examination and in the overall combination of examination and continuous assessment (with the above weights). Resit: 75% from a two-hour written examination; 25% carried forward from the original continuous assessment. Candidates must obtain a pass mark in the exam and the overall combination of exam and continuous assessment.

Credit Points

15

Course Coordinator

Dr D Ritchie

Pre-requisites

CS 1507 and CS 1009

Co-requisites

None

Notes

Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.

Overview

The concept of a database and database management. Database development. Illustrations. Entity-Relationship model. Database design: logical design and the relational model. Normalisation; different normal forms. Physical design; file organisation and access; indexing. Database administration. Query By Example and SQL. Query optimisation. Practical examples using MS Access.
Client-server model. Database servers. Database access from client applications. Web-based database access through server-side scripting. Practical examples using MS Access, SQL Server, Javascript and JDBC.
A brief overview of key concepts in distributed, object-oriented, multimedia, spatial and geo-referenced database systems. Data mining.
Basic information retrieval techniques in search engines.

Structure

12 week course - 2 one-hour lectures; plus one two-hour practical per week.

Assessment

1st Attempt: 1 two-hour written examination (75%) and continuous assessment (25%). In order to pass the course, candidates must obtain a pass mark in the examination and in the overall combination of examination and continuous assessment (with the above weights). Resit: 75% from a two-hour written examination; 25% carried forward from the original continuous assessment. Candidates must obtain a pass mark in the exam and the overall combination of exam and continuous assessment.

Credit Points

15

Course Coordinator

Dr E Reiter

Pre-requisites

CS 2005 and CS 2006

Co-requisites

None

Notes

Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.

Overview

Principles of HCI: metaphors and conceptual models; seven stages of action; user models; human information processing; ergonomics; user-centred design and evaluation methodologies; HCI guidelines and standards, including Shneiderman's 8 golden rules. Input/output modes and devices; interaction styles. Users with special needs. Internationalisation. Evaluation techniques - walkthroughs, heuristic evaluation, expert reviews, controlled experiments.
Java APIs for Building User-Interfaces.
Technical Writing and Documentation: help systems; writing tutorials, user manuals and reference material.
Advanced Topics in HCI: multimedia; games.

Structure

12 week course - 2 one-hour lectures; 1 two-hour practical per week.

Assessment

1st Attempt: One 1.5 hour written examination (50%) and continuous assessment (50%). In order to pass the course, candidates must obtain a pass mark in the examination and in the overall combination of examination and continuous assessment (with the above weights). Resit: 50% from a written examination (one and a half-hours); 25% carried forward from original continuous assessment; 25% based on a new exercise. Candidates must obtain a pass mark in the exam and the overall combination of exam and continuous assessment.

Credit Points

15

Course Coordinator

Dr J R Lishman

Pre-requisites

CS 2005

Co-requisites

None

Notes

Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.

Overview

Simple C Programming: data types, variables, operators and expressions, control structures (branching, looping, iteration), procedures and functions, input/output, arrays, pointers.
Data representation: bits, binary representation of integers and reals, character codes, Boolean algebra.
Register level machine: main functional parts of a computer - CPU, memory, I/O, buses; architecture of a simple CPU: registers, ALU, control unit; fetch/execute cycle, structure of instructions, instruction decoding; memory addressing: immediate, direct, register, indexing, etc. reference to binary machine code.
Special hardware support: floating point units, graphics.
Assembly language programming: relationship of symbolic instructions and memory addressing modes to the register level architecture; examples of simple assembly language programs.
Execution of C programs on the register level machine.
Memory: different types of memory - main, cache, backing.
I/O: transmission modes (serial/parallel, synchronous/asynchronous), DMA, interrupts.

Structure

12 week course 2 one-hour lectures; one two-hour practical per week.

Assessment

1st Attempt: 1 two-hour written examination (75%) and continuous assessment (25%). In order to pass the course, candidates must obtain a pass mark in the examination and in the overall combination of examination and continuous assessment (with the above weights). Resit: 75% from a written examination (2 hours); 25% carried forward from original continuous assessment. Candidates must obtain a pass mark in the exam and the overall combination of exam and continuous assessment.

Credit Points

15

Course Coordinator

Dr J R Lishman

Pre-requisites

CS 2005, CS 2507.

Notes

(i) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.


(ii) Non-graduating students would require the following background/experience: knowledge of common data-structures and algorithms; experience of the C programming language.

Overview

Introduction and historical overview: from batch systems to distributed OS. I/O system structures: i/o bus, interrupts, DMA. OS structure and services: system calls, system programs, virtual machines. Processes and threads: scheduling, operation, co-operation and communication. Synchronisation, semaphores and deadlock handling. Memory management: logical and physical address spaces, swapping, segmentation and paging. File systems, directory structure, and storage allocation. Protection and security. Comparing and contrasting examples and case studies from UNIX, Solaris 2, and MS-DOS.

Structure

12 week course - 2 one-hour lectures and 1 two-hour laboratory session per week.

Assessment

1st Attempt: 1 two-hour written examination paper (75%) and practical exercises (25%). In order to pass the course, candidates must obtain a pass mark in the examination and in the overall combination of examination and continuous assessment (with the above weights). Resit: 1 two-hour written examination (75%); 25% carried forward from original continuous assessment. Candidates must obtain pass mark in the examination and in the overall combination of exam and continuous assessment.

Credit Points

15

Course Coordinator

Dr F Guerin

Pre-requisites

CS 2005 and any Level 1 mathematics course.

Notes

(i) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.
(ii) Non-graduating students would require the following background/experience: knowledge of common data structures and algorithms; intermediate level experience of the Java programming language; mathematics equivalent to higher level.

Overview

Alphabets, strings and languages, regular expressions and languages, finite state automata, output from automata, grammars and context free languages, syntax analysis, derivation trees, ambiguous grammars and inherently ambiguous languages, bottom-up syntax analysis, LR parsing, parser generator tools, translation, A mini-Compiler.

Structure

12 week course - 2 one-hour lectures and 1 two-hour tutorial per week.

Assessment

1st Attempt: 1 two-hour written examination (75%) and continuous assessment (25%). In order to pass the course, candidates must obtain a pass mark in the examination and in the overall combination of examination and continuous assessment (with the above weights). Resit: 1 two-hour written examination (75%); 25% carried forward from original continuous assessment. Candidates must obtain a pass mark in the exam and in the overall combination of exam and continuous assessment.

Credit Points

15

Course Coordinator

Dr G M Coghill

Pre-requisites

CS 2005, CS 2006, CS 2507

Notes

(i) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.
(ii) Non-graduating students would require the following background/experience: familiarity with a procedural programming language.

Overview

Prolog: logic programming paradigm; declarative representations; language basics; lists; recursion; programming methods and applications.
Introduction to Artificial Intelligence: aims, history and issues.
Search: depth first; breadth first; heuristic.
Game playing: adversarial search; static evaluation; minimax.
Knowledge representation and reasoning: propositional logic; rule-based systems; forward and backward chaining.
Planning: motivation; STRIPS; non-linear planning.
Machine Learning: decision tree induction; concept learning.

Structure

12 week course – two one-hour lectures and one two-hour practical session each week.

Assessment

1st Attempt: 1 two-hour written examination (75%) and continuous assessment (25%). In order to pass the course, candidates must obtain a pass mark in the examination and in the overall combination of examination and continuous assessment (with the above weights). Resit: 1 two-hour written examination (75%); 25% carried forward from original continuous assessment. Candidates must obtain a pass mark in the exam and in the overall combination of exam and continuous assessment.

Credit Points

30

Course Coordinator

Dr E Compatangelo

Pre-requisites

CS 2005, CS 2006, CS 2506

Notes

(i) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.
(ii) This course runs for the entire session and is only available to students registered for Honours degree programmes offered by Computing Science.

Overview

Introduction to software engineering – software development paradigms, software lifecycle, prototyping.
Project management issues – team organisation, software measurement and metrics, cost estimation, risk analysis,
Systems analysis and design – requirements elicitation, interviewing, system modelling functional vs non-functional requirements, developing a system specification, object libraries, design patterns.
The Unified Modelling Language (UML) and comparison with structured methods (e.g. SSADM)
Computer aided software engineering.
Implementation and integration methods.
Software testing – testing strategies and methods, quality assurance and management, verification and validation.
Software documentation and maintenance.

Structure

24 week course – 2 one-hour lectures, 1 two-hour practical per week during first half-session; 1 one-hour lecture per week, 1 two-hour practical every third week during second half-session.

Assessment

1st Attempt: One 1.5 hour written examination (25%) and software engineering project (75%). In order to pass the course, candidates must obtain a pass mark in the examination and in the overall combination of examination and continuous assessment (with the above weights). Resit: 1 one and a half-hour written examination (25%); original project mark carried forward (75%). Candidates must obtain a pass mark in the exam and the overall combination of exam and continuous assessment.

Credit Points

15

Course Coordinator

Dr B Scharlau

Pre-requisites

CS2506

Co-requisites

None

Notes

(i) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.
(ii) Non-graduating students would require the following background/experience: Knowledge of Internet and world-wide web technologies and design principles for information-rich web sites; Programming in Java; Basic organisation and functionality of database systems.

Overview

Introduction and historical overview of the Internet.
Part l - Technologies and technical issues:

1. Internet services: application protocols (HTTP, FTP, Telnet, etc.), web
   servers (assessment, configuration and maintenance).


2. Privacy and security: technologies (firewall, encryption, etc.), certificate
   management, legal, social and human issues.
   
   

Part ll - Design and management of web sites:

1. Design and maintenance of web site information content (quality, quantity,
   format and location of information);
   
   copyright and responsibility.


2. HCI for the web: recommendations, internationalisation, accessibility; influence
   of technologies on design.


3. Tools and techniques for web site development and management.


4. Assessment and evaluation of web sites (tools, standards and practices).

Structure

12 week course - 2 one-hour lectures and 1 two-hour practical session each week.

Assessment

1st Attempt: 1 two-hour written examination (75%) and continuous assessment (25%). In order to pass the course, candidates must obtain a pass mark in the examination and in the overall combination of examination and continuous assessment (with the above weights). Resit: 1 two-hour written examination (75%); 25% carried forward from original continuous assessment. Candidates must obtain a pass mark in the overall combination of exam and continuous assessment.

Credit Points

15

Course Coordinator

To be advised.

Pre-requisites

CS 2005 and any level 1 mathematics course.

Notes

(i) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.
(ii) Non-graduating students would require the following background/experience: knowledge of common data-structures and algorithms; mathematics equivalent to higher level.

Overview

Logic statements, relations and their applications. Sets, functions, graphs and related algorithms. Algebraic systems and their applications to graphical methods. Geometric algorithms. Graph algorithms. Cryptological methods.

Structure

12 week course - 2 one-hour lectures, 1 two-hour tutorial per week.

Assessment

1st Attempt: 1 two-hour written examination paper (100%). Resit: 1 two-hour written examination paper (100%).

Credit Points

15

Course Coordinator

Dr B Scharlau

Pre-requisites

CS 2005, CS 2006, CS 2506

Co-requisites

CS 3015

Notes

(i) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.
(ii) Non-graduating students would require the following background/experience: knowledge of database principles; intermediate-level experience of at least one programming language; principles of systems analysis and design.

Overview

Rapid application development for business systems using Visual BASIC, e.g. VB. Net .
Review of COBOL and its use in information processing.
Business to Business (B2B) applications; modern approaches to EDI using XML, e.g. ebXML, BizTalk.
Business modelling (including data warehousing, OLAP).
Information in organisational decision making.
Integration of information systems with organisational strategy and development.

Structure

12 week course – 2 one-hour lectures, 1 two-hour practical per week.

Assessment

1st Attempt: 1 two-hour written examination (50%) and continuous assessment (50%). In order to pass the course, candidates must obtain a pass mark in the examination and in the overall combination of examination and continuous assessment (with the above weights). Resit: 1 two-hour written examination (50%); 25% carried forward from original assessment; 25% based on a new exercise. Candidates must obtain a pass in the exam, and in the overall combination of exam and continuous assessment.

Credit Points

15

Course Coordinator

Dr T J Norman

Pre-requisites

CS 2005, CS 2006, CS 3008

Notes

(i) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.
(ii) Non-graduating students would require the following background/experience: knowledge of operating system concepts, including concurrency; knowledge of database principles, including SQL; intermediate-level Java programming experience.

Overview

Introduction to distributed information systems. Review of the Internet Technology (Networks & Protocols).
Distributed programming with sockets. Socket Essentials. Multithreading in Java. Basic concepts of Internet services.
Enterprise computing architectures. Security. Object-based Protocols. Two-tier and three-tier Architectures. Remote Method Invocation.
Distributed database transactions. Java Database Connectivity. Java Servlets. Distributed Transactions. Transaction Processing Monitors.
Enterprise-level interoperability. COBRA. Object Services, ERP Systems. XML.
Electronic commerce. E-commerce Essentials. Software Agents in E-commerce.

Structure

12 week course - 2 one-hour lectures and 1 two-hour practical session per week.

Assessment

1st Attempt: 1 two-hour written examination (75%) and continuous assessment (25%). In order to pass the course, candidates must obtain a pass mark in the examination and in the overall combination of examination and continuous assessment (with the above weights). Resit: 1 two-hour written examination (75%); 25% carried forward from original continuous assessment. Candidates must obtain a pass mark in the exam and in the overall combination of exam and continuous assessment.

Credit Points

120

Course Coordinator

Dr E Reiter

Pre-requisites

Acceptance into Senior Honours and permission of Head of Computing Science. Availability of placement.

Overview

Work experience in an industrial, business, or public sector organisation.

Assessment

1st Attempt: Written report and oral presentation of the work undertaken during the year (100%). Resit:

Credit Points

15

Course Coordinator

Dr W Vasconcelos

Pre-requisites

CS 3012, CS 3511

Notes

(i) Restricted to students registered for Honours degree programmes offered by Computing Science.
(ii) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.

Overview

Control structures - formal descriptions of abstract computing engines and examples of their use. The Z specification language; comparison to functional language. Functional programming - higher order functions; polymorphic type checks. Theoretical limits of computability; the halting problem; polynomial and exponential time algorithms.

Structure

12 week course - 2 one-hour lectures and 1 two-hour tutorial per week.

Assessment

1st Attempt: 1 two-hour written examination paper (75%) and continuous assessment (25%). Resit: No resit.

Credit Points

15

Course Coordinator

Professor D Sleeman

Pre-requisites

CS 3014

Notes

(i) Restricted to students registered for Honours degree programmes offered by Computing Science.
(ii) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.

Overview

Introduction to Knowledge Technologies/Management; identification of inherent research challenges. Introduction to knowledge-based systems; rule-based systems, knowledge representation, case studies, programming in CLIPS, interfacing with users, uncertainty. Review of the 6 major challenges associated with Knowledge Technologies, namely Knowledge Capture, Modelling, Use/Reuse, Retrieval, Publishing and Maintenance.

Structure

12 week course – 2 one-hour lectures and 1 two-hour practical session per week.

Assessment

1st Attempt: 1 two-hour written examination (75%) and continuous assessment (25%). Resit: No resit.

Credit Points

15

Course Coordinator

Dr W Vasconcelos

Pre-requisites

CS 3515 - Distributed Information Systems.

Notes

Restricted to students for Honours degree programmes offered by Computing Science.

Overview

Introduction to advanced distributed information systems. Review of message-passing and distributed objects architectures. Tuple-space architectures (JavaSpaces and JINI). Distributed information agents. Java security model.
Information agents. Interoperability (agent communication languages - standards and protocols). Mediation. Agent wrappers. Mobile agents.
Information storage and retrieval. Introduction to information retrieval techniques (term-frequency distributions, vector space models). Search services and search strategies.
Practical applications of advanced distributed information systems. Real-time multi-media systems. Web search engines. Personal information agents.

Structure

2 one-hour lectures and 1 two-hour practical session per week.

Assessment

1st Attempt: 1 two-hour written examination (75%) and continuous assessment (25%). Resit: No resit.

Credit Points

15

Course Coordinator

Dr G M Coghill

Pre-requisites

CS 3014, CS 3515

Notes

(i) Available only to Final Year Honours students in Computing Science.
(ii) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.

Overview

Outline of molecular biology, Data searches and pairwise alignment, Methods for phylogenetics, Genomics and gene recognition, data mining,model learning, Grid computing.

Structure

12 week course - 2 one-hour lectures and 1 two-hour practical session per week.

Assessment

1st Attempt: 1 two-hour written examination (75%) and Continuous Assessment (25%).
Resit: No resit.

Credit Points

15

Course Coordinator

Dr D W Ritchie

Pre-requisites

CS 3511

Notes

(i) Available only to Final Year Honours students in Computing Science.
(ii) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.

Overview

Two-dimensional graphics: lines, polygons, coordinate systems, clipping; raster techniques; polygon filling; anti-aliasing; bit-planes; colour models. Three-dimensional graphics: coordinate systems; homogeneous transformations (rotating, translating, scaling), perspective; surface models; hidden line and surface removal; lighting models, shading, shadows, textures, ray tracing.
Object-oriented techniques: scene graphs; behaviours; interpolators; collision detection.
Graphics hardware: input/output (including virtual reality) devices; stereographics; animation and interaction techniques.
Applications of computer graphics will be considered (e.g. CAD, molecular graphics, scientific visualisation, entertainment).

Structure

12 week course - 2 one-hour lectures and 1 two-hour practical session per week.

Assessment

1st Attempt: 1 two-hour written examination (75%) and Continuous Assessment (25%).
Resit: No resit.

Credit Points

15

Course Coordinator

Professor C Mellish

Pre-requisites

CS 3014

Notes

(i) Available only to Final Year Honours students in Computing Science.
(ii) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.

Overview

Formal linguistic models of English: word categories, sentence constituents, phrase-structure grammar rules, features. Modelling syntactic phenemena.
Parsing: shift-reduce parsers, chart parsers, handling ambiguity, definate clause grammars.
Semantics and pragmatics: meaning representations, reference, speech acts.
Generation: Content determination, sentence planning, and realisation.
Applications: grammar checking, machine translation, database interfaces, report generation, dictation.
Speech: Hidden Markov Models, statistical langauge models, speech synthesis.

Structure

12 week course - 2 one-hour lectures and 1 two-hour practical session per week.

Assessment

1st Attempt: 1 two-hour written examination (75%) and Continuous Assessment (25%).
Resit: No resit.

Credit Points

10

Course Coordinator

Dr D W Ritchie

Pre-requisites

CS 3015

Notes

(i) Available only to Final Year Single Honours students in Computing Science.
(ii) Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disbaility Co-ordinator.

Overview

Ethics: the individual, organisational and societal context of computing systems; deployemnt of technical knowledge and skills with a concern for the public good. Legal Issues: UK legal system, contract law liabilities, company and employment law, data protection, computer misuse, intellectual property rights.
Public policy issues: digital signatures, restrictions on encryption, IT monopolies.
Safety/mission critical software: impact of failure on users; liability; risk analysis.
Professional Bodies: structure, function, restriction of title, licence to practise, code of ethics/conduct/practice.
Career: Career options; entrepreneurship; rights and duties of an employee.
Aspects of effective communication: written and verbal communication skills.

Structure

8 week course - 2 one-hour lectures, 1 two-hour practical session per week.

Assessment

1st Attempt: One 1.5 hour examination (75%) and Continuous Assessment consisting of: 4000 word essay/report (20%), oral presentation (5%).
Resit: No resit.

Credit Points

30

Course Coordinator

Dr W Vasconcelos

Pre-requisites

Available only to Final Year Joint Honours students in Computing Science.

Notes

Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any students wishing to discuss this further should contact the School Disability Co-ordinator.

Overview

The student will undertake a project under the supervision of teaching staff in Computing Science. The project will require creativity, analytical and practical skills. A major component of the project is its presentation, both written and oral.

Structure

15 week project course - weekly meetings with project supervisor.

Assessment

1st Attempt: 95% report and documentation, 5% oral presentation.
Resit: No resit.

Credit Points

50

Course Coordinator

Dr W Vasconcelos

Pre-requisites

Available only to Final Year Single Honours students in Computing Science.

Notes

Assistive technologies may be required for any student who is unable to use a standard keyboard/mouse/computer monitor. Any student wishing to discuss this further should contact the School Disability Co-ordinator.

Overview

The student will undertake a project under the supervision of teaching staff in Computing Science. The project will require creativity, analytical and practical skills. A major component of the project is its presentation, both written and oral.

Structure

15 week project course - weekly meetings with project supervisor.

Assessment

1st Attempt: 95% report and documentation, 5% oral presentation.
Resit: No resit.