Gäller från och med: Spring 2016
Beslutad av: Professor Thomas Johansson
Datum för fastställande: 2016-10-27
Avdelning: Computer Science (LTH)
Kurstyp: Ren forskarutbildningskurs
Undervisningsspråk: English
The aim of the course is to introduce concepts in discrete structures that are central to computer science.
Kunskap och förståelse
För godkänd kurs skall doktoranden
Färdighet och förmåga
För godkänd kurs skall doktoranden
Sets, relations, functions, induction, recursion, trees, grafs, propositional logic, predicate logic, interactive proof assistants.
The preface and the chapters on Basics, Induction, and Lists are included in the course.
Undervisningsformer: Seminarier, laborationer, övningar, övrigt. 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.
Examinationsformer: Inlämningsuppgifter, övrigt.
Active participation at seminars. The assignments include both solutions to exercises and feedback on other solutions.
Betygsskala: Underkänd, godkänd
Examinator:
In addition to the course book, certain material from the internet is included (videos and lecture notes).
Kursansvariga:
Hemsida: http://cs.lth.se/forskning/doktorandkurser-phd-courses/