COMP11212: Fundamentals of Computation (2012-2013)
The building of real-life computing systems, e.g. mobile phone, tv/video remote control, internet shopping, air-traffic control, internet banking, etc., is always a complex task. Mistakes can be very annoying, costly and sometimes life threatening. Methods and techniques to support the building and understanding of such systems are essential. This course unit provides an introduction to the basic computer science ideas underlying such methods. It is also a part of, and an introduction to, the Modelling and Rigorous Development theme.
This course unit provides a first approach to answering the following questions. What methods are there that can help understanding complicated systems or programs? How can we make sure that a program does what we intend it to do? How do computers go about recognizing pieces of text? If there are two ways of solving the same problem, how can we compare them? How do we measure that one of them gives the solution faster? How can we understand what computers can do in principle, and are there problems that are not solvable by a computer?
|Programme outcome||Unit learning outcomes||Assessment|
|A1 B1||Be able to construct simple graph-based models of computation, e.g., finite state automata.|
|A1 B1||Understand how patterns and grammars can be used to recognise pieces of text.|
|A1 B1||Appreciate that there are unsolvable problems.|
|A1 B1||Understand fundamental techniques for measuring performance of systems.|
|A1 B1||Gain skills in modelling and abstract thinking.|
There are two groups of topics covered. One of the lectures will be an introduction to the course unit, and one is reserved for revision. That leaves 10 lectures for each part.
The first part (10 lectures) is concerned with expressing particular strings, and collections of strings, and here we will introduce the methods by which a computer goes about it. The ability to recognize key strings (such as programming constructs or variable names) are, for example, required in every compiler, but they are also used by search engines such as Google.
The formalisms introduced include finite state automata, regular expressions (most often used in pattern matching), (regular) grammars. The emphasis is on students being able to use these formalisms to solve problems.
The second group (10 lectures) provides anintroduction to the two topics of computability and computational complexity. There are five big topics:
- recursion and induction
- the WHILE programming language
- asymptotic complexity
- partial and full program correctness
The course is supported by lecture notes. Suggestions for additional reading are made in the notes.