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.
BIK-HMI History of Mathematics and Informatics Extent of teaching: 13KP+2KC Instructor: Šolcová A. Completion: ZK Department: 18105 Credits: 3 Semester: L Annotation:
This course is presented in Czech.
Lecture syllabus:
Matematika v období helénismu.
1. Úvod. Problemy a metody historie matematiky a informatiky. 2. Matematika v nejstarších civilizacích. Numerace. Číselné soustavy. 3. Encyklopedie antiky: Eukleidovy Základy. Archimedés a stomachion, Pickova věta
4. Nejstarší výpočetní pomůcky Výpočty drah planet a malých těles slunečni soustavy a metoda nejmenších čtverců
5. Řešení rovnic a jejich soustav. Matematika v renesanci. 6. Typy důkazů: metoda nejmenšího sestupu, matematická indukce. Fermatovy objevy. 7. Descartova Rozprava o metodě a analytická geometrie. Matematika na počátku novověku. 8. Počátky infinitezimálního počtu. W. G. Leibniz a I. Newton. Problémy s nekonečnem. 9. Variační metody a optimalizace Charles Babbage a Ada Lovelace
10. Nejstarší mechanické kalkulátory. a její další vyvoj
11. Rozvoj kombinatoriky a diskrétní matematiky. 12. Gaussova teorie čísel
13. Aproximace, rychlost konvergence a počítače. Alan Turing a koncepce algoritmu Seminar syllabus:
Cvičení (seminář 1 hod. týdně nebo nebo 2 hod. jednou za 14 dní ) bude navazovat na temata vyložená v přednášce. Budou řešeny konkretní úlohy, studenti se budou připravovat na samostatnou práci, práci s prameny.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:
Informace o předmětu a výukové materiály naleznete na https://moodle-vyuka.cvut.cz/course/search.php?search=BIK-HMI The course is also part of the following Study plans:
Page updated 18. 4. 2024, semester: L/2020-1, L/2023-4, L/2019-20, Z/2021-2, L/2022-3, Z/2023-4, Z/2019-20, Z/2022-3, L/2021-2, Z/2024-5, Z/2020-1, Send comments to the content presented here to Administrator of study plans Design and implementation: J. Novák, I. Halaška