I001 Introduction to Programming

Faculty of Informatics
Autumn 2000
Extent and Intensity
2/2. 2 credit(s) (plus extra credits for completion). Recommended Type of Completion: k (colloquium). Other types of completion: zk (examination), z (credit).
Teacher(s)
doc. RNDr. Renata Ochranová, CSc. (lecturer)
RNDr. Jaroslav Pelikán, Ph.D. (lecturer)
RNDr. Michal Batko, Ph.D. (seminar tutor)
Mgr. Josef Cacek (seminar tutor)
Mgr. Tomáš Hanžl (seminar tutor)
Jaroslav Jedlička (seminar tutor)
Mgr. Zdeněk Kaminski (seminar tutor)
Mgr. Lubomír Krejčí (seminar tutor)
Petr Lautrbach (seminar tutor)
Mgr. Tomáš Opluštil (seminar tutor)
prof. RNDr. Tomáš Pitner, Ph.D. (seminar tutor)
Mgr. Jaromír Skřivan (seminar tutor)
Mgr. Jan Sluka (seminar tutor)
RNDr. Aleš Zlámal (seminar tutor)
Mgr. Jitka Žídková (seminar tutor)
Guaranteed by
prof. RNDr. Mojmír Křetínský, CSc.
Department of Computer Science – Faculty of Informatics
Contact Person: RNDr. Jaroslav Pelikán, Ph.D.
Prerequisites (in Czech)
! U111 Design of Algorithms for CS II &&! U110 Návrh algoritmů pro VT I &&! I002 Algorithms I
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
Syllabus
  • Output, constants.
  • Input, variables.
  • Conditional statement, loop.
  • Text file.
  • Algorithms based on recurrence relation.
  • Procedures and functions, parameters, recursion, side effect.
  • Data types (abstraction, representation, data processing): array, string, set, record, file, text file.
  • Basic algorithms: searching, sorting.
  • Numerical algorithms: precision, errors.
  • Non-numerical algorithms: text processing, graphics.
  • Algorithm analysis: correctness, effectivity.
  • Asymptotic time complexity: polynomial, exponential and optimal algorithms.
Literature
  • Borland Pacsal 7.0 manuál, Borland International, 1992
  • DRÓZD, Januš and Rudolf KRYL. Začínáme s programováním. 1. vyd. Praha: Grada, 1992, 306 s. ISBN 80-85424-41-X. info
  • WIRTH, Niklaus. Algoritmy a štruktúry údajov. Translated by Pavol Fischer. 2. vyd. Bratislava: Alfa, 1989, 481 s. ISBN 80-05-00153-3. info
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is taught every week.
The course is also listed under the following terms Autumn 1995, Autumn 1996, Autumn 1997, Autumn 1998, Autumn 1999, Autumn 2001.
  • Enrolment Statistics (Autumn 2000, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2000/I001