The study course is devoted to practical applications of the concepts of discrete mathematics, including graph algorithms and mathematical foundations of databases. Students learn the properties of binary relations, studying in detail the equivalence and order relations. Students get acquainted with the basic concepts of relational databases and the operations of relational algebra. Students learn the basics of graph theory and graph representations. The acquired theoretical knowledge is used in practice by applying graph algorithms for finding the shortest path, finding the minimum spanning tree and computing the maximum flow in a transportation network. Trees, their properties and traversal algorithms are also presented.