home

Discrete Mathematics

Lecture Notes

Reading

Objectives

Evaluation

Exam schedule

Contents

References

Web sites

Elective course

Teaching delivery: lectures, exercises

Master studies, Semester: II

Total hours (lect. + exerc.): 30 + 30 hours

Hours per week (lect. + exerc.): 2 + 2 hours

Instructor:
Dr. Faton Berisha, professor

ECTS: 6

Go to the top

    Objectives:

    Provide students with concepts that are fundamental to computer science but also other disciplines. The course emphasizes the computer science connection through the selection and motivation of topics relevant to computer scientists.

Go to the top

Go to the top

Go to the top

    Contents:

Counting.

Number Theory.

Logic.

Induction.

Probability.

Graphs.

Go to the top

    References:

  1. C. Stein, R. L. Drysdale, K. P. Bogart, Discrete mathematics for computer science, Pearson, 2011
  2. K. H. Rosen, Discrete mathematics and its applications, McGraw-Hill, 2012
  3. E. Lehman, F. T. Leighton, A. R. Meyer, Mathematics for Computer Science, Massachussetts Institute of Technology, 2017
 

Go to the top

    Useful Web sites: