Discrete mathematics

Description

Discrete mathematics covers the basic concepts of set theory, relations, functions, combinatorics, boolean algebra, mathematical logic, graph theory, trees and networks. the subject teaches students the mathematical foundations of discrete structures, their analysis and modeling methods, as well as their application in programming, algorithm design, data structures, and computer science. the subject serves to use theoretical knowledge in solving practical problems, to develop logical thinking and analytical thinking skills.

Course learning outcomes

1. 1

   CLO 1: He should know the basic concepts of mathematical logic, axiomatic methods, understanding of syntax and semantics, experience of working in formal languages.

2. 2

   CLO 2: Must have knowledge of the basics of discrete mathematics and its applications in programming.

3. 3

   CLO 3: He should learn the basic methods of discrete information processing.

4. 4

   CLO 4: Must know boolean algebra and minimization of boolean functions.

5. 5

   CLO 5: Define the elements of graph theory, types of graphs, typical properties he should learn how to present problems in the form of graphs and solve them.

6. 6

   CLO 6: Must have knowledge of flow and trees in network.