CCC-DSII

Course Title

Discrete Structures II

Course Type

CUGS CS Review / CUGS CS Core / CUGS CS Advanced / Other

Periodicity

Once every year.

Suggested # of Credits

4.0 HE Credits (Higher Education Credits)

Intended audience

Doctoral students in computer science.

Course goal

Not Specified.

Prerequisites

Discrete Structures I or similar

Related courses

Contents

  • Well-founded sets and ordinals

  • Inductive definitions and proofs

    • Recurrence formulas

    • Well-founded induction

    • Transfinite induction

  • Lattice theory

    • Complete partial orders

    • Lattices

    • Complete lattices

  • Fixed points

    • Monotonicity

    • Knaster-Tarski's fixed point theorem

    • Continuity

    • Kleene's fixed point theorem

  • Graph theory

    • Basic notions

    • Matching (tentatively)

    • Connectivity (tentatively)

Organized by

Department of Computer Science, Linköping University

Organization

See course schedule.

Examination

Fill in!

Literature

Fill in!

Examiner

Ulf Nilsson

Course homepage

Fill in!

Other information

The course is given in an intensive format ("crash course") at a conference facility.

short-ann

 

Travel reports

Licentiate seminars

PhD-seminars

Courses Fall 2013

Courses Spring 2014

 







Last modified on March 2008 by Anne Moe