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 8 (Year 1 Undergraduate) 
Credits  10 
Home subject area  Informatics 
Other subject area  None 
Course website 
http://www.inf.ed.ac.uk/teaching/courses/inf1/cl/ 
Taught in Gaelic?  No 
Course description  The goal of this strand is to introduce the notions of computation and specification using finitestate systems and propositional logic. Finite state machines provide a simple model of computation that is widely used, has an interesting metatheory 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 (not applicable to Visiting Students)
Prerequisites 

Corequisites  Students MUST also take:
Informatics 1  Functional Programming (INFR08013)

Prohibited Combinations  
Other requirements  SCE Hgrade Mathematics or equivalent is desirable. 
Additional Costs  None 
Information for Visiting Students
Prerequisites  None 
Displayed in Visiting Students Prospectus?  Yes 
Course Delivery Information

Delivery period: 2012/13 Semester 1, Available to all students (SV1)

Learn enabled: Yes 
Quota: None 
Location 
Activity 
Description 
Weeks 
Monday 
Tuesday 
Wednesday 
Thursday 
Friday 
Central  Lecture   111     11:10  12:00   Central  Lecture   111      14:00  14:50 
First Class 
Week 1, Thursday, 11:10  12:00, Zone: Central. LT 5 Appleton Tower 
Exam Information 
Exam Diet 
Paper Name 
Hours:Minutes 


Main Exam Diet S1 (December)   2:00    Resit Exam Diet (August)   2:00   
Summary of Intended Learning Outcomes
1  Design a small finitestate 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 finitestate 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.

Special Arrangements
None 
Additional Information
Academic description 
Not entered 
Syllabus 
Finitestate systems as a basic model of computation: deterministic and nondeterministic automata; transducers; acceptors; structured design of finite state machines. Propositional logic: truth tables; natural deduction; resolution; elementary temporal logic.
Relevant QAA Computing Curriculum Sections: computer based systems, theoretical computing 
Transferable skills 
Not entered 
Reading list 
To be confirmed 
Study Abroad 
Not entered 
Study Pattern 
Lectures 20
Tutorials 10
Timetabled Laboratories 0
Nontimetabled assessed assignments 0
Private Study/Other 70
Total 100 
Keywords  Not entered 
Contacts
Course organiser  Mr Paul Anderson
Tel: (0131 6)51 3241
Email: dcspaul@inf.ed.ac.uk 
Course secretary  Ms Kirsten Belk
Tel: (0131 6)50 5194
Email: kbelk@exseed.ed.ac.uk 

