Riadok 78: Riadok 78:
 
== Course grading ==
 
== Course grading ==
 
To be classified student has to achieve at least 50% of every activity:
 
To be classified student has to achieve at least 50% of every activity:
* project  
+
PROJECT  
* * form: essay, presentation, song or movie
+
* form: essay, presentation, song or movie
* * topic: What does mathematics mean for me? What am I expecting from this course?  
+
* topic: What does mathematics mean for me? What am I expecting from this course?  
* * term: 27.10.2017
+
* term: 27.10.2017
* * goal: self-study motivation
+
* goal: self-study motivation
* * weight: 15%
+
* weight: 15%
* Written mid-term test (max. 12 points).
+
 
* Final written-oral exam (max. 24 points, 3 questions).
+
WEEKLY EXAMS
* <b>Overall grading:</b> A (50-46), B (45-41), C (40-36), D (35-31), E (30-26), Fx (25-0).
+
*form: 10-15 minutes writing tests
 +
*term: every Thursday at the beginning of the exercise
 +
*goal:  regular preparation
 +
*weight: 40%
 +
*note: student can also achieve extra (bonus) points for: weekly homeworks, class work (solving problems and schoolmate’s help) and/or self-activity (lecture preparation… )
 +
* <b>Overall grading:</b> A > 90%, B > 80%, C> 70%, D > 60%, E > 52% points.
  
  

Verzia zo dňa a času 08:48, 3. október 2017

Mathematics 2-IKV-102

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

To be classified student has to achieve at least 50% of every activity: PROJECT

  • form: essay, presentation, song or movie
  • topic: What does mathematics mean for me? What am I expecting from this course?
  • term: 27.10.2017
  • goal: self-study motivation
  • weight: 15%

WEEKLY EXAMS

  • form: 10-15 minutes writing tests
  • term: every Thursday at the beginning of the exercise
  • goal: regular preparation
  • weight: 40%
  • note: student can also achieve extra (bonus) points for: weekly homeworks, class work (solving problems and schoolmate’s help) and/or self-activity (lecture preparation… )
  • Overall grading: A > 90%, B > 80%, C> 70%, D > 60%, E > 52% points.


Information list

Course information sheet >