Undergraduate Course: Informatics 1 - Computation and Logic (INFR08012)
Course Outline
| School |
School of Informatics |
College |
College of Science and Engineering |
| Course type |
Standard |
Availability |
Available to all students |
| Credit level (Normal year taken) |
SCQF Level 08 (Year 1 Undergraduate) |
Credits |
10 |
| Home subject area |
Informatics |
Other subject area |
None |
| Course website |
http://www.inf.ed.ac.uk/teaching/courses/inf1 |
|
|
| Course description |
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. |
Course Delivery Information
|
| Delivery period: 2010/11 Semester 1, Available to all students (SV1)
|
WebCT enabled: Yes |
Quota: None |
| Location |
Activity |
Description |
Weeks |
Monday |
Tuesday |
Wednesday |
Thursday |
Friday |
| Central | Lecture | | 1-11 | | | | 11:10 - 12:00 | | | Central | Lecture | | 1-11 | | | | | 14:00 - 14:50 |
| First Class |
Week 1, Thursday, 11:10 - 12:00, Zone: Central. Lecture Theatre 5, Appleton Tower |
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.
If delivered in semester 1, this course will have an option for semester 1 only visiting undergraduate students, providing assessment prior to the end of the calendar year. |
| Please see Visiting Student Prospectus website for Visiting Student Assessment information |
Special Arrangements
| Not entered |
Contacts
| Course organiser |
Dr Ewan Klein
Tel: (0131 6)50 2705
Email: ewan.klein@ed.ac.uk |
Course secretary |
Ms Kirsten Belk
Tel: (0131 6)50 5194
Email: kbelk@staffmail.ed.ac.uk |
|
copyright 2010 The University of Edinburgh -
1 September 2010 6:09 am
|
University Homepage