FI:MB141 Linear alg. and discrete math - Course Information
MB141 Linear algebra and discrete mathematics
Faculty of InformaticsSpring 2020
- Extent and Intensity
- 2/2/0. 3 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).
- Teacher(s)
- doc. RNDr. Martin Čadek, CSc. (lecturer)
Mgr. David Kruml, Ph.D. (seminar tutor)
Mgr. Mária Šimková (seminar tutor)
doc. Mgr. Ondřej Klíma, Ph.D. (assistant)
doc. Ilja Kossovskij, Ph.D. (assistant)
doc. Mgr. Lenka Zalabová, Ph.D. (assistant) - Guaranteed by
- prof. RNDr. Jan Slovák, DrSc.
Department of Computer Science – Faculty of Informatics
Supplier department: Department of Mathematics and Statistics – Departments – Faculty of Science - Timetable
- Mon 17. 2. to Fri 15. 5. Mon 10:00–11:50 D1
- Timetable of Seminar Groups:
MB141/02: Mon 17. 2. to Fri 15. 5. Wed 12:00–13:50 B204, D. Kruml
MB141/03: Mon 17. 2. to Fri 15. 5. Wed 14:00–15:50 B204, D. Kruml
MB141/04: Mon 17. 2. to Fri 15. 5. Mon 16:00–17:50 B204, M. Šimková - Prerequisites (in Czech)
- !NOW( MB151 Linear models ) && ( ! MB151 Linear models || ! MB154 Discrete mathematics ) && ( ! MB101 Mathematics I || ! MB104 Discrete mathematics )
- Course Enrolment Limitations
- The course is also offered to the students of the fields other than those the course is directly associated with.
- fields of study / plans the course is directly associated with
- Image Processing and Analysis (programme FI, N-VIZ)
- Bioinformatics and systems biology (programme FI, N-UIZD)
- Computer Games Development (programme FI, N-VIZ_A)
- Computer Graphics and Visualisation (programme FI, N-VIZ_A)
- Computer Networks and Communications (programme FI, N-PSKB_A)
- Cybersecurity Management (programme FI, N-RSSS_A)
- Formal analysis of computer systems (programme FI, N-TEI)
- Graphic design (programme FI, N-VIZ)
- Graphic Design (programme FI, N-VIZ_A)
- Hardware Systems (programme FI, N-PSKB_A)
- Hardware systems (programme FI, N-PSKB)
- Image Processing and Analysis (programme FI, N-VIZ_A)
- Information security (programme FI, N-PSKB)
- Informatics (programme FI, B-INF) (2)
- Informatics in education (programme FI, B-IVV) (2)
- Information Security (programme FI, N-PSKB_A)
- Quantum and Other Nonclassical Computational Models (programme FI, N-TEI)
- Computer graphics and visualisation (programme FI, N-VIZ)
- Computer Networks and Communications (programme FI, N-PSKB)
- Principles of programming languages (programme FI, N-TEI)
- Programming and development (programme FI, B-PVA)
- Cybersecurity management (programme FI, N-RSSS)
- Services development management (programme FI, N-RSSS)
- Software Systems Development Management (programme FI, N-RSSS)
- Services Development Management (programme FI, N-RSSS_A)
- Software Systems Development Management (programme FI, N-RSSS_A)
- Software Systems (programme FI, N-PSKB_A)
- Software systems (programme FI, N-PSKB)
- Machine learning and artificial intelligence (programme FI, N-UIZD)
- Teacher of Informatics and IT administrator (programme FI, N-UCI)
- Informatics for secondary school teachers (programme FI, N-UCI) (2)
- Computer Games Development (programme FI, N-VIZ)
- Processing and analysis of large-scale data (programme FI, N-UIZD)
- Natural language processing (programme FI, N-UIZD)
- Course objectives
- Introduction to linear algebra, analytical geometry and elementary number theory.
- Learning outcomes
- At the end of this course, students should be able to: understand basic concepts of linear algebra; apply these concepts to iterated linear processes; solve basic problems in analytical geometry; apply elemntary number theory on kryptography.
- Syllabus
- Obsah kurzu Lineární:
- 1. Geometry in plane. Complex numbers. 2. Systems of linear equations. Gauss elimination. 3. Operation with matrices. Inverse matrix, determinent. 4. Vector spaces, báses, dimension, coordinates. 5. Linear mappings, eigenvalues and eigenvectors. 6. Linear processes. 7. Afinne geometry. 8. Scalar product, Eukleidian geometry. 9. Linear optimization. 10. Elementry number theory. 11. Congruences. 12. Application in kryptography.
- Literature
- PANÁK, Martin, Jan SLOVÁK and Michal BULANT. Matematika drsně a svižně (Brisk quide to mathematics). 2013. ISBN 978-80-210-6307-5. Available from: https://dx.doi.org/10.5817/CZ.MUNI.O210-6380-2013. Základní učebnice matematiky pro vysokoškolské studium. Na MU využívána zejména jako podpora výuky matematiky na Fakultě informatiky. info
- Teaching methods
- Two hours of lectures, two hours of tutorial. Lecture covering the theory with illustrative solved problems. Tutorials devoted to solving numerical problems.
- Assessment methods
- During the semester, two obligatory mid-term exams are evaluated (each for max 10 points). In the seminar groups there are 5 tests during the semester. The seminars are evaluated in total by max 5 points. Students, who collect during the semester (i.e., from tests and mid-term exams) less than 8 points, are graded as F and they can proceed to the final examination only for correction. The final exam is two hours long and written for max 20 points. For successful examination (the grade at least E) the student needs in total at keast 22 points and at least 5 point from the final exam.
- Language of instruction
- Czech
- Further comments (probably available only in Czech)
- Study Materials
- Listed among pre-requisites of other courses
- MB143 Design and analysis of statistical experiments
(MB141 || MB142 || MB151 || MB152) && !MB153 && !NOW(MB153) - MB151 Linear models
!NOW(MB141) - PV275 Introduction to Quantum Computer Programming
( MB141 || MB151 || MB101 || MB201 ) && IB111
- MB143 Design and analysis of statistical experiments
- Teacher's information
- https://is.muni.cz/auth/ucitel/?fakulta=1433;obdobi=7644
More information can be found in IS of the course.
- Enrolment Statistics (Spring 2020, recent)
- Permalink: https://is.muni.cz/course/fi/spring2020/MB141