lunduniversity.lu.se

Computer Science

Faculty of Engineering, LTH

Denna sida på svenska This page in English

Schedule and material

Course Schedule

This is the preliminary schedule for the course, which will be updated as we go along. In addition to the lectures, you are expected to read and understand the reading material specified.
The exercises are intended to help you check your understanding of the material. I also specify those parts of the book, including the associated exercises, which will be skipped in this course.

weeklectureexercisesseminarlabsfurther reading
13Introduction (slides)
Sets (slides, handouts)
Mo 1000 E:B

exercises

solutions

slides

Fr 1300 MA6





SLAM Chap. 1


On that 0.999... business: :-)

Wikipedia

Mathologer

14Relations (slides, handouts)
Mo 1000 E:B
UPDATED 2019-05-26

exercises

solutions

Fr 1300 MA6

SLAM Chap. 2
Functions
(slides, handouts)
We 1000 E:B

exercises

solutions

SLAM Chap. 3
15To Infinity and Beyond (slides, handouts)
Mo 1000 E:B

exercises

solutions

Numbers

slides
handouts

Fr 1300 MA6

"How big is infinity?" (Dennis Wildfogel)

Section 8.1 of "Mathematics for Computer Science" (Lehman, Leighton, Meyer)

"Abstract Set Theory" (A A Fraenkel)

16Induction and recursion
(slides, handouts)
Mo 1000 E:B

exercises

solutions

We 1300 MA6Lab 1
instructions
code skeleton
(REPACK 2019-04-15)
SLAM Chap. 4, also Sect. 2.7.2
19Trees and graphs
(slides, handouts)
Mo 1000 E:B

exercises

solutions

(corrections 2019-05-24)

Fr 1300 MA6

Lab 2
instructions
code skeleton

SLAM Chap. 7
20Propositional Logic (slides, handouts)
Mo 1000 E:B

exercises

solutions

Fr 1300 MA6

exercises

Lab 3
instructions
code skeleton
SLAM Chap. 8
21Quantificational Logic (slides, handouts)
Mo 1000 E:B

exercises

solutions

Fr 1300 MA6Lab 4
Square Sum Problem
(video, Numberphile)

instructions
code skeleton
(correction: 2019-05-14)

SLAM Chap. 9

Not the same thing as Hamiltonian paths: Eulerian paths (and what they have to do with Königsberg, video, TED-ed)


... and on Numberphile

22A few words on proofs (slides, handouts, in-class exercises, solutions, solutions in BoP)
Mo 1000 E:B
We 1300 MA6

Lab 5
Huffman trees (video, Carleton Moore)
instructions
code skeleton

"Book of Proof", part II

beautiful proofs by contradiction (Mathologer)

David A. Huffman, "A Method for the Construction of Minimum-Redundancy Codes", Proceedings of the I.R.E., 1952

2018 Slides

  1. slides handouts
  2. slides handouts
  3. slides handouts
  4. slides handouts
  5. slides handouts exercises solutions
  6. slides handouts
  7. slides handouts
  8. slides handouts
  9. slides handouts
Page Manager: