| Lesson Code | Course Name | Class | Credit | Lesson Time | Weekly Lesson Hours (Theoretical) | Weekly Lesson Hours (Practice) | Weekly Class Hours (Laboratory) |
|---|---|---|---|---|---|---|---|
| DM 2210 | Dıscrete Mathematıcs | Екінші курс | 5 | 150 | 1 | 2 | 2 |
Equipping students with a mathematical apparatus that can be viewed as a closely interconnected set of mathematical methods and models, languages, aimed at producing applied problems. This subject includes elements of set theory, elements of combinatorics, logic algebra functions, elements of graph theory, elements of coding theory.
Database in information systems.
--
Narrative, exchange of ideas, discussion, problem methods.
| 1 | Uses special mathematical symbols to express quantitative and qualitative relationships between objects. |
| 2 | Knows the basic concepts of set theory, basic operations applied to sets and representations. |
| 3 | Understands algorithmic counting (generation) of basic combinatorial objects. |
| 4 | Knows the language of mathematical logic and logical operations, logic formulas, laws of logic algebra. |
| 5 | Defines the types of graphs and gives their characteristics. |
| 6 | Generates efficient codes used to detect and correct errors in code combinations. |
| 7 | Uses the apparatus of set theory to solve applied problems and studies the properties of binary relations. |
| 8 | Learns the methods of generating combinatorial problems. |
| 9 | Formulates logical problems and uses mathematical logic tools to solve them. |
| 10 | Master the skills of working with algorithms in graphs and methods of solving extreme problems in graphs. |
| 11 | Can encode and decode information according to given algorithms. |
| Haftalık Konu | Evaluation Method | |
|---|---|---|
| 1 | Sets and operations on them. | |
| 2 | Relationships and their properties. | |
| 3 | Functions. | |
| 4 | Combinatorial configurations. Placements. Substitutions. Dials. Binomial coefficients and their properties. | |
| 5 | Partition the set. The principle of inclusion and exclusion. | |
| 6 | Functions of logic algebra. Formulas. | |
| 7 | Properties of elementary functions. The principle of duality. | |
| 8 | Classification of Boolean functions by variables. Fullness and tightness. | |
| 9 | Important closed classes. | |
| 10 | Minimization of Boolean functions. | |
| 11 | Graphs and similar objects. Isomorphism of graphs. | |
| 12 | Types of graphs and their operations. Ways to transfer graphs. | |
| 13 | Trees and their main properties. Eulerian and Hamiltonian counts. | |
| 14 | Alphabetical coding. The problem of recognizing the mutual ambiguity of coding. Efficient coding. Huffman and Fano algorithms. | |
| 15 | Error detection and correction codes. Hamming code. |
| PÇ1 | PÇ2 | PÇ3 | PÇ4 | PÇ5 | PÇ6 | PÇ7 | PÇ8 | PÇ9 | PÇ10 | PÇ11 | PÇ12 |
|---|
| Textbook / Material / Recommended Resources | ||
|---|---|---|
| 1 | A. Tolep, B. Yeskarayeva. Discrete mathematics. Theory and practice. -Shymkent, 2020. -132 p. | |
| 2 | A.Tolep, B. Yeskarayeva. Discrete mathematics. Tasks and exercises. Educational tool. - Turkestan, 2021. - 221p. | |
| 3 | I. Orazov, B. Alikhanova, A. Sharipbai. Mathematical foundations of computer science. Teaching manual, -Shymkent: Alem, 2020. -192 p. | |
| 4 | Beisekov Zh. A methodological tool for solving logical problems in mathematics.-Shymkent, 2017. |