FI:IB112 Math Foundations - Course Information
IB112 Math Foundations
Faculty of InformaticsSpring 2013
- Extent and Intensity
- 2/2. 4 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- Teacher(s)
- prof. RNDr. Petr Hliněný, Ph.D. (lecturer)
Mgr. Jan Meitner (seminar tutor)
RNDr. Jiří Pecl, Ph.D. (seminar tutor) - Guaranteed by
- prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Computer Science – Faculty of Informatics - Timetable
- Wed 8:00–9:50 B410, Thu 8:00–9:50 B410
- Timetable of Seminar Groups:
- Course Enrolment Limitations
- The course is only offered to the students of the study fields the course is directly associated with.
- fields of study / plans the course is directly associated with
- Informatics with another discipline (programme FI, B-EB)
- Informatics with another discipline (programme FI, B-GE)
- Informatics with another discipline (programme FI, B-GK)
- Informatics with another discipline (programme FI, B-CH)
- Informatics with another discipline (programme FI, B-IO)
- Informatics with another discipline (programme FI, B-TV)
- Public Administration Informatics (programme FI, B-AP)
- Social Informatics (programme FI, B-AP)
- Course objectives
- At the end of the course students should be able to: understand the content of theoretical informatic courses;
- Syllabus
- Naive set theory: set, list of elements, basic operations on set, Cartesian product.
- Number sets: natural numbers, integers, rational and real numbers.
- Relations and function: relations over sets, functions as relations, composition of functions or relations.
- Equivalence and orderings: properties of relations, equivalence, decomposition, partition, partial order, Hasse diagram.
- Mathematical logic: definition of propositional and predicate formulae, validity and satisfability, axiomatization.
- Proofs: direct proof, proof by transposition, proof by contradiction, proof by induction.
- Linear equations: definition of matrices, systems of linear equations, geometric intuition, Gaussian elimination.
- Combinatorics: enumerative combinatorics, combinations, permutations, factorial.
- Combinatorial probability: throws of the dice, shuffling cards, finite probabilistic space.
- Descriptive statistics: statistical population, mean, median, dispersion, correlation.
- Graphs: graph, subgraph, isomorphism, vertex degree, connected components, trees and their properties, flow networks.
- Literature
- Teaching methods
- lectures and class exercises
- Assessment methods
- written exam
- Language of instruction
- Czech
- Further Comments
- Study Materials
The course is taught annually.
- Enrolment Statistics (Spring 2013, recent)
- Permalink: https://is.muni.cz/course/fi/spring2013/IB112