I001 Introduction to Programming

Faculty of Informatics
Autumn 1996
Extent and Intensity
2/2. 4 credit(s). Recommended Type of Completion: k (colloquium). Other types of completion: zk (examination), z (credit).
Teacher(s)
doc. RNDr. Renata Ochranová, CSc. (lecturer)
Guaranteed by
Contact Person: doc. RNDr. Renata Ochranová, CSc.
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, error.
  • Non-numerical algorithms: text processing, graphics.
  • Algorithm analysis: correctness, effectivity.
  • Asymptotic time complexity: polynomial, exponential and optimal algorithms.
Language of instruction
Czech
The course is also listed under the following terms Autumn 1995, Autumn 1997, Autumn 1998, Autumn 1999, Autumn 2000, Autumn 2001.
  • Enrolment Statistics (Autumn 1996, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn1996/I001