School of Computer Science BCS accreditation 2021 - 2026

Artificial Intelligence MEng (Hons) - COMP11212 Fundamentals of Computation

2.1.1 Knowledge and understanding of facts, concepts, principles & theories

The unit consists of two halves. The first introduces regular expressions, automata and grammars with an emphasis on the relationships between the formalisms and their use to solve problems. The second half uses a simple WHILE language to introduce the topics of complexity, correctness and computability.

Assesement : Examination, Individual coursework

2.1.3 Problem solving strategies

The course notes include a comprehensive set of exercises designed to develop students' abilities to work with the formalisms taught. Examples classes give face to face feedback on performance.

Assesement : Examination, Individual coursework

2.1.4 Analyse if/how a system meets current and future requirements

The unit introduces the notion of computational correctness and the use of formal specifications to describe behaviour.

Assesement : Examination, Individual coursework

2.2.2 Evaluate systems in terms of quality and trade-offs

The unit focuses on a number of equivalent formalisms (regular expressions and various flavours of automata). Trade-offs between these systems are discussed in terms of their usability, implementation and reasoning about their properties.

Assesement : Not Assessed

3.1.4 Knowledge and understanding of mathematical and/or statistical principles

The course exposes students to mathematical treatments of basic topics such as computability and complexity. It also gives experience in defining and using formal systems and notations (e.g. grammars), and reasoning about such systems.

Assesement : Examination, Individual coursework