Undergraduate Course: Informatics 1 - Introduction to Computation (INFR08025)
|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||Note: This course is only available to Informatics students and those on combined Informatics degrees with Maths and PPLS. It is currently at full capacity. If this course is a compulsory part of your degree programme and you need to be enrolled, please contact the course secretary on 0131 650 5194.
**This 20 credit course replaces the two 10 credit courses - 'Informatics 1 - Functional Programming INFR08013' and 'Informatics 1 - Computation and Logic INFR08012' from 2018/19**.
An introduction to concepts of programming, using a functional programming language, and to concepts of computation and specification using finite-state systems and propositional logic. These provide examples of the logical ideas of syntax and semantics and the computational ideas of structure and behaviour. Students learn to specify, model and solve small-scale problems succinctly and at an abstract level.
An introduction to concepts of programming, using the Haskell functional programming language, and to concepts of computation and specification, using finite-state machines and propositional logic. The use of sets, functions and relations to describe models of logic and computation. Programming using functions and data structures, including lists and trees, equational reasoning, case analysis, recursion, higher-order functions, algebraic and abstract data types. Finite-state machines as a basic model of computation: deterministic and non-deterministic automata; regular expressions; acceptors; structured design of finite state machines. Propositional logic: truth tables; satisfiability; deduction. Applications from different areas will be used to illustrate and motivate the material.
Entry Requirements (not applicable to Visiting Students)
||Other requirements|| SCE H-grade Mathematics or equivalent is desirable.
Note: This course is only available to students on Informatics degrees (including combined degrees with Informatics), or those where it is a compulsory course on their DPT. Maths students may be permitted on the course, subject to capacity.
Information for Visiting Students
|Pre-requisites||SCE H-grade Mathematics or equivalent is desirable.
|High Demand Course?
Course Delivery Information
|Academic year 2021/22, Available to all students (SV1)
|Learning and Teaching activities (Further Info)
Lecture Hours 44,
Seminar/Tutorial Hours 15,
Supervised Practical/Workshop/Studio Hours 10,
Programme Level Learning and Teaching Hours 4,
Directed Learning and Independent Learning Hours
|Assessment (Further Info)
|Additional Information (Assessment)
The course will be assessed through a combination of short low-stakes quizzes (altogether worth 20% of the course mark) and weekly exercises (altogether worth 80% of the course mark).
||Each student will attend one tutorial a week, each with an attached coursework assignment. There will also be multiple-choice quizzes attached to lectures.
|No Exam Information
On completion of this course, the student will be able to:
- Use sets, functions and relations to create a simple mathematical model of a real-world situation and use the syntax and semantics of propositional logic to express simple constraints.
- Solve simple programming tasks and define appropriate data types. Choose appropriate decompositions of given problems and compose corresponding functional programs from suitable function definitions, including their types.
- Read and write programs that use basic list processing functions, list comprehensions, case analysis, recursion, and higher-order functions. Understand algorithms for searching and sorting. Document, test and debug programs.
- Formalise simple propositional reasoning using various methods, including truth tables.
- Design finite state acceptors for particular languages. Use regular expressions to search for simple patterns. Understand the relationship between finite state acceptors and regular expressions.
|Introduction to Computation, by Sannella, Fourman, Peng, and Wadler.|
|Graduate Attributes and Skills
|Course organiser||Prof Philip Wadler
Tel: (0131 6)50 5174
|Course secretary||Ms Kendal Reid
Tel: (0131 6)51 3249