Return to Blerina Sinaimeri

Discrete Mathematics (Fall 2017)

Description of the course

The course provides an introduction to graph theory and graph algorithms. It covers: Basic definitions in Graph Theory (directed and undirected graphs, basic terminology, paths and circuits, trees and their properties, rooted trees, spanning trees, etc.), Graph traversals (BFS and DFS), Shortest paths in weighted graphs (Dijkstra’s algorithm), Maximum Matchings.

Lecture notes

  • Notes for Lecture I pdf
  • Notes for Lecture V pdf

Practice material

  • Some exercises to practice. pdf

Past exams

    Attention only the exercises related to the part of Discrete Maths are shown.

  • Exercise 2016 pdf
  • Exercise 2014 pdf
  • Exercise 2013 pdf

  • Exercise 2012 pdf


Permanent link to this article: