T2_IB000 Mathematical Foundations of Computer Science

Pan-university studies
Spring 2013
Extent and Intensity
0/4. 0 credit(s). Type of Completion: -.
Teacher(s)
prof. RNDr. Petr Hliněný, Ph.D. (lecturer)
Mgr. Lukáš Másilko (seminar tutor)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: Mgr. Lukáš Másilko
Supplier department: Support Centre for Students with Special Needs
Timetable of Seminar Groups
T2_IB000/T01: Tue 14:00–15:55 Učebna S4 (35a), Thu 14:00–15:55 Učebna S4 (35a), L. Másilko
Prerequisites (in Czech)
SOUHLAS
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
there are 19 fields of study the course is directly associated with, display
Course objectives
This course is focused on understanding basic mathematical concepts necessary for study of computer science. This is essential for building up a set of basic concepts and formalisms needed for other theoretical courses in computer science. At the end of this course the successful students should: know the basic mathematical notions; understand the logical structure of mathematical statements and mathematical proofs; know discrete mathematical structures such as finite sets, relations, functions, and graph; be able to precisely formulate their claims, algorithms, and relevant proofs; and apply acquired knowledge in other CS courses as well as in practice later on.
Syllabus
  • The course focuses on understanding basic mathematical tools:
  • Basic formalisms - statements, proofs, and propositional logic.
  • Proof techniques, mathematical induction.
  • Sets, relations, and functions.
  • Binary relations, equivalence.
  • Partial orderings and closures.
  • Properties of functions, composition.
  • Basics of graphs, connectivity, trees.
  • Graph searching, distance, spanning trees.
  • Directed graphs, network flows.
  • Proof techniques for algorithms, induction.
  • Advanced proof techniques for algorithms.
  • Infinite sets and the halting problem.
Literature
    required literature
  • HLINĚNÝ, Petr. Úvod do informatiky. Elportál. Brno: Masarykova univerzita, 2010. ISSN 1802-128X. URL info
    recommended literature
  • MATOUŠEK, Jiří and Jaroslav NEŠETŘIL. Kapitoly z diskrétní matematiky. 3., upr. a dopl. vyd. V Praze: Karolinum, 2007, 423 s. ISBN 9788024614113. info
Teaching methods
This is a tutorial-based course.
Assessment methods
No completion. The subject is only offered to students with special needs. It is designed as a record of individual instruction.
Language of instruction
Czech
Further comments (probably available only in Czech)
Information on completion of the course: Předmět se neukončuje.
The course is taught annually.
General note: Předmět je určen pouze studentům se specifickými nároky. Slouží k evidenci individuální výuky.
Information on course enrolment limitations: Předmět je určen pouze studentům se specifickými nároky. Slouží k evidenci individuální výuky.
Teacher's information
http://is.muni.cz/el/1433/podzim2012/IB000/index.qwarp
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/cus/spring2013/T2_IB000