Discrete Mathematics in Computer Science

Participation

Please register for the course to gain access to the Adam workspace.

Lecture Slides

NoTopicDateSlides
A1Organizational Matters16.9.screen
print
handout
A2Sets: Foundations16.9.screen
print
handout
A3Proofs: Introduction21.9.screen
print
handout
A4Proof Techniques I21.9.screen
print
handout
A5Proof Techniques II23.9.screen
print
handout
B1Tuples & Cartesian Product28.9.screen
print
handout
B2Relations28.9.screen
print
handout
B3Equivalence Relations and Partitions30.9.screen
print
handout
B4Order Relations5.10.screen
print
handout
B5Operations on Relations7.10.screen
print
handout
B6Functions7.10./12.10.
 
screen
print
handout
B7Permutations14.10.screen
print
handout
B8Sets: Cardinality and Hilbert's Hotel19.10.screen
print
handout
B9Sets: Countability19.10./21.10.screen
print
handout
B10Cantor’s Theorem21.10.screen
print
handout
B11Divisibility & Modular Arithmetic26.10.screen
print
handout
B12Groups28.10.screen
print
handout
C1Introduction to Graphs2.11.screen
print
handout
C2Paths and Connectivity2.11./4.11.screen
print
handout
C3Acyclicity4.11.screen
print
handout

 

To top