Main page | Study Branches/Specializations | Groups of Courses | All Courses | Roles                Instructions

A course is the basic teaching unit, it's design as a medium for a student to acquire comprehensive knowledge and skills indispensable in the given field. A course guarantor is responsible for the factual content of the course.
For each course, there is a department responsible for the course organisation. A person responsible for timetabling for a given department sets a time schedule of teaching and for each class, s/he assigns an instructor and/or an examiner.
Expected time consumption of the course is expressed by a course attribute extent of teaching. For example, extent = 2 +2 indicates two teaching hours of lectures and two teaching hours of seminar (lab) per week.
At the end of each semester, the course instructor has to evaluate the extent to which a student has acquired the expected knowledge and skills. The type of this evaluation is indicated by the attribute completion. So, a course can be completed by just an assessment ('pouze zápočet'), by a graded assessment ('klasifikovaný zápočet'), or by just an examination ('pouze zkouška') or by an assessment and examination ('zápočet a zkouška') .
The difficulty of a given course is evaluated by the amount of ECTS credits.
The course is in session (cf. teaching is going on) during a semester. Each course is offered either in the winter ('zimní') or summer ('letní') semester of an academic year. Exceptionally, a course might be offered in both semesters.
The subject matter of a course is described in various texts.

BIE-HMI History of Mathematics and Informatics Extent of teaching: 2P+1C
Instructor: Šolcová A. Completion: Z,ZK
Department: 18105 Credits: 3 Semester: L

Annotation:
Students will master the methods traditionally used in mathematics and related disciplines - informatics - from different periods of the development of mathematics, and will thus become acquainted with mathematical methods suitable for applications in contemporary computer science.

Lecture syllabus:
1. Introduction. Problems and methods of the history of mathematics and informatics.
2. Mathematics in the oldest civilizations. Numeration. Numerical systems.
3. Encyclopedia of the Ancient times: Eukleid's Foundations. Mathematics in Hellenism.
4. The oldest computer aids. Archimedes and stomachion, Pick's theorem
5. Solving equations and their systems. Mathematics in the Renaissance.
6. Types of evidence: least descent method, mathematical induction. Fermat's discoveries.
7. Descarts' Debate on Method and Analytical Geometry. Mathematics at the beginning of Modern Times.
8. Beginnings of infinitesimal count. W. G. Leibniz and I. Newton. Problems with infinity.
9. Variation methods and optimization.Calculations of planes of planets and small bodies of the solar system and least square method.
10. The oldest mechanical calculators. Charles Babbage and Ada Lovelace
11. Development of combinatorics and discrete mathematics.
12. Gauss Number Theory and its further development
13. Approximation, convergence and computer speed. Alan Turing and Algorithm Concept

Seminar syllabus:
1 hour a week or 2 hours, once every 14 days - will be linked to the theme presented in the lecture. Specific tasks will be solved, students will prepare for independent work, work with sources.

Literature:
1. Naumann, F.: Dějiny informatiky. Od abaku k internetu. Academia, Praha, 2009. (also in German).
2. Chabert, J.-L. et all: A History of Algorithms. From the Pebble to the Microchip, Springer, Berlin-Heidelberg-New York, 1999
3. Graham, R., Knuth, D., Patashnik, O.: ''Concrete Mathematics: A Foundation for Computer Science'', Addison-Wesley, Reading, Mass., 1989.
4. Lovász, L.: ''Combinatorial Problems and Exercises'', 2nd Ed., Akademiai Kiadó Budapest and North- Holland, Amsterdam, 1993.
5. Schroeder, R. M.: ''Number Theory in Science and Communication'', Springer, Berlin, 2006.
6. Křížek, M., Luca, F., Somer, L.: ''17 Lectures on Fermat Numbers: From Number Theory to Geometry'', Springer, New York, 2001.

Requirements:

Information about the course and courseware are available at https://moodle-vyuka.cvut.cz/course/search.php?search=BI-HMI

The course is also part of the following Study plans:
Study Plan Study Branch/Specialization Role Recommended semester
BIE-TI.2015_ORIGINAL Computer Science (Bachelor, in English) VH 6
BIE-TI.2015 Computer Science (Bachelor, in English) VH 6
BIE-WSI-SI.2015 Software Engineering (Bachelor, in English) VH 6
BIE-BIT.2015 Computer Security and Information technology (Bachelor, in English) VH 6


Page updated 29. 3. 2024, semester: L/2021-2, Z,L/2023-4, Z/2021-2, Z/2020-1, Z/2019-20, L/2020-1, Z,L/2022-3, L/2019-20, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška