FI:MA009 Algebra II - Course Information
MA009 Algebra II
Faculty of InformaticsSpring 2014
- Extent and Intensity
- 2/0. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: zk (examination). Other types of completion: k (colloquium).
- Teacher(s)
- doc. RNDr. Libor Polák, CSc. (lecturer)
doc. Mgr. Michal Kunc, Ph.D. (seminar tutor) - Guaranteed by
- doc. RNDr. Libor Polák, CSc.
Faculty of Informatics
Supplier department: Faculty of Science - Timetable
- Mon 14:00–15:50 B410
- Prerequisites
- ( MB008 Algebra I || MV008 Algebra I ||PROGRAM(N-IN)||PROGRAM(N-AP)||PROGRAM(N-SS))
Prerequisites: MV008 Algebra I. - 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
- Applied Informatics (programme FI, N-AP)
- Information Technology Security (programme FI, N-IN)
- Bioinformatics (programme FI, N-AP)
- Information Systems (programme FI, N-IN)
- Mathematical Informatics (programme FI, B-IN)
- Parallel and Distributed Systems (programme FI, N-IN)
- Computer Graphics (programme FI, N-IN)
- Computer Networks and Communication (programme FI, N-IN)
- Computer Systems (programme FI, N-IN)
- Embedded Systems (eng.) (programme FI, N-IN)
- Embedded Systems (programme FI, N-IN)
- Service Science, Management and Engineering (eng.) (programme FI, N-AP)
- Service Science, Management and Engineering (programme FI, N-AP)
- Social Informatics (programme FI, B-AP)
- Theoretical Informatics (programme FI, N-IN)
- Upper Secondary School Teacher Training in Informatics (programme FI, N-SS) (2)
- Artificial Intelligence and Natural Language Processing (programme FI, N-IN)
- Image Processing (programme FI, N-AP)
- Course objectives
- At the end of the course students should be able to work with ordered sets and abstract algebraic structures including applications. They will gain a serious formal basis for all areas of theoretical computer science.
- Syllabus
- Lattices (semilattices and lattices - two approaches, modular and distributive lattices, Boolean lattices).
- Universal algebra (subalgebras, homomorphisms, congruences and quotient algebras, products, terms, varieties, free algebras, Birkhoff's theorem, rewriting).
- Literature
- Teaching methods
- Once a week a standard lecture with a stress on motivation and examples.
- Assessment methods
- A written exam has three parts: a completion of a text concerning (on advance) given theoretical issues, a completing a proof a new statement, and 3 tests problems where the students show the understanding the basics. It takes two hours. One half of possible points is needed for a success.
- Language of instruction
- Czech
- Further Comments
- Study Materials
The course is taught annually. - Teacher's information
- http://www.math.muni.cz/~polak/algebra-II.html
- Enrolment Statistics (Spring 2014, recent)
- Permalink: https://is.muni.cz/course/fi/spring2014/MA009