Details for the Course Syllabus for Course EDA030F valid from Spring 2016

General

Aim

The aim of the course is to introduce concepts in discrete structures that are central to computer science.

Contents

Sets, relations, functions, induction, recursion, trees, grafs, propositional logic, predicate logic, interactive proof assistants.

Knowledge and Understanding

For a passing grade the doctoral student must
understand basic concepts in discrete structures
understand the structure of proofs

Competences and Skills

For a passing grade the doctoral student must
be able to apply concepts in discrete structures on problems in computer science
be able to apply basic techniques to construct proofs

Judgement and Approach

Types of Instruction

Seminars
Laboratory exercises
Exercises
Miscellaneous
Comments:
The course is given in the form of exercises, labs, peer marking, and seminarier. Before each seminar, the PhD student shall read course material and do exercises and/or labs. Each PhD student will do peer marking of certain exercises and/or labs. At the seminars, different solutions are discussed.

Examination Formats

Written assignments
Miscellaneous
Comments:
Active participation at seminars. The assignments include both solutions to exercises and feedback on other solutions.
Grading scale:
Failed, pass

Admission Requirements

Assumed Prior Knowledge

Selection Criteria

Literature

Literature:
Makinson, D.: Sets, Logic, and Maths for Computing, 2nd edition.. Springer, 2012. ISBN 9781447124993.
Pierce, Benjamin C.: Software Foundations. Electronic textbook. Version 4.0.. 2016.
Comments:
The preface and the chapters on Basics, Induction, and Lists are included in the course.

Further Information

In addition to the course book, certain material from the internet is included (videos and lecture notes).

Course code

Administrative Information

All Published Course Occasions for the Course Syllabus

No matching course occasions were found.

0 course occasions.