| Kommentar |
Description:
The course deals with the following subjects:
1 Principles of counting
Sets and lists, Lists with repetitions, Lists without repetitions, Sets, Multisets, Functions, Permutations, Generating functions, Decision trees
2 Graph theory
Definitions, Adjacency lists and adjacency matrices, Paths and walks, Euler Paths, Trees, Spanning trees, Matchings, Flows in networks, Petri nets
3 Algebraic methods
Arithmetics, Modular Arithmetic, Polynomials, Finite fields, Codes and Cryptographie, Recognizing and correcting of errors
Learning Targets:
The students are able to model and solve counting-problems with the help of mathematical structures. They know how to solve linear recursions. They are able to model practical problems by graph-theory, among others short-path-problems, matching, and maximal flows. They are capable to analyze concurrent processes by Petri-nets and are able to apply methods for detecting and correcting errors in channel-coding. |
| Literatur |
- Aigner, M.: Diskrete Mathematik, Vieweg,2004.
- Biggs, N.L.: Discrete Mathematics. Oxford University Press,2004.
- Beutelsbacher, M.A. Zschiegner: Diskrete Mathematik für Einsteiger,
- Maurer, St.B.: Discrete Algorithmic Mathematics,
- Anderson,I.: A First Course in Discrete Mathematics |
| Voraussetzungen |
In E3 nicht geeignet für: Mathe, WiWi; Ang. Inf. (IngWi & WiWi), BauIng, EIT, ISE, Masch.bau, Med.technik, NanoEng. Englische Sprachkenntnisse erforderlich. Bitte nehmen Sie zur Kenntnis, dass Sie die E3-Ausschlüsse immer selbständig bei Ihrer Auswahl beachten müssen. Das LSF-System schließt Fehlanmeldungen nicht aus. Auch ist im System nicht ersichtlich, nach welcher PO Sie studieren, oder welche/s Fachwissenschaft/Anwendungsfach vorliegt. |
