University Homepage
DRPS Homepage
DRPS Search
DRPS Contact
DRPS : Course Catalogue : School of Informatics : Informatics

Undergraduate Course: Informatics 1 - Computation and Logic (INFR08012)

Course Outline
SchoolSchool of Informatics CollegeCollege of Science and Engineering
Credit level (Normal year taken)SCQF Level 8 (Year 1 Undergraduate) AvailabilityAvailable to all students
SCQF Credits10 ECTS Credits5
SummaryThe 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 description 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)
Pre-requisites Co-requisites Students MUST also take: Informatics 1 - Functional Programming (INFR08013)
Prohibited Combinations Other requirements SCE H-grade Mathematics or equivalent is desirable.
Information for Visiting Students
High Demand Course? Yes
Course Delivery Information
Academic year 2015/16, Available to all students (SV1) Quota:  None
Course Start Semester 1
Timetable Timetable
Learning and Teaching activities (Further Info) Total Hours: 100 ( 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 64 )
Assessment (Further Info) Written Exam 100 %, Coursework 0 %, Practical Exam 0 %
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.
Feedback Not entered
Exam Information
Exam Diet Paper Name Hours & Minutes
Main Exam Diet S1 (December)2:00
Resit Exam Diet (August)2:00
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.
Reading List
Additional Information
Course URL
Graduate Attributes and Skills Not entered
KeywordsNot entered
Course organiserProf Mike Fourman
Tel: (0131 6)51 5615
Course secretaryMr Gregor Hall
Tel: (0131 6)50 5194
Help & Information
Search DPTs and Courses
Degree Programmes
Browse DPTs
Humanities and Social Science
Science and Engineering
Medicine and Veterinary Medicine
Other Information
Combined Course Timetable
Important Information
© Copyright 2015 The University of Edinburgh - 18 January 2016 4:12 am