Hlavné menu
  1. DAI
  2. Education
  3. Courses
  1. DAI
  2. Education
  3. Master program in Cognitive Science
  4. Courses for 2-IKV
Riadok 20: Riadok 20:
 
|-
 
|-
 
|Lecture/Exercise
 
|Lecture/Exercise
−
|Wednesday
+
|Tuesday
−
|11:30
+
|08:10
−
|M-X
+
|M-I
 
|[[Martina Babinská|Martina Babinská]]
 
|[[Martina Babinská|Martina Babinská]]
 
|-
 
|-
 
|Exercise/Lecture
 
|Exercise/Lecture
 
|Thursday
 
|Thursday
−
|13:10
+
|11:30
−
|M-II
+
|M-III
 
|[[Martina Babinská|Martina Babinská]]
 
|[[Martina Babinská|Martina Babinská]]
 
|}
 
|}
Riadok 39: Riadok 39:
 
!References
 
!References
 
|-
 
|-
−
|27.09.
+
|24.09.
−
|Introduction, The basics of logic and proving methods: propositional logic.  
+
|Introduction, The set of numbers, cardinality, custom and general sets, the set theory.
 
|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
 
|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
−
Rose-Hulman Institute of Technology: Pearson, 2004;chap. 2.1
+
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 3
  
 
|-
 
|-
−
|03.10.
+
|26.09.
−
|The basics of logic and proving methods: primitive vs. compound statement, conjunction, disjunction, implication, biconditional. Its truth values and negations
+
|The basics of logic and proving methods: statement vs. sentence.
 
|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
 
|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
−
Rose-Hulman Institute of Technology: Pearson, 2004;chap. 2.1
+
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2
  
 
|-
 
|-
−
|04.10.
+
|01.10.
−
|The basics of logic and proving methods: Proving methods in propositional logic, Sets (sets of numbers, cardinality of a set, custom and general sets)
+
|The basics of logic and proving methods: primitive vs. compound statement, Conjunction, Disjunction, Implication, Biconditional. and its truth values. Quantifiers. 
 
|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
 
|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
−
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2.2, 2.3
+
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2
  
 
|-
 
|-
−
|10.10.
+
|03.10.
−
|The basics of logic and proving methods: Quantifiers, its negations and truth values
+
|The basics of logic and proving methods: Negation, Logical Equivalence, Contradiction, Tautology.
 
|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
 
|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
−
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2.4
+
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2
  
 
|-
 
|-
−
|11.10.
+
|08.10.
−
|Mathematical Induction and counting with rows (sum and multiplication)
+
|Mathematical Rows: Sum, Multiplication.
 
|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
 
|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
−
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 4.1
+
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2
  
 
|-
 
|-
−
|17.10.
+
|10.10.
−
|The basics of mathematical analysis: mathematical function vs dependency (definition, mathematical functions in the real world )
+
|Proving methods in mathematics, Mathematical Induction.  
−
| Slides from the lecture, https://www.khanacademy.org/math/algebra/algebra-functions
+
|Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.
−
 
+
Rose-Hulman Institute of Technology: Pearson, 2004; chap. 4.1
−
|-
+
−
|18.10.  
+
−
|The basics of mathematical analysis: mathematical function (graph vs. formula, constant and linear mathematical functions)
+
−
| Slides from the lecture,  https://www.khanacademy.org/math/algebra/algebra-functions
+
−
 
+
−
|-
+
−
|24.10.
+
−
|The basics of mathematical analysis: mathematical function (quadratic function)
+
−
|Slides from the lecture,  https://www.khanacademy.org/math/algebra/algebra-functions
+
−
 
+
−
|-
+
−
|25.10.
+
−
|The basics of mathematical analysis: extremes, monotonicity, boundary
+
−
|Slides from the lecture,  https://www.khanacademy.org/math/algebra/algebra-functions
+
−
 
+
−
|-
+
−
|31.10.
+
−
|The basics of mathematical analysis: calculus (the rate of change, derivative definition, derivative in the real world)
+
−
 
+
−
|-
+
−
|07.11.
+
−
|The basics of mathematical analysis: calculus (derivative counting rules)
+
−
 
+
−
|-
+
−
|08.11.
+
−
|The basics of mathematical analysis: calculus (maximum and minimum problem, convex and concave problem)
+
−
 
+
−
|-
+
−
|14.11.  
+
−
|The basics of mathematical analysis: calculus (the chain rule, functions’ characteristics in a view of derivative)
+
−
 
+
−
|-
+
−
|15.11.
+
−
|Repeating and practicing class
+
−
 
+
−
|-
+
−
|21.11.
+
−
|Middle term writing test
+
−
 
+
−
|-
+
−
|22.11.
+
−
|The basics of linear algebra: The basic problem of linear algebra (matrix and vector)
+
−
 
+
−
|-
+
−
|28.11.
+
−
|The basics of linear algebra: The basic problem of linear algebra (vector operations, linear combination)
+
−
 
+
−
|-
+
−
|29.11.
+
−
|The basics of linear algebra: Matrices (basic operations)
+
−
 
+
−
|-
+
−
|05.12.
+
−
|The basics of linear algebra: Matrices (Gaussian Reduction)
+
−
 
+
−
|-
+
−
|06.12.
+
−
|The basics of linear algebra: Matrices (advanced operations)
+
−
 
+
−
|-
+
−
|12.12.
+
−
|The basics of linear algebra: Matrices (eigenvalues, eigenvectors)
+
−
 
+
−
|-
+
−
|13.12.
+
−
|The basics of probability: Introduction (probability in the real world, definition)
+
−
 
+
−
|-
+
−
|13.12.
+
−
|The basics of probability: Introduction (counting basics)
+
−
 
+
−
|-
+
−
|20.12.
+
−
|Repeating and practicing
+
−
 
+
−
|}
+
−
 
+
−
 
+
−
== Homework ==
+
−
 
+
−
{| class="alternative table-responsive"
+
−
!Date
+
−
!Homework
+
−
!Points
+
−
!References
+
−
|-
+
−
|23.09.
+
−
|1. Find and explain IDEAL NUMBERS
+
−
2. Decide, if the statement is true or false
+
−
 
+
−
∀ y ∈ R ∃ x ∈ R: y = x^2
+
−
 
+
−
∃ x ∈ R ∀ y ∈ R: y = x^2
+
−
 
+
−
∃ y ∈ R ∀ x ∈ R: y = x^2
+
−
 
+
−
∃ x ∈ R ∃ y ∈ R: y = x^2
+
−
| 1 point
+
−
2 points
+
−
| -
+
−
 
+
−
|-
+
−
|03.10.
+
−
|1. Chapter 2.1 / Exercise 2.1 / PROBLEM 4
+
−
2. Chapter 2.1 / Exercise 2.1 / PROBLEM 5
+
−
| 1 point
+
−
1 point
+
−
| Discrete and combinatorial mathematics: An applied introduction  
+
−
 
+
−
|-
+
−
|04.10.
+
−
|1. Find (google) DE MORGAN’S LAWS. What does these laws represent? How can we prove them?
+
−
2. Help developers: The problem of REPEATING TASKS
+
−
 
+
−
Repeating task is a task created from its parent task every few (n) days.
+
−
Repeating rules have the next parameters:
+
−
 
+
−
+ Date of the last repeat
+
−
 
+
−
+ Maximum number of repeats
+
−
 
+
−
+ Number of days for repeat (n) (“repeat task every 5 days”)
+
−
 
+
−
+ Number of already repeated tasks (how many times had been task already
+
−
repeated)
+
−
 
+
−
 
+
−
What condition have developer put to the computer to repeat parent task every requested day?
+
−
Find Symbolic form of your solution
+
−
| 2 points
+
−
5 points (in two weeks)
+
−
| -
+
−
 
+
−
|-
+
−
|11.10.
+
−
|1. EXERCISE 4.1, PAGE 208, PROBLEM 1/Choose two of problems a-d
+
−
2. EXERCISE 4.1, PAGE 208, PROBLEM 8
+
−
| 4 points
+
−
2 points
+
−
| Discrete and combinatorial mathematics: An applied introduction
+
−
 
+
−
|-
+
−
|17.10.
+
−
|Based on the graph (see slides from the lecture) describes the
+
−
changes which can be caused if a
+
−
man: is not smoking OR is smoking
+
−
OR quit smoking during his life.
+
−
Write as many information as you
+
−
can.
+
−
| 4 points
+
−
| Slides from the lecture
+
−
 
+
−
|-
+
−
|18.10.
+
−
|Find the graph and a general formula for an absolute value function.
+
−
| 2 points
+
−
|
+
−
 
+
−
|-
+
−
|24.10.
+
−
|Find the graph, domain, range, axis intercepts
+
−
and vertex of a quadratic function:
+
−
r: R → R, y = (x + a) 2 + b
+
−
| 2 points
+
−
|
+
  
 
|}
 
|}

Verzia zo dňa a času 10:36, 10. október 2019

Mathematics for Cognitive Science 2-IKVa-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/Exercise Tuesday 08:10 M-I Martina Babinská
Exercise/Lecture Thursday 11:30 M-III Martina Babinská

Syllabus

Date Topic References
24.09. Introduction, The set of numbers, cardinality, custom and general sets, the set theory. Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.

Rose-Hulman Institute of Technology: Pearson, 2004; chap. 3

26.09. The basics of logic and proving methods: statement vs. sentence. Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.

Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2

01.10. The basics of logic and proving methods: primitive vs. compound statement, Conjunction, Disjunction, Implication, Biconditional. and its truth values. Quantifiers. Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.

Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2

03.10. The basics of logic and proving methods: Negation, Logical Equivalence, Contradiction, Tautology. Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.

Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2

08.10. Mathematical Rows: Sum, Multiplication. Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.

Rose-Hulman Institute of Technology: Pearson, 2004; chap. 2

10.10. Proving methods in mathematics, Mathematical Induction. Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.

Rose-Hulman Institute of Technology: Pearson, 2004; chap. 4.1

References

  • Discrete and combinatorial mathematics: An applied introduction / Ralph P. Grimaldi.

Rose-Hulman Institute of Technology: Pearson, 2004. 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: 06.12.2018
  • goal: self-study motivation
  • weight: 15%

WEEKLY EXAMS AND HOMEWORK

  • form: 10-15 minutes writing tests
  • term: every Wednesday at the beginning of the exercise
  • goal: regular preparation
  • weight: 20%

ACTIVITY

  • form: class work (solving problems and schoolmate’s help)
  • term: every lecture and exercise
  • goal: regular preparation, cooperation and social activity
  • weight: 20%

MIDDLE TERM EXAM

  • form: 90 minutes writing test (student can choose from the offered task sets)
  • term: 21.11.2017
  • goal: progress definition
  • weight: 15%

FINAL EXAM

  • form: 90 minutes writing test
  • term: January, February 2019
  • goal: course output
  • weight: 30%

OVERALL GRADING: A > 90%, B > 80%, C> 70%, D > 60%, E > 52% points.


Information list

Course information sheet >

Zdroj: „http://dai.fmph.uniba.sk/w?title=Course:Mathematics/en&oldid=18635“