SubjectsSubjects(version: 945)
Course, academic year 2023/2024
   Login via CAS
Basics of computer programming - NMUM163
Title: Základy programování
Guaranteed by: Department of Mathematics Education (32-KDM)
Faculty: Faculty of Mathematics and Physics
Actual: from 2018
Semester: winter
E-Credits: 3
Hours per week, examination: winter s.:1/2, C [HT]
Capacity: unlimited
Min. number of students: unlimited
4EU+: no
Virtual mobility / capacity: no
State of the course: cancelled
Language: Czech
Teaching methods: full-time
Teaching methods: full-time
Is provided by: NMUG103
Guarantor: RNDr. Luboš Moravec
Class: M Bc. MZV
M Bc. MZV > Doporučené volitelné
M Bc. MZV > 1. ročník
Classification: Mathematics > Mathematics, Algebra, Differential Equations, Potential Theory, Didactics of Mathematics, Discrete Mathematics, Math. Econ. and Econometrics, External Subjects, Financial and Insurance Math., Functional Analysis, Geometry, General Subjects, , Real and Complex Analysis, Mathematics General, Mathematical Modeling in Physics, Numerical Analysis, Optimization, Probability and Statistics, Topology and Category
Incompatibility : NMUG103, NPRG030
Interchangeability : NPRM044
Is incompatible with: NMUG103
Annotation -
Last update: T_KDM (03.05.2012)
An optional course for prospective teachers. The aim of this course is to provide a brief introduction to the principles of computers, to practice algorithmic thinking, learn simple algorithms and basic principles of procedural programming.
Literature -
Last update: T_KDM (03.05.2012)
  • Töpfer, P. Algoritmy a programovací techniky, Prometheus, Praha 1995.
  • Wróblewski, P. Algoritmy - Datové struktury a programovací techniky, Computer Press, Praha, 2004.
  • Wirth N. Algorithms and Data Structures, Prentice Hall, 1985.

Syllabus -
Last update: T_KDM (03.05.2012)
  • Brief history of computers
  • Fundamental hardware and its functionality
  • Operating systems
  • Programming languages
  • Using IDE
  • Basic commands
  • Variables and constants
  • Basic data structures
  • Input and output
  • Procedures and functions
  • Algorithms and their efficiency
  • Elementary algorithms - divisibility, Euclid's algorithm, sieve of Eratosthenes, Horner's scheme, long numbers, searching in arrays, etc.

Charles University | Information system of Charles University |