# DEGREE REGULATIONS & PROGRAMMES OF STUDY 2009/2010

 University Homepage DRPS Homepage DRPS Search DRPS Contact

# Informatics 1 - Computation and Logic (U04323)

? Credit Points : 10  ? SCQF Level : 8  ? Acronym : INF-1-INF1-CL

The goal of this strand is to introduce the notions of computation and specification using finite-state systems and propositional logic. Finite state machines provide a simple model of computation that is widely used, has an interesting meta-theory and has immediate application in a range of situations. They are used as basic computational models across the whole of Informatics and at the same time are used successfully in many widely used applications and components. Propositional logic, similarly is the first step in understanding logic which is an essential element of the specification of Informatics systems and their properties.

### Entry Requirements

? Pre-requisites : SCE H-grade Mathematics or equivalent is desirable.

? Co-requisites : Informatics 1 - Functional Programming [U04324] is a strict co-requisite.

### Delivery Information

? Normal year taken : 1st year

? Delivery Period : Semester 1 (Blocks 1-2)

? Contact Teaching Time : 2 hour(s) per week for 10 weeks

### First Class Information

 Date Start End Room Area Additional Information 24/09/2009 11:10 12:00 Lecture Theatre 4, Appleton Tower Central

### All of the following classes

 Type Day Start End Area Lecture Thursday 11:10 12:00 Central Lecture Friday 14:00 14:50 Central

### Summary of Intended Learning Outcomes

1 - Design a small finite-state system to describe, control or realise some behaviour.
2 - Evaluate the quality of such designs using standard engineering approaches.
3 - Apply the algebra of finite automata to design systems and to solve simple problems on creating acceptors for particular languages.
4 - Describe simple problems using propositional logic.
5 - For a given formula in propositional logic, draw a truth table for that formula and hence deduce whether that formula is true or not.
6 - Apply a system of proof rules to prove simple propositional theorems.
7 - Describe the range of systems to which finite-state systems and propositional logic are applicable and be able to use the meta theory to demonstrate the limitations of these approaches in concrete situations.

### Assessment Information

Written Examination 100
Assessed Assignments 0
Oral Presentations 0

Assessment
Formative assessment will be used to provide feedback and guidance to students and will take the form of quizzes, exercise sheets, practical exercises and coursework assignments, covering areas from across the syllabus.

### Exam times

 Diet Diet Month Paper Code Paper Name Length 1ST December - - 2 hour(s) 2ND August - - 2 hour(s)

### Contact and Further Information

The Course Secretary should be the first point of contact for all enquiries.

Course Secretary

Miss Tamise Totterdell
Tel : (0131 6)50 9970
Email : t.totterdell@ed.ac.uk

Course Organiser

Dr Alex Simpson
Tel : (0131 6)50 5113
Email : Alex.Simpson@ed.ac.uk

Course Website : http://www.inf.ed.ac.uk/teaching/courses/

School Website : http://www.informatics.ed.ac.uk/

College Website : http://www.scieng.ed.ac.uk/

 Navigation Help & Information Home Introduction Glossary Search Regulations Regulations Degree Programmes Introduction Browse DPTs Courses Introduction Humanities and Social Science Science and Engineering Medicine and Veterinary Medicine Other Information Timetab Print on Demand (Only accessible to staff and students of the University of Edinburgh) Prospectuses Important Information
copyright 2009 The University of Edinburgh