1 The Goal
5.1 Midterm Exams
5.3 Final Exam
Welcome to Discrete Structures and Combinatorics homepage
The purpose of the course is to learn basic concepts in Discrete Math, especially in Combinatorics and Graph Theory. The course covers fundamental topics that are widely used in theoretical and applied computer science, for example, in data structures and algorithms design, in programming languages and in many other branches of computer science.
Many of the problems discussed in the course, appeared first as riddles. However, besides the fun in solving them, we will present techniques for reasoning about such problems and for solving them, which are important also beyond the scope of computer science.
ContactPlease, send your emails with problems/requests to the course email (firstname.lastname@example.org). These emails will be forwarded to a person who is able to take care of your problem. In your emails please state your full name and ID.
StaffSee Course info
TextbooksWe will mainly use the books below, but there are plenty of good books that cover the material of the course.
- מתמטיקה בדידה. נתי ליניאל, מיכל פרנס
- Discrete and Combinatorial Mathematics: An Applied Introduction. Ralph P. Grimaldi.