Undergraduate Course: Informatics 1 - Computation and Logic (INFR08012)
|School||School of Informatics
||College||College of Science and Engineering
||Availability||Available to all students
|Credit level (Normal year taken)||SCQF Level 8 (Year 1 Undergraduate)
|Home subject area||Informatics
||Other subject area||None
||Taught in Gaelic?||No
|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.
Entry Requirements (not applicable to Visiting Students)
||Co-requisites|| Students MUST also take:
Informatics 1 - Functional Programming (INFR08013)
||Other requirements|| SCE H-grade Mathematics or equivalent is desirable.
|Additional Costs|| None
Information for Visiting Students
|Displayed in Visiting Students Prospectus?||Yes
Course Delivery Information
|Delivery period: 2012/13 Semester 1, Available to all students (SV1)
||Learn enabled: Yes
|Central||Lecture||1-11|| 11:10 - 12:00|
|Central||Lecture||1-11|| 14:00 - 14:50|
||Week 1, Thursday, 11:10 - 12:00, Zone: Central. LT 5 Appleton Tower |
|Main Exam Diet S1 (December)||2:00|
|Resit Exam Diet (August)||2:00|
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.
|Written Examination 100|
Assessed Assignments 0
Oral Presentations 0
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.
||Finite-state systems as a basic model of computation: deterministic and non-deterministic 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
||To be confirmed
Timetabled Laboratories 0
Non-timetabled assessed assignments 0
Private Study/Other 70
|Course organiser||Mr Paul Anderson
Tel: (0131 6)51 3241
|Course secretary||Ms Kirsten Belk
Tel: (0131 6)50 5194
© Copyright 2012 The University of Edinburgh - 14 January 2013 4:08 am