| |
VIRTUAL LIBRARY
for Bachelor and Master Degree Students
Course: Discrete Structures |
| Showing URLs 1 to 2 of 2 |
|
http://81.161.243.40/subjects/_index.php?cid=24710631
|
| Available in: |
Bulgarian, English |
| Anotation: |
The aim of the course “Discrete structures” is to introduce the students to the basic mathematical systems and tools used in the computer area for formalization, mathematical description and abstract presentation of different computer discrete structures. The main knowledge is connected to the basic mathematical tools as the functions and relations, the theory of sets, logic and Boolean algebra, graphs theory, Petri nets, discrete probability, Markov chains and queuing systems. In this connection, the basic theoretical definitions and graphical presentation for discrete structures are given and there main parameters are defined. Some practical examples for presentation of typical computer systems and processes are presented and the analysis of there deterministic characteristics are evaluated.
The course is related to the all next courses during the computer education, because the discrete structures are used for the presentation of different computer units and systems, programs and processes. |
| ECTS credits: |
5 |
| Entered on: |
29 August 2004 |
|
|
http://if.vdu.lt/~mat221/
|
| Available in: |
English |
| Anotation: |
Relationship between discrete and infinitesimal mathematics. Formal Systems. Goedel's theorem of incompleteness. Paradoxes of logic, place of logic in the context of entire mathematics. Relations and graphs. Graph search algorithms. Shortest path problems, minimum spanning trees. Random graphs. Algorithm complexity. P, NP and NP-complete language classes. Computationally tractable and intractable problems. Introduction to combinatorics. Combinatorial trees, algorithms for combinatorial enumeration, usage of generating functions in combinatorics. Recurrence relations, solution of linear recurrence relations, using generating functions in solution of recurrence relations. Concepts of a state and a system. Finite automata, state transition graphs, identification of finite automata. Algebraic structures: semi-groups, groups, rings and fields. Applications of finite fields in automata description. |
| ECTS credits: |
4 |
| Entered on: |
29 August 2004 |
|
|
|
|
