SubjectsSubjects(version: 877)
Course, academic year 2020/2021
Programming II - NPRM045
Title: Programování II
Guaranteed by: Department of Software and Computer Science Education (32-KSVI)
Faculty: Faculty of Mathematics and Physics
Actual: from 2016
Semester: summer
E-Credits: 5
Hours per week, examination: summer s.:2/2 C+Ex [hours/week]
Capacity: unlimited
Min. number of students: unlimited
State of the course: cancelled
Language: Czech
Teaching methods: full-time
Guarantor: RNDr. Rudolf Kryl
RNDr. Martin Pergel, Ph.D.
Classification: Informatics > Programming
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 : NPRG031
Interchangeability : NMIN102, NPRG031
Z//Is interchangeable with: NMUG104
XP//In complex pre-requisite: NPRG041, NPRX041
Annotation -
Last update: T_KSVI (04.05.2005)
The second part of basic course of programming for students of mathematics. Beside programming in Pascal it covers the main problems of algorithm and program design.
Literature - Czech
Last update: RNDr. Rudolf Kryl (04.05.2005)
  • P.Töpfer: Algoritmy a programovací techniky, Prometheus Praha 1995
  • N.Wirth: Algorithms + Data Structures = Programs , Prentice Hall Englewood Cliffsů; New Jersey 1975
  • slovenský překlad N. Wirth: Algoritmy a štruktúry údajov, Alfa, Bratislava 1989
  • I.Libicher, P.Töpfer: Od problému k algoritmu a programu, Grada Praha 1992

Syllabus -
Last update: T_KSVI (08.05.2005)
1. Pascal
  • Graphics on PC, unit Graph in Borland Pascal
  • Pointer types, dynamic allocation variables
  • Object programming in Borland Pascal
  • Delphi
2. Algorithms and programming
  • Time and memory complexity of algorithms and problems
  • Basic methods of internal sorting (straightforward methods, quicksort, heapsort, mergesort, radixsort)
  • File sorting
  • Linear linked lists, stack and queue
  • Trees, graphs, and basic algorithm on them
  • Evaluation of arithmetic expressions
  • Object programming

Charles University | Information system of Charles University |