Introduction to Algorithms and Data Structures, Spring 2005, Episode 0

Lecture, January 24

Subject : Discrete Mathematics Primer

Text : CLRS Appendix B.1, B.2, B.3, B.4, B.5, and C.1

Comments: We will review some of the background material and terminology that both the textbook and our course rely heavily on. In particular we shall cover: sets, relations, functions, graphs, trees, and combinatorics. While the primer is not an obligatory part of the course, we strongly recommend this activity to those students who feel that their knowledge of high school math has gotten a bit rusty. You can determine whether you belong to this group by looking at Appendix B of the textbook.

Time : Monday, January 24, 9:00–12:00 (3×50min), Room 2A12