Riadok 68: | Riadok 68: | ||
|} | |} | ||
+ | == References == | ||
+ | |||
+ | * Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi. | ||
+ | Rose-Hulman Institute of Technology: Pearson, 2004. [http://ceiucaweb.com.ar/documentos/6-informatica/3er-anio-2do-cuatri/estructura-de-datos/apunte/Discrete_and_Combinatorial_Mathematics_5th_ed_-_R._Grimaldi.pdf Download here]; | ||
+ | * Calculus / Gilbert Strang. Massachusetts Institute of Technology: Wellesley-Cambridge Press. [https://ocw.mit.edu/ans7870/resources/Strang/Edited/Calculus/Calculus.pdf Download here]; | ||
+ | * Fundamentals of Linear Algebra / James B. Carrell. Canada: University of British Colombia, 2005. [https://www.math.ubc.ca/~carrell/NB.pdf Download here]; | ||
+ | * Artificial Intelligence: A Modern Approach / Stuart Russell and Peter Norvig. The USA: Pearson, 2010. [http://dai.fmph.uniba.sk/courses/ICI/russell-norvig.AI-modern-approach.3rd-ed.2010.pdf Download here]; | ||
+ | |||
+ | == Course grading == | ||
+ | |||
+ | * Active participation during the semester (max. 14 points). | ||
+ | * Written mid-term test (max. 12 points). | ||
+ | * Final written-oral exam (max. 24 points, 3 questions). | ||
+ | * <b>Overall grading:</b> A (50-46), B (45-41), C (40-36), D (35-31), E (30-26), Fx (25-0). | ||
Verzia zo dňa a času 09:44, 3. október 2017
Mathematics 2-IKV-102
Obsah
The lectures will provide students with basics of propositional and predicate logic, linear algebra, mathematical analysis, and probability that are important for the study of informatics and its role in (computational) cognitive science. At the same time, students will learn about mathematical culture, notation, way of thinking and expressing oneself.
Course schedule
Type | Day | Time | Room | Lecturer |
---|---|---|---|---|
Lecture | Tuesday | 11:30 | M-112 | Martina Koronci Babinská |
Excercise | Thursday | 09:50 | M-112 | Martina Koronci Babinská |
Syllabus
Date | Topic | References |
---|---|---|
03.10. | Introduction. The basics of logic and proving methods: propositional logic. | Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
Rose-Hulman Institute of Technology: Pearson, 2004; Download here; chap. 2.1, 2.2 |
05.10. | Introduction. The basics of logic and proving methods: predicate logic. | Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
Rose-Hulman Institute of Technology: Pearson, 2004; Download here; chap. 2.4, 2.5, 2.6 |
Homework
Date | Homework | Points | References |
---|---|---|---|
05.10. | Choose 2 Excercises from the Excercise 2.1 (page 54). | 1 point / excercise | Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
Rose-Hulman Institute of Technology: Pearson, 2004; Download here; |
References
- Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
Rose-Hulman Institute of Technology: Pearson, 2004. Download here;
- Calculus / Gilbert Strang. Massachusetts Institute of Technology: Wellesley-Cambridge Press. Download here;
- Fundamentals of Linear Algebra / James B. Carrell. Canada: University of British Colombia, 2005. Download here;
- Artificial Intelligence: A Modern Approach / Stuart Russell and Peter Norvig. The USA: Pearson, 2010. Download here;
Course grading
- Active participation during the semester (max. 14 points).
- Written mid-term test (max. 12 points).
- Final written-oral exam (max. 24 points, 3 questions).
- Overall grading: A (50-46), B (45-41), C (40-36), D (35-31), E (30-26), Fx (25-0).