Undergraduate Course: Informatics 1 - Computation and Logic (INFR08012)
|School||School of Informatics
||College||College of Science and Engineering
|Credit level (Normal year taken)||SCQF Level 8 (Year 1 Undergraduate)
||Availability||Available to all students
|Summary||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.
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. Introduction to software IP, and notions of verification, correctness, best practice and liability.
Relevant QAA Computing Curriculum Sections: computer based systems, theoretical computing
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.
Information for Visiting Students
|High Demand Course?
Course Delivery Information
|Academic year 2016/17, Available to all students (SV1)
|Learning and Teaching activities (Further Info)
Lecture Hours 20,
Seminar/Tutorial Hours 10,
Feedback/Feedforward Hours 2,
Summative Assessment Hours 2,
Programme Level Learning and Teaching Hours 2,
Directed Learning and Independent Learning Hours
|Assessment (Further Info)
|Additional Information (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.
||Hours & Minutes
|Main Exam Diet S1 (December)||2:00|
|Resit Exam Diet (August)||2:00|
On completion of this course, the student will be able to:
- Design a small finite-state system to describe, control or realise some behaviour, and evaluate the quality of such designs using standard engineering approaches
- Apply the algebra of finite automata to design systems and to solve simple problems on creating acceptors for particular languages
- Used propositional logic to describe simple problems, and truth table methods to determine truth values for given propositions
- Apply a system of proof rules to prove simple propositional theorems
- 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
|Course organiser||Prof Mike Fourman
Tel: (0131 6)51 5615
|Course secretary||Mr Rob Armitage
Tel: (0131 6)50 5194
© Copyright 2016 The University of Edinburgh - 3 February 2017 4:24 am